|
" Bent functions : "
by Natalia Tokareva, Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
622794
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Tokareva, Natalia
|
| Title & Author
|
:
|
Bent functions : : results and applications to cryptography /\ by Natalia Tokareva, Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia
|
| Page. NO
|
:
|
xviii, 202 pages :: illustrations, portraits ;; 23 cm
|
| ISBN
|
:
|
9780128023181
|
|
|
:
|
: 012802318X
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (pages 175-195) and index
|
| Contents
|
:
|
Boolean functions -- Bent functions: An introduction -- History of bent functions -- Applications of bent functions -- Properties of bent functions -- Equivalent representations of bent functions -- Bent functions with a small number of variables -- Combinatorial constructions of bent functions -- Algebraic constructions of bent functions -- Bent functions and other cryptographic properties -- Distances between bent functions -- Automorphisms of the set of bent functions -- Bounds on the number of bent functions -- Bent decomposition problem -- Algebraic generalizations of bent functions -- Combinatorial generalizations of bent functions -- Cryptographic generalizations of bent functions
|
| Abstract
|
:
|
This book is devoted to such objects of discrete mathematics as Boolean bent functions. These functions have a remarkable property distinguishes bent functions as a special mysterious class and leads to numerous applications of bent functions in combinatorics, coding theory, and cryptography. In this book a detailed overview of results in bent functions is given. We discuss historical aspects of the invention of bent functions and describe their applications in cryptography and discrete mathematics. Basic properties and equivalent representations of bent functions are studied. Detailed classifications of bent functions in a small number of variables, and combinatorial and algebraic constructions of bent functions are considered. Connections between bent functions and other cryptographic functions are studied. Hamming distances between bent functions and the group of automorphisms of the set of all bent functions are considered. Upper and lower bounds for the number of bent functions and hypotheses on the asymptotic value of this number are discussed. A detailed systematic survey on generalizations of bent functions with respect to their algebraic, combinatorial, and cryptographic properties is given: we consider at least 25 distinct generalizations. Open problems in bent functions are also discussed. There are about 125 theorems in bent functions. Some results were presented before only in Russian and are still not widely known. The book is oriented at specialists in Boolean functions and cryptography, academic staff, and students. -- from back cover
|
|
|
:
|
This book is devoted
|
| Subject
|
:
|
Algebraic functions
|
| Subject
|
:
|
Algebra, Boolean
|
| Subject
|
:
|
Cryptography-- Mathematics
|
| Dewey Classification
|
:
|
511.3/24
|
| LC Classification
|
:
|
QA341.T65 2015
|
| |