Books on Boolean Functions - Revision history

Nikolay at 19:48, 10 July 2020

2020-07-10T19:48:42Z

← Older revision		Revision as of 19:48, 10 July 2020
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>

Ivi062 at 10:32, 3 February 2020

2020-02-03T10:32:16Z

@@ Line 79: / Line 79: @@
 <tr>
 <td style="text-align: left">A comprehensive survey on results in the area of finite fields.</td>
 </tr>
 </table>

Nikolay at 19:46, 7 January 2019

2019-01-07T19:46:35Z

@@ Line 1: / Line 1: @@
-<table>
+<table width="100%">
 <tr>
-<td rowspan="3">image</td>
+<td width="150px" rowspan="3">[[File:9783319129907-big.jpg|150px]]</td>
 <td style="text-align: left">Construction and Analysis of Cryptographic Functions</td>
 </tr>
@@ Line 9: / Line 9: @@
 <tr>
 <td style="text-align: left">This book covers novel research on construction and analysis of optimal cryptographic functions such as almost perfect nonlinear (APN), almost bent (AB), planar and bent functions. These functions have optimal resistance to linear and/or differential attacks, which are the two most powerful attacks on symmetric cryptosystems. Besides cryptographic applications, these functions are significant in many branches of mathematics and information theory including coding theory, combinatorics, commutative algebra, finite geometry, sequence design and quantum information theory. The author analyzes equivalence relations for these functions and develops several new methods for construction of their infinite families. In addition, the book offers solutions to two longstanding open problems, including the problem on characterization of APN and AB functions via Boolean, and the problem on the relation between two classes of bent functions.</td>
 </tr>
 </table>

Nikolay: Created page with "

image Construction and Analysis of Cryptographic Functions

Lilya Bu..."
2019-01-07T19:33:10Z

Created page with "<table> <tr> <td rowspan="3">image</td> <td style="text-align: left">Construction and Analysis of Cryptographic Functions</td> </tr> <tr> <td style="text-align: left">Lilya Bu..."

New page
<table>
<tr>
<td rowspan="3">image</td>
<td style="text-align: left">Construction and Analysis of Cryptographic Functions</td>
</tr>
<tr>
<td style="text-align: left">Lilya Budaghyan</td>
</tr>
<tr>
<td style="text-align: left">This book covers novel research on construction and analysis of optimal cryptographic functions such as almost perfect nonlinear (APN), almost bent (AB), planar and bent functions. These functions have optimal resistance to linear and/or differential attacks, which are the two most powerful attacks on symmetric cryptosystems. Besides cryptographic applications, these functions are significant in many branches of mathematics and information theory including coding theory, combinatorics, commutative algebra, finite geometry, sequence design and quantum information theory. The author analyzes equivalence relations for these functions and develops several new methods for construction of their infinite families. In addition, the book offers solutions to two longstanding open problems, including the problem on characterization of APN and AB functions via Boolean, and the problem on the relation between two classes of bent functions.</td>
</tr>
</table>