Cargando…

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Budaghyan, Lilya (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2014.
Edición:1st ed. 2014.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-12991-4
003 DE-He213
005 20220117102927.0
007 cr nn 008mamaa
008 150106s2014 sz | s |||| 0|eng d
020 |a 9783319129914  |9 978-3-319-12991-4 
024 7 |a 10.1007/978-3-319-12991-4  |2 doi 
050 4 |a QA268 
050 4 |a Q350-390 
072 7 |a GPJ  |2 bicssc 
072 7 |a GPF  |2 bicssc 
072 7 |a COM031000  |2 bisacsh 
072 7 |a GPJ  |2 thema 
072 7 |a GPF  |2 thema 
082 0 4 |a 003.54  |2 23 
100 1 |a Budaghyan, Lilya.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Construction and Analysis of Cryptographic Functions  |h [electronic resource] /  |c by Lilya Budaghyan. 
250 |a 1st ed. 2014. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a VIII, 168 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a Introduction -- Generalities -- Equivalence relations of functions -- Bent functions -- New classes of APN and AB polynomials -- Construction of planar functions. 
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. 
650 0 |a Coding theory. 
650 0 |a Information theory. 
650 0 |a Cryptography. 
650 0 |a Data encryption (Computer science). 
650 0 |a Difference equations. 
650 0 |a Functional equations. 
650 0 |a Discrete mathematics. 
650 1 4 |a Coding and Information Theory. 
650 2 4 |a Cryptology. 
650 2 4 |a Difference and Functional Equations. 
650 2 4 |a Discrete Mathematics. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319129921 
776 0 8 |i Printed edition:  |z 9783319129907 
776 0 8 |i Printed edition:  |z 9783319363585 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-12991-4  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)