LEADER 03705nam  22007455  450 
001 9910298971103321
005 20220415222640.0
010   $a3-319-12991-0
024 7 $a10.1007/978-3-319-12991-4
035   $a(CKB)3710000000332360
035   $a(EBL)1965308
035   $a(OCoLC)899738954
035   $a(SSID)ssj0001424435
035   $a(PQKBManifestationID)11832252
035   $a(PQKBTitleCode)TC0001424435
035   $a(PQKBWorkID)11368091
035   $a(PQKB)10302227
035   $a(MiAaPQ)EBC1965308
035   $a(DE-He213)978-3-319-12991-4
035   $a(PPN)183517520
035   $a(EXLCZ)993710000000332360
100   $a20150106d2014      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aConstruction and analysis of cryptographic functions /$fby Lilya Budaghyan
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (172 p.)
300   $aDescription based upon print version of record.
311   $a3-319-12990-2 
320   $aIncludes bibliographical references.
327   $aIntroduction -- Generalities -- Equivalence relations of functions -- Bent functions -- New classes of APN and AB polynomials -- Construction of planar functions.
330   $aThis 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.
606   $aCoding theory
606   $aInformation theory
606   $aData encryption (Computer science)
606   $aDifference equations
606   $aFunctional equations
606   $aCombinatorial analysis
606   $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041
606   $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020
606   $aDifference and Functional Equations$3https://scigraph.springernature.com/ontologies/product-market-codes/M12031
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
615  0$aCoding theory.
615  0$aInformation theory.
615  0$aData encryption (Computer science)
615  0$aDifference equations.
615  0$aFunctional equations.
615  0$aCombinatorial analysis.
615 14$aCoding and Information Theory.
615 24$aCryptology.
615 24$aDifference and Functional Equations.
615 24$aCombinatorics.
676   $a003.54
676   $a004
676   $a005.82
676   $a511.6
700   $aBudaghyan$b Lilya$4aut$4http://id.loc.gov/vocabulary/relators/aut$0918913
906   $aBOOK
912   $a9910298971103321
996   $aConstruction and Analysis of Cryptographic Functions$92060907
997   $aUNINA