國立高雄大學圖資館 |

Language: English

Back

Algorithms and architectures for cry...

Safieh, Malek.

Algorithms and architectures for cryptography and source coding in non-volatile flash memories

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms and architectures for cryptography and source coding in non-volatile flash memoriesby Malek Safieh.
Author:	Safieh, Malek.
Published:	Wiesbaden :Springer Fachmedien Wiesbaden :2021.
Description:	xvi, 142 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Cryptography.
Online resource:	https://doi.org/10.1007/978-3-658-34459-7
ISBN:	9783658344597

Algorithms and architectures for cryptography and source coding in non-volatile flash memories
Safieh, Malek.

Algorithms and architectures for cryptography and source coding in non-volatile flash memories[electronic resource] /by Malek Safieh. - Wiesbaden :Springer Fachmedien Wiesbaden :2021. - xvi, 142 p. :ill., digital ;24 cm. - Schriftenreihe der Institute Fur Systemdynamik (ISD) und Optische Systeme (IOS). - Schriftenreihe der Institute Fur Systemdynamik (ISD) und Optische Systeme (IOS)..

1 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.

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. About the Author Malek Safieh is a research scientist in the field of cryptography and data compression.

ISBN: 9783658344597

Standard No.: 10.1007/978-3-658-34459-7doiSubjects--Topical Terms:

189522
Cryptography.

LC Class. No.: QA268

Dewey Class. No.: 005.824

Algorithms and architectures for cryptography and source coding in non-volatile flash memories
LDR:02759nmm a2200337 a 4500 001 607807
003 DE-He213
005 20210811122411.0
006 m d
007 cr nn 008maaau
008 220119s2021 gw s 0 eng d
020 $a 9783658344597 $q (electronic bk.)
020 $a 9783658344580 $q (paper)
024 7 $a 10.1007/978-3-658-34459-7 $2 doi
035 $a 978-3-658-34459-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA268
072 7 $a UYF $2 bicssc
072 7 $a COM011000 $2 bisacsh
072 7 $a UYF $2 thema
082 0 4 $a 005.824 $2 23
090 $a QA268 $b .S128 2021
100 1 $a Safieh, Malek. $3 904974
245 1 0 $a Algorithms and architectures for cryptography and source coding in non-volatile flash memories $h [electronic resource] / $c by Malek Safieh.
260 $a Wiesbaden : $b Springer Fachmedien Wiesbaden : $b Imprint: Springer Vieweg, $c 2021.
300 $a xvi, 142 p. : $b ill., digital ; $c 24 cm.
490 1 $a Schriftenreihe der Institute Fur Systemdynamik (ISD) und Optische Systeme (IOS)
505 0 $a 1 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 $a 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. About the Author Malek Safieh is a research scientist in the field of cryptography and data compression.
650 0 $a Cryptography. $3 189522
650 0 $a Data encryption (Computer science) $3 184520
650 0 $a Revision control (Computer science) $x Mathematics. $3 904976
650 0 $a Nonvolatile random-access memory. $3 680408
650 1 4 $a Processor Architectures. $3 274498
650 2 4 $a Systems and Data Security. $3 274481
650 2 4 $a Computer Hardware. $3 275482
650 2 4 $a Cryptology. $3 825728
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Schriftenreihe der Institute Fur Systemdynamik (ISD) und Optische Systeme (IOS). $3 904975
856 4 0 $u https://doi.org/10.1007/978-3-658-34459-7
950 $a Computer Science (SpringerNature-11645)