Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (Schriftenreihe der Institute für Systemdynamik (ISD) und optische Systeme (IOS)) - Tapa blanda

Safieh, Malek

 
9783658344580: Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (Schriftenreihe der Institute für Systemdynamik (ISD) und optische Systeme (IOS))
Tapa blanda
ISBN 10: 365834458X ISBN 13: 9783658344580
Editorial: Springer Vieweg, 2021

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

Malek Safieh is a research scientist in the field of cryptography and data compression.

De la contraportada

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 upthe encoding process. Two dictionary partitioning techniques are introduced that improve the compression rate and reduce the memory size of this parallel dictionary LZW algorithm.

About the AuthorMalek Safieh is a research scientist in the field of cryptography and data compression.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer Vieweg
Año de publicación
2021
Idioma
Inglés
ISBN 10 
365834458X
ISBN 13 
9783658344580
Encuadernación
Tapa blanda
Número de edición
1
Número de páginas
160
Contacto del fabricante
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Alemania