Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Basel
Birkhäuser Basel
2003
|
| Series: | Progress in Computer Science and Applied Logic
22 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills |
| Physical Description: | 1 Online-Ressource (IX, 414 p) |
| ISBN: | 9783034880374 9783034894159 |
| DOI: | 10.1007/978-3-0348-8037-4 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042422017 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 9783034880374 |c Online |9 978-3-0348-8037-4 | ||
| 020 | |a 9783034894159 |c Print |9 978-3-0348-9415-9 | ||
| 024 | 7 | |a 10.1007/978-3-0348-8037-4 |2 doi | |
| 035 | |a (OCoLC)863697789 | ||
| 035 | |a (DE-599)BVBBV042422017 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 512.7 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Shparlinski, Igor |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Cryptographic Applications of Analytic Number Theory |b Complexity Lower Bounds and Pseudorandomness |c edited by Igor Shparlinski |
| 264 | 1 | |a Basel |b Birkhäuser Basel |c 2003 | |
| 300 | |a 1 Online-Ressource (IX, 414 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Progress in Computer Science and Applied Logic |v 22 | |
| 500 | |a The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Data encryption (Computer science) | |
| 650 | 4 | |a Number theory | |
| 650 | 4 | |a Number Theory | |
| 650 | 4 | |a Data Encryption | |
| 650 | 4 | |a Applications of Mathematics | |
| 650 | 4 | |a Mathematik | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-0348-8037-4 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027857434 | ||
Record in the Search Index
| _version_ | 1804153095833255936 |
|---|---|
| any_adam_object | |
| author | Shparlinski, Igor |
| author_facet | Shparlinski, Igor |
| author_role | aut |
| author_sort | Shparlinski, Igor |
| author_variant | i s is |
| building | Verbundindex |
| bvnumber | BV042422017 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863697789 (DE-599)BVBBV042422017 |
| dewey-full | 512.7 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.7 |
| dewey-search | 512.7 |
| dewey-sort | 3512.7 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-0348-8037-4 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02695nmm a2200445zcb4500</leader><controlfield tag="001">BV042422017</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783034880374</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-0348-8037-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783034894159</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-0348-9415-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-0348-8037-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863697789</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042422017</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.7</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Shparlinski, Igor</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cryptographic Applications of Analytic Number Theory</subfield><subfield code="b">Complexity Lower Bounds and Pseudorandomness</subfield><subfield code="c">edited by Igor Shparlinski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Basel</subfield><subfield code="b">Birkhäuser Basel</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (IX, 414 p)</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">Progress in Computer Science and Applied Logic</subfield><subfield code="v">22</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</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">Number Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Encryption</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Applications of Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-0348-8037-4</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027857434</subfield></datafield></record></collection> |
| id | DE-604.BV042422017 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:10Z |
| institution | BVB |
| isbn | 9783034880374 9783034894159 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027857434 |
| oclc_num | 863697789 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (IX, 414 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Birkhäuser Basel |
| record_format | marc |
| series2 | Progress in Computer Science and Applied Logic |
| spelling | Shparlinski, Igor Verfasser aut Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness edited by Igor Shparlinski Basel Birkhäuser Basel 2003 1 Online-Ressource (IX, 414 p) txt rdacontent c rdamedia cr rdacarrier Progress in Computer Science and Applied Logic 22 The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills Mathematics Data encryption (Computer science) Number theory Number Theory Data Encryption Applications of Mathematics Mathematik https://doi.org/10.1007/978-3-0348-8037-4 Verlag Volltext |
| spellingShingle | Shparlinski, Igor Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness Mathematics Data encryption (Computer science) Number theory Number Theory Data Encryption Applications of Mathematics Mathematik |
| title | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness |
| title_auth | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness |
| title_exact_search | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness |
| title_full | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness edited by Igor Shparlinski |
| title_fullStr | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness edited by Igor Shparlinski |
| title_full_unstemmed | Cryptographic Applications of Analytic Number Theory Complexity Lower Bounds and Pseudorandomness edited by Igor Shparlinski |
| title_short | Cryptographic Applications of Analytic Number Theory |
| title_sort | cryptographic applications of analytic number theory complexity lower bounds and pseudorandomness |
| title_sub | Complexity Lower Bounds and Pseudorandomness |
| topic | Mathematics Data encryption (Computer science) Number theory Number Theory Data Encryption Applications of Mathematics Mathematik |
| topic_facet | Mathematics Data encryption (Computer science) Number theory Number Theory Data Encryption Applications of Mathematics Mathematik |
| url | https://doi.org/10.1007/978-3-0348-8037-4 |
| work_keys_str_mv | AT shparlinskiigor cryptographicapplicationsofanalyticnumbertheorycomplexitylowerboundsandpseudorandomness |