Group-based cryptography:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Basel [u.a.]
Birkhäuser
2008
|
| Schriftenreihe: | Advanced Courses in Mathematics - CRM Barcelona
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XV, 183 S. graph. Darst. |
| ISBN: | 9783764388263 3764388269 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023329597 | ||
| 003 | DE-604 | ||
| 005 | 20090212 | ||
| 007 | t | ||
| 008 | 080605s2008 d||| |||| 00||| eng d | ||
| 015 | |a 08,N15,0384 |2 dnb | ||
| 016 | 7 | |a 988023997 |2 DE-101 | |
| 020 | |a 9783764388263 |c Pb. : EUR 31.99 (freier Pr.), sfr 52.90 (freier Pr.) |9 978-3-7643-8826-3 | ||
| 020 | |a 3764388269 |c Pb. : EUR 31.99 (freier Pr.), sfr 52.90 (freier Pr.) |9 3-7643-8826-9 | ||
| 024 | 3 | |a 9783764388263 | |
| 028 | 5 | 2 | |a 12249701 |
| 035 | |a (OCoLC)226281300 | ||
| 035 | |a (DE-599)DNB988023997 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-91G |a DE-29T |a DE-355 |a DE-83 |a DE-11 |a DE-739 |a DE-20 | ||
| 050 | 0 | |a QA182.5 | |
| 082 | 0 | |a 512/.2 |2 22 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a SK 260 |0 (DE-625)143227: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a MAT 050f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a MAT 209f |2 stub | ||
| 084 | |a DAT 465f |2 stub | ||
| 100 | 1 | |a Myasnikov, Alexei |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Group-based cryptography |c Alexei Myasnikov ; Vladimir Shpilrain ; Alexander Ushakov |
| 264 | 1 | |a Basel [u.a.] |b Birkhäuser |c 2008 | |
| 300 | |a XV, 183 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Advanced Courses in Mathematics - CRM Barcelona | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorial group theory | |
| 650 | 4 | |a Cryptography | |
| 650 | 0 | 7 | |a Public-Key-Kryptosystem |0 (DE-588)4209133-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Gruppentheorie |0 (DE-588)4219556-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Public-Key-Kryptosystem |0 (DE-588)4209133-0 |D s |
| 689 | 0 | 1 | |a Kombinatorische Gruppentheorie |0 (DE-588)4219556-1 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Shpilrain, Vladimir |e Verfasser |4 aut | |
| 700 | 1 | |a Ušakov, Aleksandr A. |d 1946- |e Verfasser |0 (DE-588)118900269 |4 aut | |
| 856 | 4 | 2 | |m Digitalisierung UB Regensburg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513549&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016513549 | ||
Datensatz im Suchindex
| _version_ | 1804137672365572096 |
|---|---|
| adam_text | Contents
Preface
xi
Introduction
xiii
I Background on Groups, Complexity, and Cryptography
1
1
Background on Public Key Cryptography
3
1.1
From key establishment to encryption
................ 4
1.2
The Diffie-Hellman key establishment
................ 5
1.3
The ElGamal cryptosystem
...................... 6
1.4
Authentication
............................. 7
2
Background on Combinatorial Group Theory
9
2.1
Basic definitions and notation
..................... 9
2.2
Presentations of groups by generators and
relatore
......... 11
2.3
Algorithmic problems of group theory
................ 11
2.3.1
The word problem
....................... 11
2.3.2
The conjugacy problem
.................... 12
2.3.3
The decomposition and factorization problems
....... 12
2.3.4
The membership problem
................... 13
2.3.
δ
The isomorphism problem
................... 14
2.4
Nielsen s and Schreier s methods
................... 14
2.5
Tietze s method
............................. 16
2.6
Normal forms
.............................. 17
3
Background on Computational Complexity
19
3.1
Algorithms
............................... 19
3.1.1
Deterministic Turing machines
................ 19
3.1.2
Non-deterministic Turing machines
.............. 20
3.1.3
Probabilistic Turing machines
................. 21
3.2
Computational problems
........................ 21
3.2.1
Decision and search computational problems
........ 21
Contents
3.2.2
Size functions
.......................... 23
3.2.3
Stratification
..........................
25
3.2.4
Reductions and complete problems
.............. 26
3.2.5
Many-one reductions
...................... 27
3.2.6
Turing reductions
........................ 27
3.3
The worst case complexity
....................... 28
3.3.1
Complexity classes
....................... 28
3.3.2
Class NP
............................ 29
3.3.3
Polynomial-time many-one reductions and class NP
.... 30
3.3.4
NP-complete problems
.................... 31
3.3.5
Deficiency of the worst case complexity
........... 33
II Non-commutative Cryptography
35
4
Canonical Non-commutative Cryptography
37
4.1
Protocols based on the conjugacy search problem
.......... 37
4.2
Protocols based on the decomposition problem
........... 39
4.2.1
Twisted protocol
....................... 40
4.2.2
Hiding one of the subgroups
.................. 41
4.2.3
Using the triple decomposition problem
........... 42
4.3
A protocol based on the factorization search problem
........ 43
4.4
Stickel s key exchange protocol
.................... 43
4.4.1
Linear algebra attack
..................... 45
4.5
The Anshel-Anshel-Goldfeld protocol
................. 47
4.6
Authentication protocols based on the conjugacy problem
..... 49
4.6.1
A Diffie-Hellman-like scheme
................. 49
4.6.2
A Fiat-Shamir-like scheme
................... 50
4.6.3
An authentication scheme based on the twisted conjugacy
problem
............................. 51
4.7
Relations between different problems
................. 52
5
Platform Groups
55
5.1
Braid groups
.............................. 55
5.1.1
A group of braids and its presentation
............ 56
5.1.2
Dehomoy handle free form
.................. 59
5.1.3
Garside normal form
...................... 60
5.2
Thompson s group
........................... 61
5.3
Groups of matrices
........................... 65
5.4
Small cancellation groups
....................... 67
5.4.1
Dehn s algorithm
........................ 67
5.5
Solvable groups
............................. 68
5.5.1
Normal forms in free metabelian groups
........... 68
5.6 Artin
groups
.............................. 71
Contents ix
5.7
Grigorchuk s group
........................... 72
6
Using Decision Problems in Public Key Cryptography
77
6.1
The Shpilrain-Zapata scheme
..................... 78
6.1.1
The protocol
.......................... 78
6.1.2
Pool of group presentations
.................. 81
6.1.3
Tietze transformations: elementary isomorphisms
...... 82
6.1.4
Generating random elements in finitely presented groups
. . 84
6.1.5
Isomorphism attack
...................... 87
6.1.6
Quotient attack
......................... 88
6.2
Public key encryption and encryption emulation attacks
...... 89
III Generic Complexity and Cryptanalysis
95
7
Distributional Problems and the Average Case Complexity
99
7.1
Distributional computational problems
................ 99
7.1.1
Distributions and computational problems
.......... 99
7.1.2
Stratified problems with ensembles of distributions
..... 101
7.1.3
Randomized many-one reductions
.............. 102
7.2
Average case complexity
........................ 103
7.2.1
Polynomial on average functions
............... 103
7.2.2
Average case behavior of functions
.............. 109
7.2.3
Average case complexity of algorithms
............ 109
7.2.4
Average case vs worst case
.................. 110
7.2.5
Average case behavior as a trade-off
.............
Ill
7.2.6
Deficiency of average case complexity
............ 114
8
Generic Case Complexity
117
8.1
Generic Complexity
.......................... 117
8.1.1
Generic sets
........................... 117
8.1.2
Asymptotic density
....................... 118
8.1.3
Convergence rates
....................... 120
8.1.4
Generic complexity of algorithms and algorithmic problems
121
8.1.5
Deficiency of the generic complexity
............. 122
8.2
Generic- versus average case complexity
............... 123
8.2.1
Comparing generic and average case complexities
...... 123
8.2.2
When average polynomial time implies generic polynomial
time
............................... 124
8.2.3
When generically easy implies easy on average
....... 125
x
Contents
9
Generic Complexity of NP-complete Problems
129
9.1
The linear generic time complexity of subset sum problem
..... 129
9.2
A practical algorithm for subset sum problem
............ 131
9.3
3-Satisfiability
.............................. 131
IV Asymptotically Dominant Properties and Cryptanalysis
135
10
Asymptotically Dominant Properties
139
10.1
A brief description
........................... 139
10.2
Random subgroups and generating tuples
.............. 141
10.3
Asymptotic properties of subgroups
.................. 142
10.4
Groups with generic free basis property
............... 143
10.5
Quasi-isometrically embedded subgroups
............... 145
11
Length-Based and Quotient Attacks
149
11.1
Anshel-Anshel-Goldfeld scheme
.................... 149
11.1.1
Description of the Anshel-Anshel-Goldfeld scheme
..... 149
11.1.2
Security assumptions of the AAG scheme
.......... 150
11.2
Length-based attacks
.......................... 152
11.2.1
A general description
...................... 152
11.2.2
LBA
in free groups
....................... 155
11.2.3
LBA
in groups from TBexv
.................. 156
11.3
Computing the geodesic length in a subgroup
............ 157
11.3.1
Related algorithmic problems
................. 158
11.3.2
Geodesic length in braid groups
................ 159
11.4
Quotient attacks
............................ 161
11.4.1
Membership problems in free groups
............. 162
11.4.2
Conjugacy problems in free groups
.............. 164
11.4.3
The MSP and SCSP* problems in groups with good quo¬
tients
.............................. 167
Bibliography
169
Abbreviations and Notation
179
Index
181
|
| adam_txt |
Contents
Preface
xi
Introduction
xiii
I Background on Groups, Complexity, and Cryptography
1
1
Background on Public Key Cryptography
3
1.1
From key establishment to encryption
. 4
1.2
The Diffie-Hellman key establishment
. 5
1.3
The ElGamal cryptosystem
. 6
1.4
Authentication
. 7
2
Background on Combinatorial Group Theory
9
2.1
Basic definitions and notation
. 9
2.2
Presentations of groups by generators and
relatore
. 11
2.3
Algorithmic problems of group theory
. 11
2.3.1
The word problem
. 11
2.3.2
The conjugacy problem
. 12
2.3.3
The decomposition and factorization problems
. 12
2.3.4
The membership problem
. 13
2.3.
δ
The isomorphism problem
. 14
2.4
Nielsen's and Schreier's methods
. 14
2.5
Tietze's method
. 16
2.6
Normal forms
. 17
3
Background on Computational Complexity
19
3.1
Algorithms
. 19
3.1.1
Deterministic Turing machines
. 19
3.1.2
Non-deterministic Turing machines
. 20
3.1.3
Probabilistic Turing machines
. 21
3.2
Computational problems
. 21
3.2.1
Decision and search computational problems
. 21
Contents
3.2.2
Size functions
. 23
3.2.3
Stratification
.
25
3.2.4
Reductions and complete problems
. 26
3.2.5
Many-one reductions
. 27
3.2.6
Turing reductions
. 27
3.3
The worst case complexity
. 28
3.3.1
Complexity classes
. 28
3.3.2
Class NP
. 29
3.3.3
Polynomial-time many-one reductions and class NP
. 30
3.3.4
NP-complete problems
. 31
3.3.5
Deficiency of the worst case complexity
. 33
II Non-commutative Cryptography
35
4
Canonical Non-commutative Cryptography
37
4.1
Protocols based on the conjugacy search problem
. 37
4.2
Protocols based on the decomposition problem
. 39
4.2.1
"Twisted" protocol
. 40
4.2.2
Hiding one of the subgroups
. 41
4.2.3
Using the triple decomposition problem
. 42
4.3
A protocol based on the factorization search problem
. 43
4.4
Stickel's key exchange protocol
. 43
4.4.1
Linear algebra attack
. 45
4.5
The Anshel-Anshel-Goldfeld protocol
. 47
4.6
Authentication protocols based on the conjugacy problem
. 49
4.6.1
A Diffie-Hellman-like scheme
. 49
4.6.2
A Fiat-Shamir-like scheme
. 50
4.6.3
An authentication scheme based on the twisted conjugacy
problem
. 51
4.7
Relations between different problems
. 52
5
Platform Groups
55
5.1
Braid groups
. 55
5.1.1
A group of braids and its presentation
. 56
5.1.2
Dehomoy handle free form
. 59
5.1.3
Garside normal form
. 60
5.2
Thompson's group
. 61
5.3
Groups of matrices
. 65
5.4
Small cancellation groups
. 67
5.4.1
Dehn's algorithm
. 67
5.5
Solvable groups
. 68
5.5.1
Normal forms in free metabelian groups
. 68
5.6 Artin
groups
. 71
Contents ix
5.7
Grigorchuk's group
. 72
6
Using Decision Problems in Public Key Cryptography
77
6.1
The Shpilrain-Zapata scheme
. 78
6.1.1
The protocol
. 78
6.1.2
Pool of group presentations
. 81
6.1.3
Tietze transformations: elementary isomorphisms
. 82
6.1.4
Generating random elements in finitely presented groups
. . 84
6.1.5
Isomorphism attack
. 87
6.1.6
Quotient attack
. 88
6.2
Public key encryption and encryption emulation attacks
. 89
III Generic Complexity and Cryptanalysis
95
7
Distributional Problems and the Average Case Complexity
99
7.1
Distributional computational problems
. 99
7.1.1
Distributions and computational problems
. 99
7.1.2
Stratified problems with ensembles of distributions
. 101
7.1.3
Randomized many-one reductions
. 102
7.2
Average case complexity
. 103
7.2.1
Polynomial on average functions
. 103
7.2.2
Average case behavior of functions
. 109
7.2.3
Average case complexity of algorithms
. 109
7.2.4
Average case vs worst case
. 110
7.2.5
Average case behavior as a trade-off
.
Ill
7.2.6
Deficiency of average case complexity
. 114
8
Generic Case Complexity
117
8.1
Generic Complexity
. 117
8.1.1
Generic sets
. 117
8.1.2
Asymptotic density
. 118
8.1.3
Convergence rates
. 120
8.1.4
Generic complexity of algorithms and algorithmic problems
121
8.1.5
Deficiency of the generic complexity
. 122
8.2
Generic- versus average case complexity
. 123
8.2.1
Comparing generic and average case complexities
. 123
8.2.2
When average polynomial time implies generic polynomial
time
. 124
8.2.3
When generically easy implies easy on average
. 125
x
Contents
9
Generic Complexity of NP-complete Problems
129
9.1
The linear generic time complexity of subset sum problem
. 129
9.2
A practical algorithm for subset sum problem
. 131
9.3
3-Satisfiability
. 131
IV Asymptotically Dominant Properties and Cryptanalysis
135
10
Asymptotically Dominant Properties
139
10.1
A brief description
. 139
10.2
Random subgroups and generating tuples
. 141
10.3
Asymptotic properties of subgroups
. 142
10.4
Groups with generic free basis property
. 143
10.5
Quasi-isometrically embedded subgroups
. 145
11
Length-Based and Quotient Attacks
149
11.1
Anshel-Anshel-Goldfeld scheme
. 149
11.1.1
Description of the Anshel-Anshel-Goldfeld scheme
. 149
11.1.2
Security assumptions of the AAG scheme
. 150
11.2
Length-based attacks
. 152
11.2.1
A general description
. 152
11.2.2
LBA
in free groups
. 155
11.2.3
LBA
in groups from TBexv
. 156
11.3
Computing the geodesic length in a subgroup
. 157
11.3.1
Related algorithmic problems
. 158
11.3.2
Geodesic length in braid groups
. 159
11.4
Quotient attacks
. 161
11.4.1
Membership problems in free groups
. 162
11.4.2
Conjugacy problems in free groups
. 164
11.4.3
The MSP and SCSP* problems in groups with "good" quo¬
tients
. 167
Bibliography
169
Abbreviations and Notation
179
Index
181 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Myasnikov, Alexei Shpilrain, Vladimir Ušakov, Aleksandr A. 1946- |
| author_GND | (DE-588)118900269 |
| author_facet | Myasnikov, Alexei Shpilrain, Vladimir Ušakov, Aleksandr A. 1946- |
| author_role | aut aut aut |
| author_sort | Myasnikov, Alexei |
| author_variant | a m am v s vs a a u aa aau |
| building | Verbundindex |
| bvnumber | BV023329597 |
| callnumber-first | Q - Science |
| callnumber-label | QA182 |
| callnumber-raw | QA182.5 |
| callnumber-search | QA182.5 |
| callnumber-sort | QA 3182.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 170 SK 260 ST 134 |
| classification_tum | MAT 050f DAT 517f MAT 209f DAT 465f |
| ctrlnum | (OCoLC)226281300 (DE-599)DNB988023997 |
| dewey-full | 512/.2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512/.2 |
| dewey-search | 512/.2 |
| dewey-sort | 3512 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02404nam a2200601 c 4500</leader><controlfield tag="001">BV023329597</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090212 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080605s2008 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N15,0384</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">988023997</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783764388263</subfield><subfield code="c">Pb. : EUR 31.99 (freier Pr.), sfr 52.90 (freier Pr.)</subfield><subfield code="9">978-3-7643-8826-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3764388269</subfield><subfield code="c">Pb. : EUR 31.99 (freier Pr.), sfr 52.90 (freier Pr.)</subfield><subfield code="9">3-7643-8826-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783764388263</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12249701</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)226281300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB988023997</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA182.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512/.2</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 260</subfield><subfield code="0">(DE-625)143227:</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">MAT 050f</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="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 209f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 465f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Myasnikov, Alexei</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Group-based cryptography</subfield><subfield code="c">Alexei Myasnikov ; Vladimir Shpilrain ; Alexander Ushakov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Basel [u.a.]</subfield><subfield code="b">Birkhäuser</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 183 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">Advanced Courses in Mathematics - CRM Barcelona</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial group theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptography</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Gruppentheorie</subfield><subfield code="0">(DE-588)4219556-1</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">Kombinatorische Gruppentheorie</subfield><subfield code="0">(DE-588)4219556-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shpilrain, Vladimir</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ušakov, Aleksandr A.</subfield><subfield code="d">1946-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118900269</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Regensburg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513549&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016513549</subfield></datafield></record></collection> |
| id | DE-604.BV023329597 |
| illustrated | Illustrated |
| index_date | 2024-07-02T20:57:06Z |
| indexdate | 2024-07-09T21:16:01Z |
| institution | BVB |
| isbn | 9783764388263 3764388269 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016513549 |
| oclc_num | 226281300 |
| open_access_boolean | |
| owner | DE-703 DE-91G DE-BY-TUM DE-29T DE-355 DE-BY-UBR DE-83 DE-11 DE-739 DE-20 |
| owner_facet | DE-703 DE-91G DE-BY-TUM DE-29T DE-355 DE-BY-UBR DE-83 DE-11 DE-739 DE-20 |
| physical | XV, 183 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Birkhäuser |
| record_format | marc |
| series2 | Advanced Courses in Mathematics - CRM Barcelona |
| spelling | Myasnikov, Alexei Verfasser aut Group-based cryptography Alexei Myasnikov ; Vladimir Shpilrain ; Alexander Ushakov Basel [u.a.] Birkhäuser 2008 XV, 183 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Advanced Courses in Mathematics - CRM Barcelona Algorithms Combinatorial group theory Cryptography Public-Key-Kryptosystem (DE-588)4209133-0 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Kombinatorische Gruppentheorie (DE-588)4219556-1 gnd rswk-swf Public-Key-Kryptosystem (DE-588)4209133-0 s Kombinatorische Gruppentheorie (DE-588)4219556-1 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Shpilrain, Vladimir Verfasser aut Ušakov, Aleksandr A. 1946- Verfasser (DE-588)118900269 aut Digitalisierung UB Regensburg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513549&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Myasnikov, Alexei Shpilrain, Vladimir Ušakov, Aleksandr A. 1946- Group-based cryptography Algorithms Combinatorial group theory Cryptography Public-Key-Kryptosystem (DE-588)4209133-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Kombinatorische Gruppentheorie (DE-588)4219556-1 gnd |
| subject_GND | (DE-588)4209133-0 (DE-588)4134751-1 (DE-588)4219556-1 |
| title | Group-based cryptography |
| title_auth | Group-based cryptography |
| title_exact_search | Group-based cryptography |
| title_exact_search_txtP | Group-based cryptography |
| title_full | Group-based cryptography Alexei Myasnikov ; Vladimir Shpilrain ; Alexander Ushakov |
| title_fullStr | Group-based cryptography Alexei Myasnikov ; Vladimir Shpilrain ; Alexander Ushakov |
| title_full_unstemmed | Group-based cryptography Alexei Myasnikov ; Vladimir Shpilrain ; Alexander Ushakov |
| title_short | Group-based cryptography |
| title_sort | group based cryptography |
| topic | Algorithms Combinatorial group theory Cryptography Public-Key-Kryptosystem (DE-588)4209133-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Kombinatorische Gruppentheorie (DE-588)4219556-1 gnd |
| topic_facet | Algorithms Combinatorial group theory Cryptography Public-Key-Kryptosystem Berechnungskomplexität Kombinatorische Gruppentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016513549&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT myasnikovalexei groupbasedcryptography AT shpilrainvladimir groupbasedcryptography AT usakovaleksandra groupbasedcryptography |