Primality Testing and Integer Factorization in Public-Key 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 i...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer US
2004
|
| Ausgabe: | 1st ed. 2004 |
| Schriftenreihe: | Advances in Information Security
11 |
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 Online-Ressource (XVI, 237 p. 5 illus) |
| ISBN: | 9781475738162 |
| DOI: | 10.1007/978-1-4757-3816-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV047064320 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9781475738162 |9 978-1-4757-3816-2 | ||
| 024 | 7 | |a 10.1007/978-1-4757-3816-2 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4757-3816-2 | ||
| 035 | |a (OCoLC)1227480674 | ||
| 035 | |a (DE-599)BVBBV047064320 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.73 |2 23 | |
| 084 | |a ST 273 |0 (DE-625)143640: |2 rvk | ||
| 084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
| 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 1st ed. 2004 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 2004 | |
| 300 | |a 1 Online-Ressource (XVI, 237 p. 5 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 | |
| 520 | |a 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. | ||
| 650 | 4 | |a Data Structures and Information Theory | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Management of Computing and Information Systems | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Management information systems | |
| 650 | 4 | |a Computer science | |
| 650 | 0 | 7 | |a Public-Key-Kryptosystem |0 (DE-588)4209133-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Faktorisierung |0 (DE-588)4128927-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Primzahltest |0 (DE-588)4704538-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Public-Key-Kryptosystem |0 (DE-588)4209133-0 |D s |
| 689 | 0 | 1 | |a Primzahltest |0 (DE-588)4704538-3 |D s |
| 689 | 0 | 2 | |a Faktorisierung |0 (DE-588)4128927-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475738186 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781402076497 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475738179 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4757-3816-2 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471432 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4757-3816-2 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182062197899264 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| 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 | BV047064320 |
| classification_rvk | ST 273 ST 276 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4757-3816-2 (OCoLC)1227480674 (DE-599)BVBBV047064320 |
| dewey-full | 005.73 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.73 |
| dewey-search | 005.73 |
| dewey-sort | 15.73 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4757-3816-2 |
| edition | 1st ed. 2004 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03894nmm a2200601zcb4500</leader><controlfield tag="001">BV047064320</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781475738162</subfield><subfield code="9">978-1-4757-3816-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4757-3816-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4757-3816-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227480674</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064320</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.73</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 273</subfield><subfield code="0">(DE-625)143640:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 276</subfield><subfield code="0">(DE-625)143642:</subfield><subfield code="2">rvk</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">1st ed. 2004</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 237 p. 5 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></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</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">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management of Computing and Information Systems</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">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management information systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Public-Key-Kryptosystem</subfield><subfield code="0">(DE-588)4209133-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Faktorisierung</subfield><subfield code="0">(DE-588)4128927-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Primzahltest</subfield><subfield code="0">(DE-588)4704538-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Public-Key-Kryptosystem</subfield><subfield code="0">(DE-588)4209133-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Primzahltest</subfield><subfield code="0">(DE-588)4704538-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Faktorisierung</subfield><subfield code="0">(DE-588)4128927-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</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">9781475738186</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">9781402076497</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">9781475738179</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4757-3816-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471432</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4757-3816-2</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064320 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:34Z |
| institution | BVB |
| isbn | 9781475738162 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471432 |
| oclc_num | 1227480674 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVI, 237 p. 5 illus) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| 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 1st ed. 2004 New York, NY Springer US 2004 1 Online-Ressource (XVI, 237 p. 5 illus) txt rdacontent c rdamedia cr rdacarrier Advances in Information Security 11 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. Data Structures and Information Theory Theory of Computation Management of Computing and Information Systems Data structures (Computer science) Computers Management information systems Computer science Public-Key-Kryptosystem (DE-588)4209133-0 gnd rswk-swf Faktorisierung (DE-588)4128927-4 gnd rswk-swf Primzahltest (DE-588)4704538-3 gnd rswk-swf Public-Key-Kryptosystem (DE-588)4209133-0 s Primzahltest (DE-588)4704538-3 s Faktorisierung (DE-588)4128927-4 s DE-604 Erscheint auch als Druck-Ausgabe 9781475738186 Erscheint auch als Druck-Ausgabe 9781402076497 Erscheint auch als Druck-Ausgabe 9781475738179 https://doi.org/10.1007/978-1-4757-3816-2 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Yan, Song Y. Primality Testing and Integer Factorization in Public-Key Cryptography Data Structures and Information Theory Theory of Computation Management of Computing and Information Systems Data structures (Computer science) Computers Management information systems Computer science Public-Key-Kryptosystem (DE-588)4209133-0 gnd Faktorisierung (DE-588)4128927-4 gnd Primzahltest (DE-588)4704538-3 gnd |
| subject_GND | (DE-588)4209133-0 (DE-588)4128927-4 (DE-588)4704538-3 |
| 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_exact_search_txtP | 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 | Data Structures and Information Theory Theory of Computation Management of Computing and Information Systems Data structures (Computer science) Computers Management information systems Computer science Public-Key-Kryptosystem (DE-588)4209133-0 gnd Faktorisierung (DE-588)4128927-4 gnd Primzahltest (DE-588)4704538-3 gnd |
| topic_facet | Data Structures and Information Theory Theory of Computation Management of Computing and Information Systems Data structures (Computer science) Computers Management information systems Computer science Public-Key-Kryptosystem Faktorisierung Primzahltest |
| url | https://doi.org/10.1007/978-1-4757-3816-2 |
| work_keys_str_mv | AT yansongy primalitytestingandintegerfactorizationinpublickeycryptography |