# Difference between revisions of "Books on Boolean Functions"

m |
|||

Line 79: | Line 79: | ||

<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> |

## Revision as of 12:32, 3 February 2020

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. |