Bent Functions

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.

Produk Detail:

  • Author : Sihem Mesnager
  • Publisher : Springer
  • Pages : 544 pages
  • ISBN : 3319325957
  • Rating : 4/5 from 21 reviews
CLICK HERE TO GET THIS BOOKBent Functions

Bent Functions

Bent Functions
  • Author : Natalia Tokareva
  • Publisher : Academic Press
  • Release : 24 August 2015
GET THIS BOOKBent Functions

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

Bent Functions

Bent Functions
  • Author : Sihem Mesnager
  • Publisher : Springer
  • Release : 09 August 2016
GET THIS BOOKBent Functions

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

Discovery of Bent Functions Using the Fast Walsh Transform

Discovery of Bent Functions Using the Fast Walsh Transform
  • Author : Timothy R. O'Dowd
  • Publisher : Unknown Publisher
  • Release : 18 May 2021
GET THIS BOOKDiscovery of Bent Functions Using the Fast Walsh Transform

Linear cryptanalysis attacks are a threat against cryptosystems. These attacks can be defended against by using combiner functions composed of highly nonlinear Boolean functions. Bent functions, which have the highest possible nonlinearity, are uncommon. As the number of variables in a Boolean function increases, bent functions become extremely rare. A method of computing the nonlinearity of Boolean functions using the Fast Walsh Transform (FWT) is presented. The SRC-6 reconfigurable computer allows testing of functions at a much faster rate than

Finding Bent Functions Using Genetic Algorithms

Finding Bent Functions Using Genetic Algorithms
  • Author : Anonim
  • Publisher : Unknown Publisher
  • Release : 18 May 2021
GET THIS BOOKFinding Bent Functions Using Genetic Algorithms

In this thesis, a generic genetic algorithm (GA) is presented that is implemented on a reconfigurable computer. Our GA is implemented such that many problems can be solved by simply adapting the problem to the GA. For example, part of this process involves the customization of the fitness function of the given problem to the GA. The size of the problem is limited by the capacity of a field programmable gate array that is part of the reconfigurable computer. We

CONSTRUCTIONS OF BENT FUNCTIONS.

CONSTRUCTIONS OF BENT FUNCTIONS.
  • Author : Anonim
  • Publisher : Unknown Publisher
  • Release : 18 May 2021
GET THIS BOOKCONSTRUCTIONS OF BENT FUNCTIONS.

In cryptography especially in block cipher design, Boolean functions are the basic elements. A cryptographic function should have high nonlinearity as it can be attacked by linear attack. In this thesis the highest possible nonlinear boolean functions in the even dimension, that is bent functions, basic properties and construction methods of bent functions are studied. Also normal bent functions and generalized bent functions are presented.

Cryptographic Boolean Functions and Applications

Cryptographic Boolean Functions and Applications
  • Author : Thomas W. Cusick,Pantelimon Stanica
  • Publisher : Academic Press
  • Release : 04 March 2009
GET THIS BOOKCryptographic Boolean Functions and Applications

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

An Analysis of Bent Function Properties Using the Transeunt Triangle and the SRC-6 Reconfigurable Computer

An Analysis of Bent Function Properties Using the Transeunt Triangle and the SRC-6 Reconfigurable Computer
  • Author : Anonim
  • Publisher : Unknown Publisher
  • Release : 18 May 2021
GET THIS BOOKAn Analysis of Bent Function Properties Using the Transeunt Triangle and the SRC-6 Reconfigurable Computer

Linear attacks against cryptosystems can be defeated when combiner functions are composed of highly nonlinear Boolean functions. The highest nonlinearity Boolean functions, or bent functions, are not common- especially when they have many variables-bent functions are difficult to find. Understanding what properties are common to bent functions will help ease the search for them. Using the SRC-6 reconfigurable computer, functions can be generated or tested at a rate much higher than a PC. This thesis uses the SRC-6 to characterize

Vectorial Bent Functions in Characteristic Two

Vectorial Bent Functions in Characteristic Two
  • Author : Lucien Joseph Lapierre
  • Publisher : Unknown Publisher
  • Release : 18 May 2021
GET THIS BOOKVectorial Bent Functions in Characteristic Two

We study Dillon-type vectorial bent functions of the monomial and multinomial varieties. We also study Kloosterman sums, which relate to the construction of Dillon-type monomial bent functions. For Dillon-type monomial functions we give sufficient conditions for vectorial bentness, leading to the construction of several new examples. We give useful necessary conditions for functions from GF(2̂(4m)) to GF(4). We give new restrictions on the maximum output dimension of Dillon-type monomial bent functions on GF(2̂(4m)). We subsequently show that certain

Fast Software Encryption

Fast Software Encryption
  • Author : Anonim
  • Publisher : Unknown Publisher
  • Release : 18 May 1994
GET THIS BOOKFast Software Encryption

Vols. for 1993 consists of proceedings of the Cambridge Security Workshop; 1994: proceedings of the 2nd international workshop held in Leuven, Belgium; 1996- : proceedings of the 3rd- international workshop.

The Circular Pipeline

The Circular Pipeline
  • Author : Christopher D. Johnson
  • Publisher : Unknown Publisher
  • Release : 18 May 2021
GET THIS BOOKThe Circular Pipeline

For the first time, the circular pipeline as a means to significantly improve the throughput achieved in the search for bent functions is presented in this thesis. Linear cryptanalysis attack is a threat to modern symmetric encryption systems. A good defense is the use of a primitive based on Boolean functions having the highest nonlinearity possible a bent function. Bent functions are extremely rare and, therefore, difficult to find. The implementation of a sieve on a field programmable gate array (