Complexity theory and cryptology: an introduction to cryptocomplexity
Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2005
|
Schriftenreihe: | Texts in theoretical computer science
|
Schlagworte: | |
Zusammenfassung: | Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity" a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges. |
Beschreibung: | XI, 478 S. graph. Darst. |
ISBN: | 3540221476 9783540221470 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV019880202 | ||
003 | DE-604 | ||
005 | 20090529 | ||
007 | t | ||
008 | 050712s2005 gw d||| |||| 00||| eng d | ||
020 | |a 3540221476 |9 3-540-22147-6 | ||
020 | |a 9783540221470 |9 978-3-540-22147-0 | ||
035 | |a (OCoLC)61219005 | ||
035 | |a (DE-599)BVBBV019880202 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE-BE | ||
049 | |a DE-20 |a DE-91G |a DE-824 |a DE-573 |a DE-29T |a DE-92 |a DE-634 |a DE-83 |a DE-11 | ||
050 | 0 | |a QA76.9.A25 | |
082 | 0 | |a 005.8 |2 22 | |
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
084 | |a DAT 465f |2 stub | ||
084 | |a DAT 517f |2 stub | ||
100 | 1 | |a Rothe, Jörg |d 1966- |e Verfasser |0 (DE-588)121349284 |4 aut | |
245 | 1 | 0 | |a Complexity theory and cryptology |b an introduction to cryptocomplexity |c Jörg Rothe |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2005 | |
300 | |a XI, 478 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Texts in theoretical computer science | |
520 | 3 | |a Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity" a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges. | |
650 | 7 | |a Complexiteit |2 gtt | |
650 | 4 | |a Complexité de calcul (Informatique) | |
650 | 4 | |a Cryptographie | |
650 | 7 | |a Fundamentele informatica |2 gtt | |
650 | 7 | |a Geheimschrift |2 gtt | |
650 | 4 | |a Protection de l'information (Informatique) | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Computer security | |
650 | 4 | |a Cryptography | |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kryptologie |0 (DE-588)4033329-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Kryptologie |0 (DE-588)4033329-2 |D s |
689 | 1 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-013204362 |
Datensatz im Suchindex
_version_ | 1804133409332658176 |
---|---|
any_adam_object | |
author | Rothe, Jörg 1966- |
author_GND | (DE-588)121349284 |
author_facet | Rothe, Jörg 1966- |
author_role | aut |
author_sort | Rothe, Jörg 1966- |
author_variant | j r jr |
building | Verbundindex |
bvnumber | BV019880202 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.9.A25 |
callnumber-search | QA76.9.A25 |
callnumber-sort | QA 276.9 A25 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 130 ST 134 ST 276 |
classification_tum | DAT 465f DAT 517f |
ctrlnum | (OCoLC)61219005 (DE-599)BVBBV019880202 |
dewey-full | 005.8 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.8 |
dewey-search | 005.8 |
dewey-sort | 15.8 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02772nam a2200565 c 4500</leader><controlfield tag="001">BV019880202</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090529 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050712s2005 gw d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540221476</subfield><subfield code="9">3-540-22147-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540221470</subfield><subfield code="9">978-3-540-22147-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)61219005</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019880202</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A25</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.8</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</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="084" ind1=" " ind2=" "><subfield code="a">DAT 465f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rothe, Jörg</subfield><subfield code="d">1966-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121349284</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity theory and cryptology</subfield><subfield code="b">an introduction to cryptocomplexity</subfield><subfield code="c">Jörg Rothe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 478 S.</subfield><subfield code="b">graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Texts in theoretical computer science</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity" a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptographie</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fundamentele informatica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Geheimschrift</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Protection de l'information (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer security</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptography</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-013204362</subfield></datafield></record></collection> |
id | DE-604.BV019880202 |
illustrated | Illustrated |
indexdate | 2024-07-09T20:08:15Z |
institution | BVB |
isbn | 3540221476 9783540221470 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013204362 |
oclc_num | 61219005 |
open_access_boolean | |
owner | DE-20 DE-91G DE-BY-TUM DE-824 DE-573 DE-29T DE-92 DE-634 DE-83 DE-11 |
owner_facet | DE-20 DE-91G DE-BY-TUM DE-824 DE-573 DE-29T DE-92 DE-634 DE-83 DE-11 |
physical | XI, 478 S. graph. Darst. |
publishDate | 2005 |
publishDateSearch | 2005 |
publishDateSort | 2005 |
publisher | Springer |
record_format | marc |
series2 | Texts in theoretical computer science |
spelling | Rothe, Jörg 1966- Verfasser (DE-588)121349284 aut Complexity theory and cryptology an introduction to cryptocomplexity Jörg Rothe Berlin [u.a.] Springer 2005 XI, 478 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Texts in theoretical computer science Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity" a kind of symbiosis of these two areas. This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges. Complexiteit gtt Complexité de calcul (Informatique) Cryptographie Fundamentele informatica gtt Geheimschrift gtt Protection de l'information (Informatique) Computational complexity Computer security Cryptography Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Kryptologie (DE-588)4033329-2 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s DE-604 Kryptologie (DE-588)4033329-2 s |
spellingShingle | Rothe, Jörg 1966- Complexity theory and cryptology an introduction to cryptocomplexity Complexiteit gtt Complexité de calcul (Informatique) Cryptographie Fundamentele informatica gtt Geheimschrift gtt Protection de l'information (Informatique) Computational complexity Computer security Cryptography Komplexitätstheorie (DE-588)4120591-1 gnd Kryptologie (DE-588)4033329-2 gnd |
subject_GND | (DE-588)4120591-1 (DE-588)4033329-2 |
title | Complexity theory and cryptology an introduction to cryptocomplexity |
title_auth | Complexity theory and cryptology an introduction to cryptocomplexity |
title_exact_search | Complexity theory and cryptology an introduction to cryptocomplexity |
title_full | Complexity theory and cryptology an introduction to cryptocomplexity Jörg Rothe |
title_fullStr | Complexity theory and cryptology an introduction to cryptocomplexity Jörg Rothe |
title_full_unstemmed | Complexity theory and cryptology an introduction to cryptocomplexity Jörg Rothe |
title_short | Complexity theory and cryptology |
title_sort | complexity theory and cryptology an introduction to cryptocomplexity |
title_sub | an introduction to cryptocomplexity |
topic | Complexiteit gtt Complexité de calcul (Informatique) Cryptographie Fundamentele informatica gtt Geheimschrift gtt Protection de l'information (Informatique) Computational complexity Computer security Cryptography Komplexitätstheorie (DE-588)4120591-1 gnd Kryptologie (DE-588)4033329-2 gnd |
topic_facet | Complexiteit Complexité de calcul (Informatique) Cryptographie Fundamentele informatica Geheimschrift Protection de l'information (Informatique) Computational complexity Computer security Cryptography Komplexitätstheorie Kryptologie |
work_keys_str_mv | AT rothejorg complexitytheoryandcryptologyanintroductiontocryptocomplexity |