Cryptographic applications of analytic number theory : complexity lower bounds and pseudorandomness | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/75292

18 Visitors

20 Hits

0 Downloads

Title: Cryptographic applications of analytic number theory : complexity lower bounds and pseudorandomness
Related: Progress in computer science and applied logic Vol. 22
Publisher: Basel, Switzerland ; Boston : Birkhäuser Verlag
Date: 2003
FoR/RFCD Code(s): 010100 Pure Mathematics 080200 Computation Theory and Mathematics
Author/Creator: Shparlinski, Igor
Description: The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills.
Subject Keyword: 010100 Pure Mathematics
Subject Keyword: 080200 Computation Theory and Mathematics
Subject Keyword: Computational complexity
Subject Keyword: Coding theory
Subject Keyword: Combinatorial number theory
Resource Type: book
Organisation: Macquarie University. Dept. of Computing

Macquarie University ResearchOnline