Klientu atbalsts: 27018494

Grāmatu iegāde | Jauns profils | Ienākt

Design of Rijndael: AES - The Advanced Encryption Standard 2002 ed. [Hardback]

4.22/5 (35 ratings by Goodreads)

Vincent Rijmen, Joan Daemen

Formāts: Hardback, 238 pages, height x width: 235x155 mm, weight: 563 g, XVII, 238 p., 1 Hardback
Sērija : Information Security and Cryptography
Izdošanas datums: 14-Feb-2002
Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
ISBN-10: 3540425802
ISBN-13: 9783540425809

Citas grāmatas par šo tēmu:

Data encryption - (Noliktavā: 2 punkts)
Computer networking & communications - (Noliktavā: 3 punkts)

Hardback
Cena: 82,61 €*
* ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
Standarta cena: 97,19 €
Ietaupiet 15%
Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
Daudzums:
- - 1
  - 2
  - 3
  - 4
  - 5
  - 6
  - 7
  - 8
  - 9
  - 10
Ielikt grozā
Piegādes laiks - 4-6 nedēļas
Pievienot vēlmju sarakstam

Formāts: Hardback, 238 pages, height x width: 235x155 mm, weight: 563 g, XVII, 238 p., 1 Hardback
Sērija : Information Security and Cryptography
Izdošanas datums: 14-Feb-2002
Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
ISBN-10: 3540425802
ISBN-13: 9783540425809

Citas grāmatas par šo tēmu:

Data encryption - (Noliktavā: 2 punkts)
Computer networking & communications - (Noliktavā: 3 punkts)

Permanent link: https://www.kriso.lv/db/9783540425809.html

Keywords:

Rijndael was the surprise winner of the contest for the new Advanced En cryption Standard (AES) for the United States. This contest was organized and run by the National Institute for Standards and Technology (NIST) be ginning in January 1997; Rijndael was announced as the winner in October 2000. It was the "surprise winner" because many observers (and even some participants) expressed scepticism that the D.S. government would adopt as an encryption standard any algorithm that was not designed by D.S. citizens. Yet NIST ran an open, international, selection process that should serve as model for other standards organizations. For example, NIST held their 1999 AES meeting in Rome, Italy. The five finalist algorithms were designed by teams from all over the world. In the end, the elegance, efficiency, security, and principled design of Rijndael won the day for its two Belgian designers, Joan Daemen and Vincent Rijmen, over the competing finalist designs from RSA, IBM, Counterpane Systems, and an EnglishjIsraelijDanish team. This book is the story of the design of Rijndael, as told by the designers themselves. It outlines the foundations of Rijndael in relation to the previous ciphers the authors have designed. It explains the mathematics needed to and the operation of Rijndael, and it provides reference C code and underst test vectors for the cipher.

Recenzijas

"an excellent choice for people who are interested in how Rijndael really works and who need more explanations than research papers usually contain. It is a book that readers will regularly consult when they need to look up details about Rijndael." Computing Reviews

The Advanced Encryption Standard Process

(8)

In the Beginning

(1)

AES: Scope and Significance

(1)

Start of the AES Process

(1)

The First Round

(1)

Evaluation Criteria

(1)

Security

(1)

Costs

(1)

Algorithm and Implementation Characteristics

(1)

Selection of Five Finalists

(2)

The Second AES Conference

(1)

The Five Finalists

(1)

The Second Round

(1)

The Selection

(2)

Preliminaries

(22)

Finite Fields

(7)

Groups, Rings, and Fields

(1)

Vector Spaces

(2)

Fields with a Finite Number of Elements

(1)

Polynomials over a Field

(1)

Operations on Polynomials

(1)

Polynomials and Bytes

(1)

Polynomials and Columns

(1)

Linear Codes

(2)

Definitions

(2)

MDS codes

(1)

Boolean Functions

(4)

Bundle Partitions

(1)

Transpositions

(1)

Bricklayer Functions

(1)

Iterative Boolean Transformations

(1)

Block Ciphers

(4)

Iterative Block Ciphers

(1)

Key-Alternating Block Ciphers

(2)

Block Cipher Modes of Operation

(2)

Block Encryption Modes

(1)

Key-Stream Generation Modes

(1)

Message Authentication Modes

(1)

Cryptographic Hashing

(1)

Conclusions

(2)

Specification of Rijndael

(22)

Differences between Rijndael and the AES

(1)

Input and Output for Encryption and Decryption

(2)

Structure of Rijndael

(1)

The Round Transformation

(8)

The SubBytes Step

(3)

The ShiftRows Step

(1)

The MixColumns Step

(2)

The Key Addition

(1)

The Number of Rounds

(2)

Key Schedule

(2)

Design Criteria

(1)

Selection

(2)

Decryption

(5)

Decryption for a Two-Round Rijndael Variant

(1)

Algebraic Properties

(2)

The Equivalent Decryption Algorithm

(2)

Conclusions

(3)

Implementation Aspects

(10)

8-Bit Platforms

(3)

Finite Field Multiplication

(1)

Encryption

(1)

Decryption

(1)

32-Bit Platforms

(3)

Dedicated Hardware

(2)

Decomposition of SRD

(1)

Efficient Inversion in GF (28)

(1)

Multiprocessor Platforms

(1)

Performance Figures

(1)

Conclusions

(1)

Design Philosophy

(18)

Generic Criteria in Cipher Design

(2)

Security

(1)

Efficiency

(1)

Key Agility

(1)

Versatility

(1)

Discussion

(1)

Simplicity

(1)

Symmetry

(4)

Symmetry Across the Rounds

(1)

Symmetry Within the Round Transformation

(1)

Symmetry in the D-box

(1)

Symmetry and Simplicity in the S-box

(1)

Symmetry between Encryption and Decryption

(1)

Additional Benefits of Symmetry

(1)

Choice of Operations

(2)

Arithmetic Operations

(1)

Data-Dependent Shifts

(1)

Approach to Security

(2)

Security Goals

(1)

Unknown Attacks Versus Known Attacks

(1)

Provable Security Versus Provable Bounds

(1)

Approaches to Design

(3)

Non-Linearity and Diffusion Criteria

(1)

Resistance against Differential and Linear Cryptanalysis

(1)

Local Versus Global Optimization

(2)

Key-Alternating Cipher Structure

(1)

The Key Schedule

(3)

The Function of a Key Schedule

(1)

Key Expansion and Key Selection

(1)

The Cost of the Key Expansion

(1)

A Recursive Key Expansion

(1)

Conclusions

(2)

The Data Encryption Standard

(8)

The DES

(2)

Differential Cryptanalysis

(2)

Linear Cryptanalysis

(2)

Conclusions

(2)

Correlation Matrices

(24)

The Walsh-Hadamard Transform

(4)

Parities and Selection Patterns

(1)

Correlation

(1)

Real-valued Counterpart of a Binary Boolean Function

(1)

Orthogonality and Correlation

(1)

Spectrum of a Binary Boolean Function

(2)

Composing Binary Boolean Functions

(1)

Xor

(1)

And

(1)

Disjunct Boolean Functions

(1)

Correlation Matrices

(4)

Equivalence of a Boolean Function and its Correlation Matrix

(1)

Iterative Boolean Functions

(1)

Boolean Permutations

(2)

Special Boolean Functions

(1)

XOR with a Constant

(1)

Linear Functions

(1)

Bricklayer Functions

(1)

Derived Properties

(1)

Truncating Functions

100

(1)

Cross-correlation and Autocorrelation

101

(1)

Linear Trails

102

(1)

Ciphers

103

(5)

General Case

103

(1)

Key-Alternating Cipher

104

(1)

Averaging over all Round Keys

105

(1)

The Effect of the Key Schedule

106

(2)

Correlation Matrices and Linear Cryptanalysis Literature

108

(3)

Linear Cryptanalysis of the DES

108

(1)

Linear Hulls

109

(2)

Conclusions

111

(2)

Difference Propagation

113

(10)

Difference Propagation

113

(1)

Special Functions

114

(1)

Affine Functions

114

(1)

Bricklayer Functions

114

(1)

Truncating Functions

115

(1)

Difference Propagation Probabilities and Correlation

115

(2)

Differential Trails

117

(1)

General Case

117

(1)

Independence of Restrictions

117

(1)

Key-Alternating Cipher

118

(1)

The Effect of the Key Schedule

119

(1)

Differential Trails and Differential Cryptanalysis Literature

119

(3)

Differential Cryptanalysis of the DES Revisited

119

(1)

Markov Ciphers

120

(2)

Conclusions

122

(1)

The Wide Trail Strategy

123

(26)

Propagation in Key-alternating Block Ciphers

123

(3)

Linear Cryptanalysis

123

(2)

Differential Cryptanalysis

125

(1)

Differences between Linear Trails and Differential Trails

126

(1)

The Wide Trail Strategy

126

(5)

The γλ Round Structure in Block Ciphers

127

(2)

Weight of a Trail

129

(1)

Diffusion

130

(1)

Branch Numbers and Two-Round Trails

131

(3)

Derived Properties

133

(1)

A Two-Round Propagation Theorem

133

(1)

An Efficient Key-Alternating Structure

134

(4)

The Diffusion Step θ

134

(2)

The Linear Step Θ

136

(1)

A Lower Bound on the Bundle Weight of Four-Round Trails

136

(1)

An Efficient Construction for Θ

137

(1)

The Round Structure of Rijndael

138

(5)

A Key-Iterated Structure

138

(4)

Applying the Wide Trail Strategy to Rijndael

142

(1)

Constructions for θ

143

(2)

Choices for the Structure of I and π

145

(2)

The Hypercube Structure

145

(2)

The Rectangular Structure

147

(1)

Conclusions

147

(2)

Cryptanalysis

149

(12)

Truncated Differentials

149

(1)

Saturation Attacks

149

(5)

Preliminaries

150

(1)

The Basic Attack

150

(2)

Influence of the Final Round

152

(1)

Extension at the End

153

(1)

Extension at the Beginning

153

(1)

Attacks on Six Rounds

153

(1)

The Herds Attack

154

(1)

Gilbert-Minier Attack

154

(2)

The Four-Round Distinguisher

154

(1)

The Attack on Seven Rounds

155

(1)

Interpolation Attacks

156

(1)

Symmetry Properties and Weak Keys as in the DES

156

(1)

Weak keys as in IDEA

157

(1)

Related-Key Attacks

157

(1)

Implementation Attacks

157

(3)

Timing Attacks

157

(1)

Power Analysis

158

(2)

Conclusion

160

(1)

Related Block Ciphers

161

(68)

Overview

161

(2)

Evolution

161

(1)

The Round Transformation

162

(1)

SHARK

163

(2)

Square

165

(3)

BKSQ

168

(3)

Children of Rijndael

171

(2)

Crypton

171

(1)

Twofish

172

(1)

ANUBIS

172

(1)

GRAND CRU

173

(1)

Hierocrypt

173

(1)

Conclusion

173

(2)

Appendices

A. Propagation Analysis in Galois Fields

175

(20)

A.1 Functions over GF (2n)

176

(1)

A.1.1 Difference Propagation

177

(1)

A.1.2 Correlation

177

(2)

A.1.3 Functions that are Linear over GF (2n)

179

(1)

A.1.4 Functions that are Linear over GF (2)

180

(1)

A.2 Functions over (GF(2n))e

181

(1)

A.2.1 Difference Propagation

182

(1)

A.2.2 Correlation

182

(1)

A.2.3 Functions that are Linear over GF(2'')

182

(1)

A.2.4 Functions that are Linear over GF(2)

183

(1)

A.3 Representations of GF (pn)

184

(1)

A.3.1 Cyclic Representation of GF (pn)

184

(1)

A.3.2 Vector Space Representation of GF(pn)

184

(1)

A.3.3 Dual Bases

185

(1)

A.4 Boolean Functions and Functions in GF (2n)

186

(1)

A.4.1 Differences in GF(2)n and GF(2n)

186

(1)

A.4.2 Relationship Between Trace Patterns and Selection Patterns

187

(1)

A.4.3 Relationship Between Linear Functions in GF(p)n and GF(pn)

187

(3)

A.4.4 Illustration

190

(2)

A.5 Rijndael-GF

192

(3)

B. Trail Clustering

195

(16)

B.1 Transformations with Maximum Branch Number

196

(3)

B.2 Bounds for Two Rounds

199

(1)

B.2.1 Difference Propagation

200

(2)

B.2.2 Correlation

202

(2)

B.3 Bounds for Four Rounds

204

(1)

B.4 Two Case Studies

205

(1)

B.4.1 Differential Trails

205

(2)

B.4.2 Linear Trails

207

(4)

C. Substitution Tables

211

(4)

C.1 Srd

211

(1)

C.2 Other Tables

212

(1)

C.2.1 xtime

212

(1)

C.2.2 Round Constants

212

(3)

D. Test Vectors

215

(6)

D.1 KeyExpansion

215

(1)

D.2 Rijndael(128, 128)

215

(2)

D.3 Other Block Lengths and Key Lengths

217

(4)

E. Reference Code

221

(8)

Bibliography

229

(6)

Index

235

Design of Rijndael: AES - The Advanced Encryption Standard 2002 ed. [Hardback]

Recenzijas

Konts un iestatījumi

Meklēšana

Meklēt datubāzē

Refine By

Tēmas Grāmatas angļu valodā

Izvēlieties iepirkumu grozu