Books on Boolean Functions: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
(One intermediate revision by one other user not shown) | |||
Line 1: | Line 1: | ||
<table width="100%"> | |||
<tr> | |||
<td width="150px" rowspan="3">[[File:Boolean functions book.jpg|150px]]</td> | |||
<td style="text-align: left">[https://www.cambridge.org/core/books/boolean-functions-for-cryptography-and-coding-theory/087A2BAC6140B96526526294F7265405 Boolean Functions for Cryptography and Coding Theory]</td> | |||
</tr> | |||
<tr> | |||
<td style="text-align: left">Claude Carlet</td> | |||
</tr> | |||
<tr> | |||
<td style="text-align: left">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.</td> | |||
</tr> | |||
</table> | |||
<table width="100%"> | <table width="100%"> | ||
<tr> | <tr> | ||
Line 79: | Line 93: | ||
<tr> | <tr> | ||
<td style="text-align: left">A comprehensive survey on results in the area of finite fields.</td> | <td style="text-align: left">A comprehensive survey on results in the area of finite fields.</td> | ||
</tr> | |||
</table> | |||
<table width="100%"> | |||
<tr> | |||
<td width="150px" rowspan="3">[[File:Index.jpg|150px]]</td> | |||
<td style="text-align: left">[https://www.elsevier.com/books/bent-functions/tokareva/978-0-12-802318-1 Bent functions: results and applications to cryptography]</td> | |||
</tr> | |||
<tr> | |||
<td style="text-align: left"> Natalia Tokareva</td> | |||
</tr> | |||
<tr> | |||
<td style="text-align: left">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. </td> | |||
</tr> | </tr> | ||
</table> | </table> |
Latest revision as of 19:48, 10 July 2020
![]() |
Boolean Functions for Cryptography and Coding Theory |
Claude Carlet | |
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. |
![]() |
Introduction to Finite Fields and their Applications |
Rudolf Lidl & Harald Niederreiter | |
A standard textbook on the theory of finite fields and other elementary topics. |
![]() |
Handbook of Finite Fields |
Gary L. Mullen & Daniel Panario | |
A comprehensive survey on results in the area of finite fields. |
![]() |
Bent functions: results and applications to cryptography |
Natalia Tokareva | |
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. |