In this paper we describe applications of functions from GF(2) m onto GF(2)" in the design of encryption algorithms. If such a function is to be useful it must satisfy a set of criteria, the actual definition of which depends on the type of encryption technique involved. This in turn means that it i
Cryptographic Boolean Functions and Applications || Fourier analysis of Boolean functions
β Scribed by Cusick, Thomas W.
- Book ID
- 118030023
- Publisher
- Elsevier
- Year
- 2009
- Tongue
- English
- Weight
- 184 KB
- Edition
- 1
- Category
- Article
- ISBN
- 0123748909
No coin nor oath required. For personal study only.
β¦ Synopsis
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
π SIMILAR VOLUMES
Open problems about enumerating Boolean functions of cryptographic significance are (partially) solved in this paper.