Bent Functions And Permutation Methods

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.

This book constitutes the refereed proceedings of the 6th International Conference on Reversible Computation, RC 2014, held in Kyoto, Japan, in July 2014. The 14 contributions presented together with three invited talks were carefully reviewed and selected from 27 submissions. The papers are organized in topical sections on automata for reversible computation; notation and languages for reversible computation; synthesis and optimization for reversible circuits; validation and representation of quantum logic.

This book presents interesting, important unsolved problems in the mathematical and computational sciences. The contributing authors are leading researchers in their fields and they explain outstanding challenges in their domains, first by offering basic definitions, explaining the context, and summarizing related algorithms, theorems, and proofs, and then by suggesting creative solutions. The authors feel a strong motivation to excite deep research and discussion in the mathematical and computational sciences community, and the book will be of value to postgraduate students and researchers in the areas of theoretical computer science, discrete mathematics, engineering, and cryptology.

This book constitutes the proceedings of the 14th IMA International Conference on Cryptography and Coding, IMACC 2013, held at Oxford, UK, in December 2013. The 20 papers presented were carefully reviewed and selected for inclusion in this book. They are organized in topical sections named: bits and booleans; homomorphic encryption; codes and applications; cryptanalysis; protecting against leakage; hash functions; key issues and public key primitives.

This book constitutes the proceedings of the Third International Conference on Codes, Cryptology and Information Security, C2SI 2019, held in Rabat, Morocco, in April 2019. The 19 regular papers presented together with 5 invited talks were carefully reviewed and selected from 90 submissions. The first aim of this conference is to pay homage to Said El Hajji for his valuable contribution in research, teaching and disseminating knowledge in numerical analysis, modeling and information security in Morocco, Africa, and worldwide. The second aim of the conference is to provide an international forum for researchers from academia and practitioners from industry from all over the world for discussion of all forms of cryptology, coding theory, and information security.

This book is based on the invited talks of the "RICAM-Workshop on Finite Fields and Their Applications: Character Sums and Polynomials" held at the Federal Institute for Adult Education (BIfEB) in Strobl, Austria, from September 2-7, 2012. Finite fields play important roles in many application areas such as coding theory, cryptography, Monte Carlo and quasi-Monte Carlo methods, pseudorandom number generation, quantum computing, and wireless communication. In this book we will focus on sequences, character sums, and polynomials over finite fields in view of the above mentioned application areas: Chapters 1 and 2 deal with sequences mainly constructed via characters and analyzed using bounds on character sums. Chapters 3, 5, and 6 deal with polynomials over finite fields. Chapters 4 and 9 consider problems related to coding theory studied via finite geometry and additive combinatorics, respectively. Chapter 7 deals with quasirandom points in view of applications to numerical integration using quasi-Monte Carlo methods and simulation. Chapter 8 studies aspects of iterations of rational functions from which pseudorandom numbers for Monte Carlo methods can be derived. The goal of this book is giving an overview of several recent research directions as well as stimulating research in sequences and polynomials under the unified framework of character theory.

This book constitutes the proceedings of the Second International Conference on Codes, Cryptology and Information Security, C2SI 2017, held in Rabat, Morocco, in April 2017. The 19 regular papers presented together with 5 invited talks were carefully reviewed and selected from 72 submissions. The first aim of this conference is to pay homage to Claude Carlet for his valuable contribution in teaching and disseminating knowledge in coding theory and cryptography worldwide, especially in Africa. The second aim of the conference is to provide an international forum for researchers from academia and practitioners from industry from all over the world for discussion of all forms of cryptology, coding theory and information security.