Cover Image

Number theoretic methods in cryptography : complexity lower bounds /

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Shparlinski, Igor E.
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Basel ; Boston : Birkhäuser, [1999]
Series:Progress in computer science and applied logic ; v. 17.
Subjects:
Computational complexity.
Number theory.
Cryptography.
Complexité de calcul (Informatique)
Nombres, Théorie des.
Cryptographie.
Algebraische Zahlentheorie > Komplexität > Kryptosystem.
Komplexität > Algebraische Zahlentheorie > Kryptosystem.
Kryptosystem > Komplexität > Algebraische Zahlentheorie.
Boolesche Funktion > Komplexität > Kryptosystem.
Komplexität > Boolesche Funktion > Kryptosystem.
Kryptosystem > Komplexität > Boolesche Funktion.
Polynom > Faktorisierung > Komplexität > Kryptosystem.
Faktorisierung > Polynom > Komplexität > Kryptosystem.
Komplexität > Faktorisierung > Polynom > Kryptosystem.
Kryptosystem > Polynom > Faktorisierung > Komplexität.
Modularithmetik > Kryptosystem.
Kryptosystem > Modularithmetik.
Electronic books.
Online Access:Connect to the full text of this electronic book

Internet

Connect to the full text of this electronic book

Available Online

Holdings details from Available Online
Call Number: QA267.7 .S57 1999
 
Call Number Status Get It
QA267.7 .S57 1999 Available