Construction and Analysis of Cryptographic Functions

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

Full description

Bibliographic Details
Main Author: Budaghyan, Lilya
Format: eBook
Language:English
Published: Cham Springer International Publishing 2014, 2014
Edition:1st ed. 2014
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 02306nmm a2200373 u 4500
001 EB000937294
003 EBX01000000000000000730886
005 00000000000000.0
007 cr|||||||||||||||||||||
008 150202 ||| eng
020 |a 9783319129914 
100 1 |a Budaghyan, Lilya 
245 0 0 |a Construction and Analysis of Cryptographic Functions  |h Elektronische Ressource  |c by Lilya Budaghyan 
250 |a 1st ed. 2014 
260 |a Cham  |b Springer International Publishing  |c 2014, 2014 
300 |a VIII, 168 p  |b online resource 
505 0 |a Introduction -- Generalities -- Equivalence relations of functions -- Bent functions -- New classes of APN and AB polynomials -- Construction of planar functions 
653 |a Coding and Information Theory 
653 |a Difference equations 
653 |a Coding theory 
653 |a Cryptography 
653 |a Functional equations 
653 |a Difference and Functional Equations 
653 |a Information theory 
653 |a Data encryption (Computer science) 
653 |a Discrete Mathematics 
653 |a Cryptology 
653 |a Discrete mathematics 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
028 5 0 |a 10.1007/978-3-319-12991-4 
856 4 0 |u https://doi.org/10.1007/978-3-319-12991-4?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 003.54 
520 |a 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