Primality Testing and Integer Factorization in Public-Key Cryptography
نام عام مواد
[Book]
نام نخستين پديدآور
by Song Y. Yan.
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Boston, MA
نام ناشر، پخش کننده و غيره
Springer US : Imprint : Springer
تاریخ نشرو بخش و غیره
2004
فروست
عنوان فروست
Advances in information security, 11.
یادداشتهای مربوط به مندرجات
متن يادداشت
1. Number-Theoretic Preliminaries --;2. Primality Testing and Prime Generation --;3. Integer Factorization and Discrete Logarithms --;4. Number-Theoretic Cryptography.
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
Primality Testing and Integer Factorization in Public-Key Cryptography Song Y. Yan 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 RSA (invented by Rivest, Shamir and Adleman) relies on the computational intractability of IFP. This monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications to factoring-based Public Key Cryptography. Notable features of this second edition are the several new sections and more than 100 new pages that are added. These include a new section in Chapter 2 on the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test in P; a new section in Chapter 3 on recent work in quantum factoring; and a new section in Chapter 4 on post-quantum cryptography. To make the book suitable as an advanced undergraduate and/or postgraduate text/reference, about ten problems at various levels of difficulty are added at the end of each section, making about 300 problems in total contained in the book; most of the problems are research-oriented with prizes ordered by individuals or organizations to a total amount over five million US dollars. Primality Testing and Integer Factorization in Public Key Cryptography is designed for practitioners and researchers in industry and graduate-level students in computer science and mathematics.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Computer science.
موضوع مستند نشده
Data structures (Computer science)
موضوع مستند نشده
Information theory.
رده بندی کنگره
شماره رده
QA76
.
9
.
A25
نشانه اثر
B976
2004
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )