Progress in Computer Science and Applied Logic

# Number Theoretic Methods in Cryptography

## Complexity lower bounds

Authors: Shparlinski, Igor

Free Preview

eBook $59.99 price for USA in USD • ISBN 978-3-0348-8664-2 • Digitally watermarked, DRM-free • Included format: PDF • ebooks can be used on all reading devices • Immediate eBook download after purchase Hardcover$99.99
price for USA in USD
• ISBN 978-3-7643-5888-4
• Free shipping for individuals worldwide
• Institutional customers should get in touch with their account manager
• Covid-19 shipping restrictions
• Usually ready to be dispatched within 3 to 5 business days, if in stock
Softcover $79.99 price for USA in USD • ISBN 978-3-0348-9723-5 • Free shipping for individuals worldwide • Institutional customers should get in touch with their account manager • Covid-19 shipping restrictions • Usually ready to be dispatched within 3 to 5 business days, if in stock About this book 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. Reviews "This volume gives a thorough treatment of the complexity of the discrete logarithm problem in a prime field, as well as related problems. The final chapter on further directions gives an interesting selection of problems." --Zentralblatt Math ## Table of contents (14 chapters) Table of contents (14 chapters) • Introduction Pages 3-12 Shparlinski, Igor • Basic Notation and Definitions Pages 13-18 Shparlinski, Igor • Auxiliary Results Pages 19-36 Shparlinski, Igor • Approximation of the Discrete Logarithm Modulo Pages 39-47 Shparlinski, Igor • Approximation of the Discrete Logarithm Modulo Pages 49-52 Shparlinski, Igor ### Buy this book eBook$59.99
price for USA in USD
• ISBN 978-3-0348-8664-2
• Digitally watermarked, DRM-free
• Included format: PDF
• ebooks can be used on all reading devices
Hardcover $99.99 price for USA in USD • ISBN 978-3-7643-5888-4 • Free shipping for individuals worldwide • Institutional customers should get in touch with their account manager • Covid-19 shipping restrictions • Usually ready to be dispatched within 3 to 5 business days, if in stock Softcover$79.99
price for USA in USD
• ISBN 978-3-0348-9723-5
• Free shipping for individuals worldwide
• Institutional customers should get in touch with their account manager
• Covid-19 shipping restrictions
• Usually ready to be dispatched within 3 to 5 business days, if in stock

## Bibliographic Information

Bibliographic Information
Book Title
Number Theoretic Methods in Cryptography
Book Subtitle
Complexity lower bounds
Authors
Series Title
Progress in Computer Science and Applied Logic
Series Volume
17
1999
Publisher
Birkhäuser Basel
Springer Basel AG
eBook ISBN
978-3-0348-8664-2
DOI
10.1007/978-3-0348-8664-2
Hardcover ISBN
978-3-7643-5888-4
Softcover ISBN
978-3-0348-9723-5
Series ISSN
2297-0576
Edition Number
1
Number of Pages
IX, 182
Topics