Cargando…
Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness
The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classic...
| Autor principal: | |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2003
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-3-0348-8037-4 http://cds.cern.ch/record/2006294 |