Cryptographic Boolean Functions and Applications
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).
Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference.
Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.
-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions
-Provides engineers and scientists with a needed reference for the use of Boolean functions in cryptography
-Addresses the issues of cryptographic Boolean functions theory and applications in one concentrated resource.
-Organized logically to help the reader easily understand the topic
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
affine function algebraic attacks algebraic normal form algorithm assume balanced bent functions Berlin binary bitstring block cipher Boole Boolean function byte Carlet Cayley graph Cayley graph associated ciphertext coefficients computation concatenation construction correlation attack correlation immune crypt.–Crypto crypt.–Eurocrypt cryptanalysis defined definition degree denote difference set Dobbertin eigenvalues encryption equations equivalent Figure function f given gives Hamming weight IEEE Trans Inform immune of order initial input integer keystream Lemma length Let f LFSR linear complexity LNCS Maitra matrix nonzero obtain output bit output sequence PC(n permutation plaintext PRBG Proof properties prove quadratic random relinearization result Rijndael rotation symmetric Boolean rotation symmetric functions S-box SAC(k satisfies PC(k satisfies the SAC Section shift registers Springer stream ciphers string strongly regular graph subspace symmetric Boolean functions Theorem Trans Inform Theory truth table values variables vector Walsh transform zero