• 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
Primality Testing and Integer Factorization in Public-Key Cryptography

Primality Testing and Integer Factorization in Public-Key Cryptography

Paperback

Series: Advances in Information Security, Book 11

General ComputersComputer Security

ISBN10: 1441945865
ISBN13: 9781441945860
Publisher: Springer Nature
Published: Nov 29 2010
Pages: 371
Weight: 1.21
Height: 0.81 Width: 6.14 Depth: 9.21
Language: English

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.

Also in

Computer Security