Number Theoretic Methods in Cryptography: Complexity lower bounds - Igor Shparlinski
-35% koodilla BOOKS
Toimitus 12-18 arkipäivässä
30 päivän palautusoikeus
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, ... Täydellinen kuvaus
Saatat myös pitää
TOP
The Demon-Haunted World: Science as a Candle in the Dark
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Uncertainty: How to Navigate Chance, Ignorance, Risk and Luck
-35% koodilla BOOKS
Loppu
TOP
Heart Rate Variability: Science and Strategies for Peak Performance
Marco Altini, Sylvain Laborde, Dan Plews, Emma Mosley
-35% koodilla BOOKS
Loppu
TOP
Many Faces, One Purpose: A Manager's Handbook on Women in Firefighting
U. S. Fire Administration, Homeland Security
-35% koodilla BOOKS
Loppu
TOP
Thinking in Systems: International Bestseller
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Gulf Moment: Arab Relations Since 2011
Florence Gaub, U. S. Army War College, Strategic Studies Institute
-35% koodilla BOOKS
Loppu
TOP
Introduction to Algorithms
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Skin in the Game: Hidden Asymmetries in Daily Life
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
101 Things I Learned in Architecture School
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Dinosaurs and Prehistoric Life: The Definitive Visual Guide to Prehistoric Animals
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Worth Dying For: The Power and Politics of Flags
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Crossing Borders: About the birth of the Consortium of European Research Libraries, the organisation's early years and its path to maturity, spanning the period from the late twentieth century to the first decades of the twenty-first century
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Only Dull People Are Brilliant at Breakfast
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Playing It by the Book: Printed and Manuscript Book Games in Early Modern Europe
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
International Economics: Theory and Policy, Global Edition
Paul Krugman, Maurice Obstfeld, Marc Melitz
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Dictionary of Obscure Sorrows
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Unaccountability Machine: Why Big Systems Make Terrible Decisions
-35% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Igor Shparlinski |
|---|---|
| Julkaisija | Birkhäuser Basel |
| Series | Progress in Computer Science and Applied Logic |
| Julkaisuvuosi | 2012 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9783034897235 |