検索結果をRefWorksへエクスポートします。対象は1件です。
Export
RT Book, Whole SR Electronic DC OPAC T1 Cryptographic Applications of Analytic Number Theory : Complexity Lower Bounds and Pseudorandomness / edited by Igor Shparlinski T2 Progress in Computer Science and Applied Logic A1 Shparlinski, Igor A1 SpringerLink (Online service) YR 2003 FD 2003 SP IX, 414 p K1 Mathematics K1 Data encryption (Computer science) K1 Applied mathematics K1 Engineering mathematics K1 Number theory K1 Mathematics K1 Number Theory K1 Data Encryption K1 Applications of Mathematics PB Birkhäuser Basel : Imprint: Birkhäuser PP Basel SN 9783034880374 LA English (英語) CL DC23:512.7 NO 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 classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography 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 NO 書誌ID=1002995130; LK [E Book]http://dx.doi.org/10.1007/978-3-0348-8037-4 OL 30