Name: Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (en Inglés)
SKU: 56776024
Price: 59.46 USD
Availability: InStock
Author: Safieh, Malek
ISBN: 9783658344580

portada Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (en Inglés)

Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (en Inglés)

Formato

Libro Físico

Autor

Malek Safieh

Editorial

Springer Vieweg

Idioma

Inglés

N° páginas

142

Encuadernación

Tapa Blanda

Dimensiones

21x14.8x0.9 cm

Peso

0.20 kg.

ISBN13

9783658344580

Categorías

Teoría de la codificación, cifrado y criptología
Hardware (o soporte físico del ordenador)
Encriptación de datos
Arquitectura y diseño lógico de ordenadores

Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (en Inglés)

Malek Safieh (Autor) · Springer Vieweg · Tapa Blanda

Libro Nuevo Importado

Envío: 16 a 23 días háb.

$ 108.11$ 59.46

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 59.46

Llega entre el 06 Oct y el 20 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories (en Inglés)"

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.