Primality Testing and Integer Factorization in Public-Key Cryptography
Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as...
Κύριος συγγραφέας: | Yan, Song Y. (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Boston, MA :
Springer US : Imprint: Springer,
2009.
|
Σειρά: | Advances in Information Security,
11 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Introduction to Cryptography Principles and Applications /
ανά: Delfs, Hans, κ.ά.
Έκδοση: (2007) -
Cryptanalytic Attacks on RSA
ανά: Yan, Song Y.
Έκδοση: (2008) -
An Introduction to Mathematical Cryptography
ανά: Silverman, J.H, κ.ά.
Έκδοση: (2008) -
Introduction to Cryptography Principles and Applications /
ανά: Delfs, Hans, κ.ά.
Έκδοση: (2015) -
An Introduction to Mathematical Cryptography
ανά: Hoffstein, Jeffrey, κ.ά.
Έκδοση: (2014)