Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
.
Bookmark this Record
Catalogue Record 49065
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 49065
.
Reviews
Catalogue Record 49065
.
British Library
Resolver for RSN-49065
Google Scholar
Resolver for RSN-49065
WorldCat
Resolver for RSN-49065
Catalogo Nazionale SBN
Resolver for RSN-49065
GoogleBooks
Resolver for RSN-49065
ICTP Library
Resolver for RSN-49065
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
512.7
Title
Cryptographic Applications of Analytic Number Theory ([EBook]) : Complexity Lower Bounds and Pseudorandomness / edited by Igor Shparlinski.
Added Personal Name
Shparlinski, Igor E.
Other name(s)
SpringerLink (Online service)
Publication
Basel : Birkhäuser , 2003.
Physical Details
IX, 414 pages : online resource.
Series
Progress in computer science and applied logic
; 22
ISBN
9783034880374
Summary Note
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.:
Contents note
I Preliminaries -- 1 Basic Notation and Definitions -- 2 Polynomials and Recurrence Sequences -- 3 Exponential Sums -- 4 Distribution and Discrepancy -- 5 Arithmetic Functions -- 6 Lattices and the Hidden Number Problem -- 7 Complexity Theory -- II Approximation and Complexity of the Discrete Logarithm -- 8 Approximation of the Discrete Logarithm Modulop -- 9 Approximation of the Discrete Logarithm Modulop -1 -- 10 Approximation of the Discrete Logarithm by Boolean Functions -- 11 Approximation of the Discrete Logarithm by Real Polynomials -- III Approximation and Complexity of the Diffie-Hellman Secret Key -- 12 Polynomial Approximation and Arithmetic Complexity of the -- Diffie-Hellman Secret Key -- 13 Boolean Complexity of the Diffie-Hellman Secret Key -- 14 Bit Security of the Diffie-Hellman Secret Key -- IV Other Cryptographic Constructions -- 15 Security Against the Cycling Attack on the RSA and Timed-release Crypto -- 16 The Insecurity of the Digital Signature Algorithm with Partially Known Nonces -- 17 Distribution of the ElGamal Signature -- 18 Bit Security of the RSA Encryption and the Shamir Message Passing Scheme -- 19 Bit Security of the XTR and LUC Secret Keys -- 20 Bit Security of NTRU -- 21 Distribution of the RSA and Exponential Pairs -- 22 Exponentiation and Inversion with Precomputation -- V Pseudorandom Number Generators -- 23 RSA and Blum-Blum-Shub Generators -- 24 Naor-Reingold Function -- 25 1/M Generator -- 26 Inversive, Polynomial and Quadratic Exponential Generators -- 27 Subset Sum Generators -- VI Other Applications -- 28 Square-Freeness Testing and Other Number-Theoretic Problems -- 29 Trade-off Between the Boolean and Arithmetic Depths of ModulopFunctions -- 30 Polynomial Approximation, Permanents and Noisy Exponentiation in Finite Fields -- 31 Special Polynomials and Boolean Functions -- VII Concluding Remarks and Open Questions.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-3-0348-8037-4
Links to Related Works
Subject References:
Applications of Mathematics
.
Applied mathematics
.
Data Encryption
.
Data encryption (Computer science)
.
Engineering mathematics
.
Mathematics
.
Number Theory
.
Authors:
editor
.
Shparlinski, Igor E.
.
See Also:
Šparlinskij, Igor E., 1956-
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Progress in computer science and applied logic
.
Classification:
512.7
.
.
ISBD Display
Catalogue Record 49065
.
Tag Display
Catalogue Record 49065
.
Related Works
Catalogue Record 49065
.
Marc XML
Catalogue Record 49065
.
Add Title to Basket
Catalogue Record 49065
.
Catalogue Information 49065
Beginning of record
.
Catalogue Information 49065
Top of page
.
Download Title
Catalogue Record 49065
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
49065
1
49065
-
2
49065
-
3
49065
-
4
49065
-
5
49065
-
Quick Search
Search for