This book constitutes the refereed post-conference proceedings of the First International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2017, held in Warsaw, Poland, in September 2017.The 15 revised full papers presented in this book together with 3 invited talks were carefully reviewed and selected from 32 initial submissions. The papers are organized in topical sections on elliptic curves in cryptography; public-key cryptography; lattices in cryptography; number theory; pseudorandomness; and algebraic structures and analysis.
At the heart of modern cryptographic algorithms lies computational number theory. Whether you're encrypting or decrypting ciphers, a solid background in number theory is essential for success. Written by a number theorist and practicing cryptographer, Cryptanalysis of Number Theoretic Ciphers takes you from basic number theory to the inner workings of ciphers and protocols. First, the book provides the mathematical background needed in cryptography as well as definitions and simple examples from cryptography. It includes summaries of elementary number theory and group theory, as well as common methods of finding or constructing large random primes, factoring large integers, and computing discrete logarithms. Next, it describes a selection of cryptographic algorithms, most of which use number theory. Finally, the book presents methods of attack on the cryptographic algorithms and assesses their effectiveness. For each attack method the author lists the systems it applies to and tells how they may be broken with it. Computational number theorists are some of the most successful cryptanalysts against public key systems. Cryptanalysis of Number Theoretic Ciphers builds a solid foundation in number theory and shows you how to apply it not only when breaking ciphers, but also when designing ones that are difficult to break.
The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of • polynomials; • algebraic functions; • Boolean functions; • linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.
The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills.
Papers presented by prominent contributors at a workshop on Number Theory and Cryptography, and the annual meeting of the Australian Mathematical Society.
This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach taken is algorithmic, emphasising estimates of the efficiency of the techniques that arise from the theory, and one special feature is the inclusion of recent applications of the theory of elliptic curves. Extensive exercises and careful answers are an integral part all of the chapters.
Johannes Buchmann is internationally recognized as one of the leading figures in areas of computational number theory, cryptography and information security. He has published numerous scientific papers and books spanning a very wide spectrum of interests; besides R&D he also fulfilled lots of administrative tasks for instance building up and directing his research group CDC at Darmstadt, but he also served as the Dean of the Department of Computer Science at TU Darmstadt and then went on to become Vice President of the university for six years (2001-2007). This festschrift, published in honor of Johannes Buchmann on the occasion of his 60th birthday, contains contributions by some of his colleagues, former students and friends. The papers give an overview of Johannes Buchmann's research interests, ranging from computational number theory and the hardness of cryptographic assumptions to more application-oriented topics such as privacy and hardware security. With this book we celebrate Johannes Buchmann's vision and achievements.
Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. With additional exercises, this edition offers more comprehensive coverage of the fundamental theory, techniques, and application
Primality Testing and Integer Factorization in Public-Key Cryptography introduces various algorithms for primality testing and integer factorization, with their applications in public-key cryptography and information security. More specifically, this book explores basic concepts and results in number theory in Chapter 1. Chapter 2 discusses various algorithms for primality testing and prime number generation, with an emphasis on the Miller-Rabin probabilistic test, the Goldwasser-Kilian and Atkin-Morain elliptic curve tests, and the Agrawal-Kayal-Saxena deterministic test for primality. Chapter 3 introduces various algorithms, particularly the Elliptic Curve Method (ECM), the Quadratic Sieve (QS) and the Number Field Sieve (NFS) for integer factorization. This chapter also discusses some other computational problems that are related to factoring, such as the square root problem, the discrete logarithm problem and the quadratic residuosity problem.
Building on the success of the first edition, An Introduction to Number Theory with Cryptography, Second Edition, increases coverage of the popular and important topic of cryptography, integrating it with traditional topics in number theory. The authors have written the text in an engaging style to reflect number theory's increasing popularity. The book is designed to be used by sophomore, junior, and senior undergraduates, but it is also accessible to advanced high school students and is appropriate for independent study. It includes a few more advanced topics for students who wish to explore beyond the traditional curriculum. Features of the second edition include Over 800 exercises, projects, and computer explorations Increased coverage of cryptography, including Vigenere, Stream, Transposition,and Block ciphers, along with RSA and discrete log-based systems "Check Your Understanding" questions for instant feedback to students New Appendices on "What is a proof?" and on Matrices Select basic (pre-RSA) cryptography now placed in an earlier chapter so that the topic can be covered right after the basic material on congruences Answers and hints for odd-numbered problems About the Authors: Jim Kraft received his Ph.D. from the University of Maryland in 1987 and has published several research papers in algebraic number theory. His previous teaching positions include the University of Rochester, St. Mary's College of California, and Ithaca College, and he has also worked in communications security. Dr. Kraft currently teaches mathematics at the Gilman School. Larry Washington received his Ph.D. from Princeton University in 1974 and has published extensively in number theory, including books on cryptography (with Wade Trappe), cyclotomic fields, and elliptic curves. Dr. Washington is currently Professor of Mathematics and Distinguished Scholar-Teacher at the University of Maryland.
