000			03214nam a22003855i 4500
999			_c361549 _d361549 _x1
001			361549
003			ES-MaUEC
005			20230102121408.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			210809s2021 gw | s |||| 0|eng d
020			_a9783658344597
024	7		_a10.1007/978-3-658-34459-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA268 _b2021 EB
100	1		_aSafieh, Malek _eautor _9682212
245	1	0	_aAlgorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories _cby Malek Safieh
250			_aFirst edition 2021
264		1	_aWiesbaden _bSpringer International Publising _c2021
300			_a1 recurso en línea (XVI, 142 páginas) _b26 ilustraciones, 3 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aSchriftenreihe der Institute für Systemdynamik (ISD) und optische Systeme (IOS) _x2661-8095
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
505	0		_a1 Introduction -- 2 Elliptic curve cryptography -- 3 Elliptic curve cryptography over Gaussian integers -- 4 Montgomery arithmetic over Gaussian integers -- 5 Architecture of the ECC coprocessor for Gaussian integers -- 6 Compact architecture of the ECC coprocessor for binary extension fields -- 7 The parallel dictionary LZW algorithm for flash memory controllers -- 8 Conclusion.
520	3		_aIn 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. About the Author Malek Safieh is a research scientist in the field of cryptography and data compression.
988			_aSpringer_Computer_2021
650		7	_2embne _aCriptografía (Informática) _9158201
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-658-34459-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2022 _dz _eu _zSI