Primality Testing and Integer Factorization in Public-Key Cryptography - Song Y. Yan
-30% ar kodu BOOKS
Piegāde 17-23 darba dienu laikā
30 dienu atgriešanas politika
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 i ... Pilns apraksts
Jums varētu patikt arī
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
HBR Guide to Generative AI for Managers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
C Programming Language
Brian W. Kernighan, Brian Kernighan, Dennis Ritchie
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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. Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test. This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.
Vairāk informācijas
| Autors | Song Y. Yan |
|---|---|
| Izdevējs | Springer US |
| Series | Advances in Information Security |
| Izlaides gads | 2008 |
| Vāka tips | Cietais vāks |
| EAN | 9780387772677 |