Cryptographic Boolean Functions And Applications

Author: Thomas W. Cusick
Publisher: Academic Press
ISBN: 0128111305
Size: 72.10 MB
Format: PDF
View: 5398
Download
Cryptographic Boolean Functions and Applications, Second Edition is designed to be a comprehensive reference for the use of Boolean functions in modern cryptography. While the vast majority of research on cryptographic Boolean functions has been achieved since the 1970s, when cryptography began to be widely used in everyday transactions, in particular banking, relevant material is scattered over hundreds of journal articles, conference proceedings, books, reports and notes, some of them only available online. This book follows the previous edition in sifting through this compendium and gathering the most significant information in one concise reference book. The work therefore encompasses over 600 citations, covering every aspect of the applications of cryptographic Boolean functions. Since 2008, the subject has seen a very large number of new results, and in response, the authors have prepared a new chapter on special functions. The new edition brings 100 completely new references and an expansion of 50 new pages, along with heavy revision throughout the text. Presents a foundational approach, beginning with the basics of the necessary theory, then progressing to more complex content Includes major concepts that are presented with complete proofs, with an emphasis on how they can be applied Includes an extensive list of references, including 100 new to this edition that were chosen to highlight relevant topics Contains a section on special functions and all-new numerical examples

Cryptographic Boolean Functions And Applications

Author: Thomas W. Cusick
Publisher: Academic Press
ISBN: 9780080952222
Size: 55.96 MB
Format: PDF
View: 1433
Download
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

Cryptographic Boolean Functions And Applications

Author: Thomas W. Cusick
Publisher: Academic Press
ISBN: 9780128111291
Size: 53.26 MB
Format: PDF, Docs
View: 149
Download
Cryptographic Boolean Functions and Applications 2nd edition is designed to be a comprehensive reference for the use of Boolean functions in modern cryptography. While the vast majority of research on cryptographic Boolean functions has been achieved since the 1970s, when cryptography began to be widely used in everyday transactions, in particular banking, relevant material is scattered over hundreds of journal articles, conference proceedings, books, reports and notes, some of them only available online. This book follows the previous edition in sifting through this compendium and gathering the most significant information in one complete reference book. The work therefore encompasses over 600 citations, covering every aspect of the applications of cryptographic Boolean functions. Since 2008 the subject has seen a very large number of new results and the authors have prepared a new chapter on special functions in response. The new edition brings 100 completely new references and an expansion of 50 new pages as well as heavy revision throughout the text. Foundational approach beginning with the basics of the necessary theory stretching to more advanced coverage quickly, but in logical progression, helping any qualified mathematician or computer scientist to enter the subject without extensive training Major concepts are presented with complete proofs, but the emphasis is on ways in which the theory can be applied, helping researchers gain an understanding of results, and practitioners to see how to apply them An extensive list of references including 100 new to this edition has been chosen to capture the most important and relevant results from a scattered literature, saving the experienced researcher a huge amount of time that is otherwise spent searching for information In this 40% revised or new 2nd edition, a chapter on special functions and all-new numerical examples have been added to make the book more accessible to practitioners and engineering students

Boolean Functions And Their Applications In Cryptography

Author: Chuan-Kun Wu
Publisher: Springer
ISBN: 3662488655
Size: 69.87 MB
Format: PDF, Mobi
View: 6495
Download
This book focuses on the different representations and cryptographic properties of Booleans functions, presents constructions of Boolean functions with some good cryptographic properties. More specifically, Walsh spectrum description of the traditional cryptographic properties of Boolean functions, including linear structure, propagation criterion, nonlinearity, and correlation immunity are presented. Constructions of symmetric Boolean functions and of Boolean permutations with good cryptographic properties are specifically studied. This book is not meant to be comprehensive, but with its own focus on some original research of the authors in the past. To be self content, some basic concepts and properties are introduced. This book can serve as a reference for cryptographic algorithm designers, particularly the designers of stream ciphers and of block ciphers, and for academics with interest in the cryptographic properties of Boolean functions.

Bent Functions

Author: Natalia Tokareva
Publisher: Academic Press
ISBN: 0128025557
Size: 26.93 MB
Format: PDF, ePub
View: 7250
Download
Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal, nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics, coding theory, and cryptography, the text provides a detailed survey of their main results, presenting a systematic overview of their generalizations and applications, and considering open problems in classification and systematization of bent functions. The text is appropriate for novices and advanced researchers, discussing proofs of several results, including the automorphism group of bent functions, the lower bound for the number of bent functions, and more. Provides a detailed survey of bent functions and their main results, presenting a systematic overview of their generalizations and applications Presents a systematic and detailed survey of hundreds of results in the area of highly nonlinear Boolean functions in cryptography Appropriate coverage for students from advanced specialists in cryptography, mathematics, and creators of ciphers

Boolean Functions

Author: Jean-Francis Michon
Publisher: Publication Univ Rouen Havre
ISBN: 9782877754033
Size: 18.45 MB
Format: PDF, ePub
View: 594
Download

Bent Functions

Author: Sihem Mesnager
Publisher: Springer
ISBN: 3319325957
Size: 59.79 MB
Format: PDF
View: 1977
Download
This book gives a detailed survey of the main results on bent functions over finite fields, presents a systematic overview of their generalizations, variations and applications, considers open problems in classification and systematization of bent functions, and discusses proofs of several results. This book uniquely provides a necessary comprehensive coverage of bent functions.It serves as a useful reference for researchers in discrete mathematics, coding and cryptography. Students and professors in mathematics and computer science will also find the content valuable, especially those interested in mathematical foundations of cryptography. It can be used as a supplementary text for university courses on discrete mathematics, Boolean functions, or cryptography, and is appropriate for both basic classes for under-graduate students and advanced courses for specialists in cryptography and mathematics.

Cryptographic Applications Of Analytic Number Theory

Author: Igor Shparlinski
Publisher: Birkhäuser
ISBN: 3034880375
Size: 30.59 MB
Format: PDF, Mobi
View: 4031
Download
The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.

Signal Design For Good Correlation

Author: Solomon W. Golomb
Publisher: Cambridge University Press
ISBN: 9780521821049
Size: 43.89 MB
Format: PDF, ePub, Docs
View: 637
Download
This book provides a comprehensive, up-to-date description of the methodologies and the application areas, throughout the range of digital communication, in which individual signals and sets of signals with favorable correlation properties play a central role. The necessary mathematical background is presented to explain how these signals are generated, and to show how they satisfy the appropriate correlation constraints. All the known methods to obtain balanced binary sequences with two-valued autocorrelation, many of them only recently discovered, are presented in depth. The authors treat important application areas including: Code Division Multiple Access (CDMA) signals, such as those already in widespread use for cell-phone communication, and planned for universal adoption in the various approaches to 'third-generation'(3G) cell-phone use; systems for coded radar and sonar signals; communication signals to minimize mutual interference ('cross-talk') in multi-user environments; and pseudo-random sequence generation for secure authentication and for stream cipher cryptology.