<p/><br></br><p><b> About the Book </b></p></br></br>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. --<p/><br></br><p><b> Book Synopsis </b></p></br></br><i> <p>Bent Functions: Results and Applications to Cryptography </i>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. </p> <p>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.</p><p/><br></br><p><b> Review Quotes </b></p></br></br><br>...will definitely motivate researchers to work on bent functions and in general on cryptographic Boolean functions...it compiles together results published both in Russian and in English. This book will be a cornerstone of research activity on bent functions. --<b>Mathematical Reviews</b><br><p/><br></br><p><b> About the Author </b></p></br></br>Dr. Natalia Tokareva is a senior researcher at the Laboratory of Discrete Analysis in the Sobolev Institute of Mathematics and she teaches courses in cryptology in the Department of Mathematics and Mechanics at Novosibirsk State University. She has studied bent functions and their applications for several years, publishing one monograph (in Russian) and more than 12 articles. She has been a participant of many international conferences and seminars and presentations in the area of bent functions, particularly with applications in cryptography. Her research interests include Boolean functions in cryptography, bent functions, block and stream ciphers, cryptanalysis, coding theory, combinatorics, and algebra. She is chief of the seminar "Cryptography and Cryptanalysis" at the Sobolev Institute of Mathematics and she supervises BS, MS, and PhD students in discrete mathematics and cryptology.
Price Archive shows prices from various stores, lets you see history and find the cheapest. There is no actual sale on the website. For all support, inquiry and suggestion messagescommunication@pricearchive.us