In this work, algorithms and architectures for cryptography and source coding are developed, which are suitable for many resource-constrained embedded systems such as non-volatile flash memories. A ne ...Celý popis
In this work, algorithms and architectures for cryptography and source coding are developed, which are suitable for many resource-constrained embedded systems such as non-volatile flash memories. A new concept for elliptic curve cryptography is presented, which uses an arithmetic over Gaussian integers. Gaussian integers are a subset of the complex numbers with integers as real and imaginary parts. Ordinary modular arithmetic over Gaussian integers is computational expensive. To reduce the complexity, a new arithmetic based on the Montgomery reduction is presented. For the elliptic curve point multiplication, this arithmetic over Gaussian integers improves the computational efficiency, the resistance against side channel attacks, and reduces the memory requirements. Furthermore, an efficient variant of the Lempel-Ziv-Welch (LZW) algorithm for universal lossless data compression is investigated. Instead of one LZW dictionary, this algorithm applies several dictionaries to speed up the encoding process. Two dictionary partitioning techniques are introduced that improve the compression rate and reduce the memory size of this parallel dictionary LZW algorithm.
Proč nakupovat na Enbooku?
Velký výběr
Nabízíme miliony knih v angličtině. Od beletrie až po ty nejodborněji odborné.
Poštovné zdarma
Poštovné už od 54 Kč a při objednávce nad 1499 Kč doprava na pobočku Zásilkovny zdarma.
Skvělé ceny
Ceny knih se snažíme držet při zemi a vždy pod cenou doporučovanou vydavatelem, aby si je mohl koupit opravdu každý.
Online podpora
Můžete využít online chatu, emailu nebo nám zatelefonovat.
Osobní přístup
Nejdůležitější je pro nás Vaše spokojenost. Prodáváme knihy, protože je milujeme. Nejsme žádní nadnárodní giganti, ale poctivá česká firma.