Construction and Analysis of Cryptographic Functions

Lilya Budaghyan (Autor)

Buch | Softcover

VIII, 168 Seiten

2016 | 1. Softcover reprint of the original 1st ed. 2014
Springer International Publishing (Verlag)
978-3-319-36358-5 (ISBN)

Artikel merken

This book covers novel research on construction and analysis of optimal cryptographic functions such as almost perfect nonlinear (APN), almost bent (AB), planar and bent functions. These functions have optimal resistance to linear and/or differential attacks, which are the two most powerful attacks on symmetric cryptosystems. Besides cryptographic applications, these functions are significant in many branches of mathematics and information theory including coding theory, combinatorics, commutative algebra, finite geometry, sequence design and quantum information theory. The author analyzes equivalence relations for these functions and develops several new methods for construction of their infinite families. In addition, the book offers solutions to two longstanding open problems, including the problem on characterization of APN and AB functions via Boolean, and the problem on the relation between two classes of bent functions.

Introduction.- Generalities.- Equivalence relations of functions.- Bent functions.- New classes of APN and AB polynomials.- Construction of planar functions.

"The book deals with functions on finite fields that are used in cryptography. ... Anybody who is not only interested in the construction of cryptographic relevant function, but who wants to learn also about the problem how to classify functions up to equivalence, should refer to this excellent text." (Alexander Pott, zbMATH 1367.94001, 2017)

Erscheinungsdatum	05.03.2022
Zusatzinfo	VIII, 168 p.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	276 g
Themenwelt	Informatik ► Theorie / Studium ► Kryptologie
Schlagworte	Almost bent function • Almost perfect nonlinear function • bent function • boolean function • CCZ-equivalence • Coding and information theory • Coding theory and cryptology • combinatorics • Combinatorics and graph theory • Commutative semifield • Computer Science • data encryption • Difference and Functional Equations • Differential calculus and equations • EA-equivalence • Information Theory • nonlinearity • Planar function • S-box
ISBN-10	3-319-36358-1 / 3319363581
ISBN-13	978-3-319-36358-5 / 9783319363585
Zustand	Neuware