Boolean Functions for Cryptography and Coding Theory PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Boolean Functions for Cryptography and Coding Theory PDF full book. Access full book title Boolean Functions for Cryptography and Coding Theory by Claude Carlet. Download full books in PDF and EPUB format.
Author: Claude Carlet
Publisher: Cambridge University Press
ISBN: 1108634664
Category : Computers
Languages : en
Pages : 577
Get Book Here
Book Description
Boolean functions are essential to systems for secure and reliable communication. This comprehensive survey of Boolean functions for cryptography and coding covers the whole domain and all important results, building on the author's influential articles with additional topics and recent results. A useful resource for researchers and graduate students, the book balances detailed discussions of properties and parameters with examples of various types of cryptographic attacks that motivate the consideration of these parameters. It provides all the necessary background on mathematics, cryptography, and coding, and an overview on recent applications, such as side channel attacks on smart cards, cloud computing through fully homomorphic encryption, and local pseudo-random generators. The result is a complete and accessible text on the state of the art in single and multiple output Boolean functions that illustrates the interaction between mathematics, computer science, and telecommunications.
Author: Claude Carlet
Publisher: Cambridge University Press
ISBN: 1108634664
Category : Computers
Languages : en
Pages : 577
Get Book Here
Book Description
Boolean functions are essential to systems for secure and reliable communication. This comprehensive survey of Boolean functions for cryptography and coding covers the whole domain and all important results, building on the author's influential articles with additional topics and recent results. A useful resource for researchers and graduate students, the book balances detailed discussions of properties and parameters with examples of various types of cryptographic attacks that motivate the consideration of these parameters. It provides all the necessary background on mathematics, cryptography, and coding, and an overview on recent applications, such as side channel attacks on smart cards, cloud computing through fully homomorphic encryption, and local pseudo-random generators. The result is a complete and accessible text on the state of the art in single and multiple output Boolean functions that illustrates the interaction between mathematics, computer science, and telecommunications.
Author: Claude Carlet
Publisher: Cambridge University Press
ISBN: 1108473806
Category : Computers
Languages : en
Pages : 577
Get Book Here
Book Description
A complete, accessible book on single and multiple output Boolean functions in cryptography and coding, with recent applications and problems.
Author: Thomas W. Cusick
Publisher: Academic Press
ISBN: 0080952224
Category : Mathematics
Languages : en
Pages : 245
Get Book Here
Book Description
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
Author: Oleg A. Logachev
Publisher: American Mathematical Soc.
ISBN: 0821846809
Category : Mathematics
Languages : en
Pages : 352
Get Book Here
Book Description
This book offers a systematic presentation of cryptographic and code-theoretic aspects of the theory of Boolean functions. Both classical and recent results are thoroughly presented. Prerequisites for the book include basic knowledge of linear algebra, group theory, theory of finite fields, combinatorics, and probability. The book can be used by research mathematicians and graduate students interested in discrete mathematics, coding theory, and cryptography.
Author: Yves Crama
Publisher: Cambridge University Press
ISBN: 0521847524
Category : Computers
Languages : en
Pages : 781
Get Book Here
Book Description
A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.
Author: Ryan O'Donnell
Publisher: Cambridge University Press
ISBN: 1107038324
Category : Computers
Languages : en
Pages : 445
Get Book Here
Book Description
This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.
Author: Natalia Tokareva
Publisher: Academic Press
ISBN: 0128025557
Category : Computers
Languages : en
Pages : 221
Get Book Here
Book Description
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
Author: Sihem Mesnager
Publisher: Springer
ISBN: 3319325957
Category : Computers
Languages : en
Pages : 561
Get Book Here
Book Description
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.
Author: W. Cary Huffman
Publisher: CRC Press
ISBN: 1351375105
Category : Computers
Languages : en
Pages : 998
Get Book Here
Book Description
Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry. Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references. The book is divided into three parts: Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography. Features Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research
Author: Matthew G. Parker
Publisher: Springer Science & Business Media
ISBN: 3642108679
Category : Computers
Languages : en
Pages : 505
Get Book Here
Book Description
The12thintheseriesofIMAConferencesonCryptographyandCodingwasheld at the Royal Agricultural College, Cirencester, December 15–17, 2009. The p- gram comprised 3 invited talks and 26 contributed talks. The contributed talks werechosenbyathoroughreviewingprocessfrom53submissions.Oftheinvited and contributed talks,28 arerepresentedaspapersin this volume. These papers are grouped loosely under the headings: Coding Theory, Symmetric Crypt- raphy, Security Protocols, Asymmetric Cryptography, Boolean Functions, and Side Channels and Implementations. Numerous people helped to make this conference a success. To begin with I would like to thank all members of the Technical Program Committee who put a great deal of e?ort into the reviewing process so as to ensure a hi- quality program. Moreover, I wish to thank a number of people, external to the committee, who also contributed reviews on the submitted papers. Thanks, of course,mustalso goto allauthorswho submitted papers to the conference,both those rejected and accepted. The review process was also greatly facilitated by the use of the Web-submission-and-review software, written by Shai Halevi of IBM Research, and I would like to thank him for making this package available to the community. The invited talks were given by Frank Kschischang, Ronald Cramer, and Alexander Pott, and two of these invitedtalksappearaspapersinthisvolume. A particular thanks goes to these invited speakers, each of whom is well-known, notonlyforbeingaworld-leaderintheir?eld,butalsofortheirparticularability to communicate their expertise in an enjoyable and stimulating manner.
