Cargando…
Number theoretic methods in cryptography: complexity lower bounds
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. I...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
1999
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-3-0348-8664-2 http://cds.cern.ch/record/2006174 |