Number Theoretic Methods In Cryptology
Download Number Theoretic Methods In Cryptology PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Number Theoretic Methods In Cryptology book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Number-Theoretic Methods in Cryptology
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.
Number-Theoretic Methods in Cryptology
This book constitutes the refereed post-conference proceedings of the 4th International Conference on Number-Theoretic Methods in Cryptology, NuTMiC 2024, held in Szczecin, Poland, during June 24–26, 2024. The 9 full papers and 2 invited papers presented in this book were carefully reviewed and selected from 12 submissions. They were organized in topical sections as follows: invited talks; elliptic curves in cryptography; number theory; algebraic structures and public-key cryptography.
Number Theoretic Methods in Cryptography
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.