This book constitutes the refereed proceedings of the Third International Conference on Security and Privacy, ICSP 2024, held in Jamshedpur, India, during November 20–21, 2024.The 12 full papers and 1 short paper included in this book were carefully reviewed and selected from 39 submissions. They were organized in topical sections as follows: Cryptanalysis and Other Attacks; Boolean Functions; Authentication and authorization, Cyber-physical systems security, Privacy-preserving tec...

This book constitutes the conference proceedings of the 4th International Conference on Security and Privacy, ICSP 2025, held in Rourkela, India, during December 5–7, 2025.The 14 full papers in this book were carefully reviewed and selected from 52 submissions. They were organized in topical sections as follows: Mathematical Foundation of Cryptography, Authentication Key Management and Machine Learning in Cybersecurity.

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. Student...

This book constitutes the refereed proceedings of the Second International Conference, ICSP 2021, held in Jamshedpur, India, in November 2021.The 10 full papers were carefully reviewed and selected from 44 submissions. The contributions are organized in the following blocks: Cryptanalysis and other attacks; Symmetric cryptography and hash functions; Mathematical foundations of cryptography; Embedded systems security; Security in hardware; Authentication, Key management, Public key ...

This book constitutes the refereed proceedings of the 5th International Workshop on the Arithmetic of Finite Field, WAIFI 2014, held in Gebze, Turkey, in September 2014. The 9 revised full papers and 43 invited talks presented were carefully reviewed and selected from 27 submissions. This workshop is a forum of mathematicians, computer scientists, engineers and physicists performing research on finite field arithmetic, interested in communicating the advances in the theory, applications, a...

Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field.Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer scienc...

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a bro...

This book constitutes the refereed proceedings of the 8th International Conference on Sequences and Their Applications, SETA 2014, held in Melbourne, VIC, Australia, in November 2014. The 24 full papers presented together with 2 invited papers were carefully reviewed and selected from 36 submissions. The papers have been organized in topical sections on Boolean functions, perfect sequences, correlation of arrays, relative difference sets, aperiodic correlation, pseudorandom sequences and s...

The only book to provide a unified view of the interplay between computational number theory and cryptographyComputational number theory and modern cryptography are two of the most important and fundamental research fields in information security. In this book, Song Y. Yang combines knowledge of these two critical fields, providing a unified view of the relationships between computational number theory and cryptography. The author takes an innovati...

Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes...

This fundamental monograph introduces both the probabilistic and algebraic aspects of information theory and coding. It has evolved from the authors' years of experience teaching at the undergraduate level, including several Cambridge Maths Tripos courses. The book provides relevant background material, a wide range of worked examples and clear solutions to problems from real exam papers. It is a valuable teaching aid for undergraduate and graduate students, or for researchers and engineer...

Today's pervasive computing and communications networks have created an intense need for secure and reliable cryptographic systems. Bringing together a fascinating mixture of topics in engineering, mathematics, computer science, and informatics, this book presents the timeless mathematical theory underpinning cryptosystems both old and new. Major branches of classical and modern cryptography are discussed in detail, from basic block and stream cyphers through to systems based on elliptic a...