Muutke küpsiste eelistusi

Group Theoretic Cryptography [Kõva köide]

(Universidad Rey Juan Carlos, Madrid, Spain), (Florida Atlantic University, Boca Raton, FL)
Teised raamatud teemal:
Teised raamatud teemal:
Group theoretic problems have propelled scientific achievements across a wide range of fields, including mathematics, physics, chemistry, and the life sciences. Many cryptographic constructions exploit the computational hardness of group theoretical problems, and the area is viewed as a potential source of quantum-resilient cryptographic primitives for the future.

Group Theoretic Cryptography supplies an ideal introduction to cryptography for those who are interested in group theory and want to learn about the possible interplays between the two fields. Assuming an undergraduate-level understanding of linear algebra and discrete mathematics, it details the specifics of using non-Abelian groups in the field of cryptography.

Moreover, the book evidences how group theoretic techniques help us gain new insight into well known, seemingly unrelated, cryptographic constructions, such as DES.

The book starts with brief overviews of the fundamentals of group theory, complexity theory, and cryptography. Part two is devoted to public-key encryption, including provable security guarantees, public-key encryption in the standard model, and public-key encryption using infinite groups.

The third part of the book covers secret-key encryption. It examines block ciphers, like the Advanced Encryption Standard, and cryptographic hash functions and message authentication codes. The last part delves into a number of cryptographic applications which are nowadays as relevant as encryptionidentification protocols, key establishment, and signature schemes are covered.

The book supplies formal security analyses and highlights potential vulnerabilities for cryptographic constructions involving group theory. Summaries and references for further reading, as well as exercises, are included at the end of each chapter. Selected solutions for exercises are provided in the back of the book.

Arvustused

"Group Theoretic Cryptography is highly welcome. It provides an excellent introduction in group-based cryptography where algebraic properties of the platform groups, mainly from combinatorial group theory, are used prominently in both devising cryptosystems and in cryptanalysis. In particular the difficulty, in a complexity sense, of certain algorithmic problems in finitely presented groups has been crucial in encryption and decryption. ... I highly recommend the book under review. It is of great value for researchers in the area as well as for advanced students which start to work in cryptology. The excellent figures and algorithmic descriptions are clear and good to understand. They help the readers to see the important points. Gerhard Rosenberger (Hamburg), writing in Zentralblatt MATH 1321 1

List of Figures xi
Symbols xiii
Preface xv
I Preliminaries 1(36)
1 Mathematical background
3(14)
1.1 Algebraic structures in a nutshell
3(7)
1.2 Finite groups
10(3)
1.3 Summary and further reading
13(1)
1.4 Exercises
14(3)
2 Basics on complexity
17(8)
2.1 Complexity classes
17(3)
2.2 Asymptotic notation and examples
20(2)
2.3 Summary and further reading
22(1)
2.4 Exercises
23(2)
3 Cryptology: An introduction
25(12)
3.1 A short historical overview
25(6)
3.1.1 Historical encryption schemes
25(3)
3.1.2 Public-key cryptography
28(3)
3.2 Modern cryptology
31(3)
3.3 Summary and further reading
34(1)
3.4 Exercises
35(2)
II Public-Key Encryption 37(84)
4 Provable security guarantees
39(34)
4.1 Public-key encryption revisited
39(3)
4.2 Characterizing secure public-key encryption
42(11)
4.3 One-way functions and random oracles
53(4)
4.4 The general Bellare-Rogaway construction
57(5)
4.5 IND-CCA security with an Abelian group: RSA-OAEP
62(2)
4.6 One-way functions from non-Abelian groups?
64(4)
4.7 Summary and further reading
68(1)
4.8 Exercises
69(4)
5 Public-key encryption in the standard model
73(24)
5.1 The Cramer-Shoup encryption scheme from 1998
73(7)
5.2 Going beyond: Tools
80(5)
5.2.1 Projective hash families
80(3)
5.2.2 Subset membership problems
83(1)
5.2.3 Hash proof systems
84(1)
5.3 General Cramer-Shoup encryption scheme
85(2)
5.4 A concrete instantiation
87(1)
5.5 Projective hash families from (non-Abelian) groups
88(6)
5.5.1 Group action systems
88(4)
5.5.2 Group action projective hash families
92(2)
5.6 Summary and further reading
94(1)
5.7 Exercises
95(2)
6 Public-key encryption using infinite groups
97(24)
6.1 The word problem in finitely presented groups
97(8)
6.1.1 The encryption scheme of Wagner and Magyarik
98(4)
6.1.2 Polly Cracker
102(1)
6.1.3 A successor of the Wagner-Magyarik scheme
103(2)
6.2 Using a group that is not finitely presentable?
105(3)
6.3 Braid groups in cryptography
108(9)
6.3.1 Basics on braid groups
108(3)
6.3.2 Some computational problems in the braid group By
111(6)
6.4 Summary and further reading
117(1)
6.5 Exercises
118(3)
III Secret-Key Encryption 121(36)
7 Block ciphers
123(22)
7.1 Advanced Encryption Standard
124(5)
7.1.1 Specifying the round function
124(2)
7.1.2 Key schedule
126(1)
7.1.3 Encryption and decryption with AES
126(3)
7.2 Data Encryption Standard
129(6)
7.2.1 General structure of DES: A Feistel cipher
129(3)
7.2.2 Round function of DES
132(2)
7.2.3 Key schedule
134(1)
7.3 Permutation Group Mappings
135(2)
7.4 Modes of operation
137(4)
7.4.1 Electronic codebook (ECB) mode
137(1)
7.4.2 Cipher block chaining (CBC) mode
138(1)
7.4.3 Cipher feedback (CFB) mode
138(1)
7.4.4 Output feedback (OFB) mode
139(1)
7.4.5 Counter (CTR) mode
140(1)
7.5 Summary and further reading
141(1)
7.6 Exercises
142(3)
8 Cryptographic hash functions and message authentication codes
145(12)
8.1 Cryptographic hash functions
145(2)
8.2 Deriving a hash function from a block cipher
147(2)
8.3 Cayley hash functions
149(2)
8.4 Message authentication codes
151(3)
8.4.1 Keyed-Hash Message Authentication Code
152(1)
8.4.2 Cipher-based Message Authentication Code
153(1)
8.5 Summary and further reading
154(1)
8.6 Exercises
155(2)
IV Other Cryptographic Constructions 157(38)
9 Key establishment protocols
159(22)
9.1 Setting the stage
159(11)
9.1.1 Provable security for key exchange protocols
162(4)
9.1.2 A secure construction
166(4)
9.2 Anshel-Anshel-Goldfeld key exchange
170(4)
9.3 Braid-based key exchange
174(2)
9.4 Constructions over matrix groups
176(2)
9.5 Summary and further reading
178(1)
9.6 Exercises
179(2)
10 Signature and identification schemes
181(14)
10.1 Definitions and terminology
181(3)
10.2 RSA signatures: FDH and PSS
184(4)
10.3 Identification schemes
188(3)
10.4 Summary and further reading
191(1)
10.5 Exercises
192(3)
V Appendix 195(12)
A Solutions to selected exercises
197(10)
A.1 Solutions to selected exercises of Part I
197(2)
A.2 Solutions to selected exercises of Part II
199(3)
A.3 Solutions to selected exercises of Part III
202(1)
A.4 Solutions to selected exercises of Part IV
203(4)
References 207(18)
Index 225
Maria Isabel Gonzalez Vasco, Rainer Steinwandt