• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Quantum Attacks on Public-Key Cryptosystems

Quantum Attacks on Public-Key Cryptosystems

Hardcover

General ComputersComputer Security

ISBN10: 144197721X
ISBN13: 9781441977212
Publisher: Springer
Published: Apr 27 2013
Pages: 207
Weight: 1.06
Height: 0.56 Width: 6.14 Depth: 9.21
Language: English

The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists.

Also in

General Computers