Everand Logo

Welcome to Everand!

  • Discover millions of ebooks, audiobooks, and so much more with a free trial

    Only $11.99/month after trial. Cancel anytime.

    Bent Functions: Results and Applications to Cryptography
    Bent Functions: Results and Applications to Cryptography
    Bent Functions: Results and Applications to Cryptography
    Ebook519 pages6 hours

    Bent Functions: Results and Applications to Cryptography

    By Natalia Tokareva

    ()

    Read preview

    About this ebook

    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.

    • Provides a detailed survey of bent functions and their main results, presenting a systematic overview of their generalizations and applications
    • Presents a systematic and detailed survey of hundreds of results in the area of highly nonlinear Boolean functions in cryptography
    • Appropriate coverage for students from advanced specialists in cryptography, mathematics, and creators of ciphers
    LanguageEnglish
    PublisherAcademic Press
    Release dateAug 24, 2015
    ISBN9780128025550
    Bent Functions: Results and Applications to Cryptography
    Author

    Natalia Tokareva

    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.

    Related to Bent Functions

    Related ebooks

    Security For You

    View More
    View More

    Related podcast episodes

    Related articles

    • Article

      The Verdict

      May 30, 2023

      The Verdict
      2 min read

    • Article

      Enhance GIMP With Must-have Plugins

      Apr 4, 2023

      Credit: http://gimp.org Karsten Günther loves to extend his GIMP installations with useful plugins. And playing with the new tools… Many of the most important plugins presented here are quite old, but they are still maintained and sometimes even deve

      9 min read

    • Article

      Win, Lose Or Draw?

      Jun 30, 2020

      Win, Lose Or Draw?
      1 min read

    • Article

      Intel Core i3-13100F

      Jun 27, 2023

      Intel Core i3-13100F
      2 min read

    • Article

      How To Develop A RESTful Client In Go

      Nov 16, 2021

      Mihalis Tsoukalos is a systems engineer and technical writer. He’s the author of Go Systems Programming and Mastering Go. You can reach him at @mactsouk. The subject of this month’s tutorial is RESTful services. In particular, you’re going to learn h

      9 min read

    • Article

      Answers

      Jun 27, 2023

      Answers
      9 min read

    • Article

      Distro Watch

      Oct 19, 2021

      Distro Watch
      1 min read

    • Article

      NixOS 21.05

      Sep 21, 2021

      NixOS 21.05
      3 min read

    • Article

      Perl at 34

      Feb 8, 2022

      Perl at 34
      7 min read

    • Article

      Build An 8-bit Binary Counter In Python

      Jun 4, 2019

      We’re taking a somewhat different tack for this tutorial. We’ll be learning about the binary numbering system and using Python to build an LED 8-bit binary counter. In digital electronics, a binary number is a base-2 numeral system that uses two symb

      5 min read

    • Article

      Why a Hedge Fund Started a Video Game Competition

      Nov 30, 2017

      There’s a weird way in which a hedge fund is a confluence of everything. There’s the money of course—Two Sigma, located in lower Manhattan, manages over $50 billion, an amount that has grown 600 percent in 6 years and is roughly the size of the econo

      9 min read

    • Article

      Grasp The Kernel Basics

      Mar 8, 2022

      Grasp The Kernel Basics
      3 min read

    • Article

      Antennas

      Dec 1, 2020

      Antennas
      4 min read

    • Article

      Digital Connection

      Nov 1, 2019

      Digital Connection
      9 min read

    • Article

      Lesser-known Relative Of The Laser Could Leave The Lab Soon

      Feb 9, 2018

      Researchers may have found a way to solve the weakness of a type of light source similar to lasers. The alternative light source could lead to smaller, lower-cost, and more efficient sources of light pulses. “Sometimes you completely reshape your und

      3 min read

    • Article

      What Makes A Perfect Sensor?

      Jan 29, 2018

      What Makes A Perfect Sensor?
      2 min read

    • Article

      Neural Pathways

      Jul 2, 2021

      Neural Pathways
      5 min read

    • Article

      Adding Kevlar® to Your Code

      Feb 1, 2022

      Someone once said that writing the code for a new program takes about 20% of the development time. Testing and debugging that code eats up the remaining 80%. Kinda makes you wonder how programmers manage to screw up the first 20% to such a degree tha

      4 min read

    • Article

      Babbage And Running His Many Engines

      Nov 16, 2021

      Mike Bedford Like most of us, Mike tended to think of the likes of Alan Turing and John von Neumann as the pioneers of computing, so delving further into Charles Babbage’s creations was truly inspiring. Discussion about the first ever computer often

      11 min read

    • Article

      Why Does The Universe Exist?

      Jun 30, 2021

      Why Does The Universe Exist?
      9 min read

    • Article

      Moore’s Law Is About to Get Weird: Never mind tablet computers. Wait till you see bubbles and slime mold.

      Feb 12, 2015

      I’ve never seen the computer you’re reading this story on, but I can tell you a lot about it. It runs on electricity. It uses binary logic to carry out programmed instructions. It shuttles information using materials known as semiconductors. Its brai

      7 min read

    Related categories

    Reviews for Bent Functions

    0 ratings

    0 ratings0 reviews

    What did you think?

    Tap to rate

    Review must be at least 10 words

      Book preview

      Bent Functions - Natalia Tokareva

      functions

      Chapter 1

      Boolean Functions

      Abstract

      and its automorphisms are considered. It is shown how to associate Boolean functions in n . We discuss polynomial representations of Boolean and vectorial Boolean functions. Representations of a Boolean function in the trace form and in the reduced trace form are given. Some details on the degree of a Boolean function in the trace form and on monomial functions are presented. The notions introduced in this chapter will be useful throughout the book.

      Keywords

      Boolean function

      Vectorial function

      Algebraic normal form

      Boolean cube

      Hamming distance

      Extended affine equivalence

      Walsh-Hadamard transform

      Finite field

      Polynomial form

      Trace form

      Monomial function

      Introduction

      and its automorphisms are considered. It is shown how to associate Boolean functions in n . We discuss polynomial representations of Boolean and vectorial Boolean functions. Representations of a Boolean function in the trace form and in the reduced trace form are given. Some details on the degree of a Boolean function in the trace form and on monomial functions are presented. The notions introduced in this chapter will be useful throughout the book.

      1.1 Definitions

      denote the n. Let x = (x1,…,xnof length n.

      A Boolean function in nvariables . It is called Boolean in honor of the British mathematician and philosopher George Boole (1815-1864).

      Every Boolean function can be defined by its truth table:

      and in the second column there are concrete values of a Boolean function taken on these vectors (denoted here by *). We suppose that the arguments of a function (i.e., vectors of length n) follow in lexicographical order. For example, if n = 3, the order is (000),(001),(010), (011),(100), (101), (110),(111).

      For instance, the following are Boolean functions:

      such that g(00) = g(11) = 1, g(01) = g(10) = 0;

      such that h(x) = 1 if and only if x has two nonzero coordinates.

      Their truth tables are as follows:

      ,

      of them: to construct a function, one chooses 2n values (0 or 1) for f(x) when x .

      Every Boolean function in n variables can be uniquely determined by its vector of values of length 2n. This is the transposed second column of its truth table.

      In our examples, (1001) and (00010110) are vectors of values for g and h, respectively.

      A vectorial Boolean function F in n , where m is an integer. It is also called an (n,m)-function. In what follows in this book, we consider m = n unless otherwise stated. For vectorial Boolean functions we use uppercase letters, whereas Boolean functions are denoted with lowercase letters.

      Every vectorial Boolean function in n variables can be presented as

      where f1,…,fn are Boolean functions in n variables called coordinate functions of F. An arbitrary nonempty linear combination of coordinate functions is called a component function of a vectorial function F. In terms of the inner product, which will be introduced in the next section, a component function is a function fv(x) = 〈F(x),v. In particular, every coordinate function is a component

      Enjoying the preview?
      Page 1 of 1