Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y Yan
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).-
Cyber-security of SCADA and Other Industrial Control Systems
-
He's Got to Go
-
Identifying Malicious Code Through Reverse Engineering
-
Privacy-Preserving Record Linkage
-
Foundations of Cyber Deception
-
Enabling Privacy Preserving Data Analytics
-
Cloud Security Auditing
-
Artificial Intelligence for Cybersecurity
-
Multivariate Public Key Cryptosystems
-
Cyber Deception
-
Cybersecurity Awareness
-
Countering Cyberterrorism
-
Guide to Cybersecurity in Digital Transformation
-
Preserving Privacy in Data Outsourcing
-
Blockchain for Cybersecurity in Cyber-Physical Systems
-
Botnet Detection
-
Information Hiding: Steganography and Watermarking-Attacks and Countermeasures
-
Spyware and Adware
-
Malware
-
Evolution of Cyber Technologies and Operations to 2035
-
Decision Making and Security Risk Management for IoT Environments
-
Iris Biometrics
-
Cyber Denial, Deception and Counter Deception
-
Cyber Threat Intelligence
-
Global Initiatives to Secure Cyberspace
-
Encryption for Digital Content
-
Adaptive Cryptographic Access Control
-
Moving Target Defense II
-
Secure Multi-Party Non-Repudiation Protocols and Applications
-
Malicious Attack Propagation and Source Identification
-
Smart Micro-Grid Systems Security and Privacy
-
Privacy-Respecting Intrusion Detection
-
Android Malware Detection using Machine Learning
-
Network Intrusion Detection and Prevention
-
Proactive and Dynamic Network Defense
-
Security and Resiliency Analytics for Smart Grids
-
Blockchain Cybersecurity, Trust and Privacy
-
Binary Code Fingerprinting for Cybersecurity
-
Cyber Situational Awareness
-
Insider Attack and Cyber Security
From the reviews of the second edition:
"The well-written and self-contained second edition ‘is designed for a professional audience composed of researchers practitioners in industry’ In addition, ‘this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,’ as it contains about 300 problems. … Overall … ‘this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.’" (Hao Wang, ACM Computing Reviews, April, 2009)
“This is the second edition of a book originally published in 2004. … I used it as a reference in preparing lectures for an advanced cryptography course for undergraduates, and it proved to be a wonderful source for a general description of the algorithms. … the book will be a valuable addition to any good reference library on cryptography and number theory … . It contains descriptions of all the main algorithms, together with explanations of the key ideas behind them.” (S. C. Coutinho, SIGACT News, April, 2012)
| SKU | Unavailable |
| ISBN 13 | 9780387772677 |
| ISBN 10 | 0387772677 |
| Title | Primality Testing and Integer Factorization in Public-Key Cryptography |
| Author | Song Y Yan |
| Series | Advances In Information Security |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Springer-Verlag New York Inc. |
| Year published | 2008-12-02 |
| Number of pages | 371 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |