Primality Testing and Integer Factorization in Public-Key Cryptography:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
2009
|
| Edition: | 2nd ed. 2009 |
| Series: | Advances in Information Security
11 |
| Subjects: | |
| Online Access: | DE-355 Volltext |
| Physical Description: | 1 Online-Ressource (XVIII, 371 Seiten 40 illus.) |
| ISBN: | 9780387772684 |
| ISSN: | 2512-2193 |
| DOI: | 10.1007/978-0-387-77268-4 |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV050122702 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 250115s2009 xx o|||| 00||| eng d | ||
| 020 | |a 9780387772684 |9 978-0-387-77268-4 | ||
| 024 | 7 | |a 10.1007/978-0-387-77268-4 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-0-387-77268-4 | ||
| 035 | |a (OCoLC)1492120354 | ||
| 035 | |a (DE-599)BVBBV050122702 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 | ||
| 082 | 0 | |a 005.824 |2 23 | |
| 100 | 1 | |a Yan, Song Y. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Primality Testing and Integer Factorization in Public-Key Cryptography |c by Song Y. Yan |
| 250 | |a 2nd ed. 2009 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 2009 | |
| 300 | |a 1 Online-Ressource (XVIII, 371 Seiten 40 illus.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Advances in Information Security |v 11 |x 2512-2193 | |
| 505 | 8 | |a 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 | |
| 650 | 4 | |a Cryptology | |
| 650 | 4 | |a Number Theory | |
| 650 | 4 | |a Mathematics of Computing | |
| 650 | 4 | |a Data Structures and Information Theory | |
| 650 | 4 | |a Data and Information Security | |
| 650 | 4 | |a Coding and Information Theory | |
| 650 | 4 | |a Cryptography | |
| 650 | 4 | |a Data encryption (Computer science) | |
| 650 | 4 | |a Number theory | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Data protection | |
| 650 | 4 | |a Coding theory | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387772677 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780387568805 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781441945860 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-0-387-77268-4 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-1-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2009 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035459572 | |
| 966 | e | |u https://doi.org/10.1007/978-0-387-77268-4 |l DE-355 |p ZDB-2-SCS |q UBR Paketkauf 2024 |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1823676063449874432 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Yan, Song Y. |
| author_facet | Yan, Song Y. |
| author_role | aut |
| author_sort | Yan, Song Y. |
| author_variant | s y y sy syy |
| building | Verbundindex |
| bvnumber | BV050122702 |
| collection | ZDB-1-SCS |
| contents | 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 |
| ctrlnum | (ZDB-2-SCS)978-0-387-77268-4 (OCoLC)1492120354 (DE-599)BVBBV050122702 |
| dewey-full | 005.824 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.824 |
| dewey-search | 005.824 |
| dewey-sort | 15.824 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-0-387-77268-4 |
| edition | 2nd ed. 2009 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050122702</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250115s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387772684</subfield><subfield code="9">978-0-387-77268-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-0-387-77268-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-0-387-77268-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1492120354</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050122702</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.824</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yan, Song Y.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Primality Testing and Integer Factorization in Public-Key Cryptography</subfield><subfield code="c">by Song Y. Yan</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2nd ed. 2009</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVIII, 371 Seiten 40 illus.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Advances in Information Security</subfield><subfield code="v">11</subfield><subfield code="x">2512-2193</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Number Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data and Information Security</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding and Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptography</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data encryption (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Number theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data protection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780387772677</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780387568805</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781441945860</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-0-387-77268-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035459572</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-0-387-77268-4</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBR Paketkauf 2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV050122702 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-10T13:10:23Z |
| institution | BVB |
| isbn | 9780387772684 |
| issn | 2512-2193 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035459572 |
| oclc_num | 1492120354 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XVIII, 371 Seiten 40 illus.) |
| psigel | ZDB-1-SCS ZDB-2-SCS_2009 ZDB-2-SCS UBR Paketkauf 2024 |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer US |
| record_format | marc |
| series2 | Advances in Information Security |
| spelling | Yan, Song Y. Verfasser aut Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y. Yan 2nd ed. 2009 New York, NY Springer US 2009 1 Online-Ressource (XVIII, 371 Seiten 40 illus.) txt rdacontent c rdamedia cr rdacarrier Advances in Information Security 11 2512-2193 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 Cryptology Number Theory Mathematics of Computing Data Structures and Information Theory Data and Information Security Coding and Information Theory Cryptography Data encryption (Computer science) Number theory Computer science / Mathematics Data structures (Computer science) Information theory Data protection Coding theory Erscheint auch als Druck-Ausgabe 9780387772677 Erscheint auch als Druck-Ausgabe 9780387568805 Erscheint auch als Druck-Ausgabe 9781441945860 https://doi.org/10.1007/978-0-387-77268-4 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Yan, Song Y. 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 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 Cryptology Number Theory Mathematics of Computing Data Structures and Information Theory Data and Information Security Coding and Information Theory Cryptography Data encryption (Computer science) Number theory Computer science / Mathematics Data structures (Computer science) Information theory Data protection Coding theory |
| title | Primality Testing and Integer Factorization in Public-Key Cryptography |
| title_auth | Primality Testing and Integer Factorization in Public-Key Cryptography |
| title_exact_search | Primality Testing and Integer Factorization in Public-Key Cryptography |
| title_full | Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y. Yan |
| title_fullStr | Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y. Yan |
| title_full_unstemmed | Primality Testing and Integer Factorization in Public-Key Cryptography by Song Y. Yan |
| title_short | Primality Testing and Integer Factorization in Public-Key Cryptography |
| title_sort | primality testing and integer factorization in public key cryptography |
| topic | Cryptology Number Theory Mathematics of Computing Data Structures and Information Theory Data and Information Security Coding and Information Theory Cryptography Data encryption (Computer science) Number theory Computer science / Mathematics Data structures (Computer science) Information theory Data protection Coding theory |
| topic_facet | Cryptology Number Theory Mathematics of Computing Data Structures and Information Theory Data and Information Security Coding and Information Theory Cryptography Data encryption (Computer science) Number theory Computer science / Mathematics Data structures (Computer science) Information theory Data protection Coding theory |
| url | https://doi.org/10.1007/978-0-387-77268-4 |
| work_keys_str_mv | AT yansongy primalitytestingandintegerfactorizationinpublickeycryptography |