Cryptanalysis of RSA and its variants:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boca Raton, Fl. [u.a.]
Chapman & Hall / CRC
2010
|
| Schriftenreihe: | Chapman & Hall/CRC cryptography and network security
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XVIII, 268 S. Ill., graph. Darst. |
| ISBN: | 9781420075182 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV035748896 | ||
| 003 | DE-604 | ||
| 005 | 20091026 | ||
| 007 | t | ||
| 008 | 090930s2010 xxuad|| |||| 00||| eng d | ||
| 010 | |a 2009019264 | ||
| 020 | |a 9781420075182 |c hardcover : alk. paper |9 978-1-4200-7518-2 | ||
| 035 | |a (OCoLC)181142667 | ||
| 035 | |a (DE-599)BVBBV035748896 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-29T |a DE-19 |a DE-473 |a DE-706 | ||
| 050 | 0 | |a TK5102.94 | |
| 082 | 0 | |a 005.8/2 | |
| 084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
| 100 | 1 | |a Hinek, M. Jason |e Verfasser |0 (DE-588)138915865 |4 aut | |
| 245 | 1 | 0 | |a Cryptanalysis of RSA and its variants |c M. Jason Hinek |
| 264 | 1 | |a Boca Raton, Fl. [u.a.] |b Chapman & Hall / CRC |c 2010 | |
| 300 | |a XVIII, 268 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Chapman & Hall/CRC cryptography and network security | |
| 500 | |a Includes bibliographical references and index | ||
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Telecommunication |x Security measures |x Mathematics | |
| 650 | 4 | |a Public key cryptography | |
| 650 | 4 | |a Computer security | |
| 650 | 0 | 7 | |a Kryptoanalyse |0 (DE-588)4830502-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a RSA-Verschlüsselung |0 (DE-588)4738133-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a RSA-Verschlüsselung |0 (DE-588)4738133-4 |D s |
| 689 | 0 | 1 | |a Kryptoanalyse |0 (DE-588)4830502-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018608975&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018608975 | ||
Datensatz im Suchindex
| _version_ | 1804140665627475968 |
|---|---|
| adam_text | Titel: Cryptanalysis of RSA and its variants
Autor: Hinek, M. Jason
Jahr: 2010
Contents
List of Figures xiii
List of Tables xv
Preface xvii
I Preliminaries 1
1 The RSA Cryptosystem 3
1.1 Public-Key Cryptography.................... 3
1.2 The RSA Cryptosystem..................... 4
1.3 The Security of RSA ...................... 8
1.3.1 Integer Factorization................... 8
1.3.2 Breaking RSA ...................... 9
1.3.3 Cryptanalysis of RSA.................. 10
1.3.4 The Homomorphic Property of RSA.......... 11
1.3.5 Semantic Security .................... 12
1.4 Efficiency of RSA ........................ 12
1.4.1 Prime Generation .................... 13
1.4.2 Modular Exponentiation................. 13
1.5 RSA Signature Scheme ..................... 14
1.6 Variants of RSA ......................... 14
1.7 Additional Notes......................... 16
2 Some Notation, Mathematics and Techniques 17
2.1 Some Notation.......................... 17
2.2 Some Mathematics Results ................... 19
2.3 Integer Factorization ...................... 21
2.4 Continued Fractions....................... 22
2.5 Lattices.............................. 23
2.5.1 Definitions and Basic Facts............... 24
2.5.2 LLL-Reduced Bases................... 25
2.5.3 The Shortest Vector Problem.............. 27
2.6 Solving Linear Equations .................... 28
2.6.1 Modular Linear Equations................ 31
2.7 Coppersmith s Methods..................... 33
vii
Vlll
2.7.1 Small Solutions of Modular Polynomials........ 34
2.7.1.1 Known Results for Modular Polynomials . . 39
2.7.2 Small Solutions of Integer Polynomials......... 40
2.7.2.1 Known Results for Integer Polynomials ... 42
2.7.3 Computing and Improving the Bounds......... 43
2.7.4 Assumptions for Coppersmith s Methods ....... 45
2.8 On Attacks and Proofs ..................... 46
2.9 Additional Notes......................... 47
II Cryptanalysis of RSA 49
3 Some Early Attacks 51
3.1 Common Modulus Attack.................... 51
3.2 Hastad s Broadcast Attack ................... 52
3.2.1 Common Plaintext Attack................ 53
3.2.2 Related Plaintext Attack ................ 53
3.3 Cycling Attacks ......................... 54
3.4 Additional Notes......................... 55
4 Small Public Exponent Attacks 57
4.1 Stereotyped Message Attack .................. 57
4.2 Related Message Attacks .................... 59
4.3 Random Padding Attack .................... 61
4.4 Leaking Information....................... 61
4.5 Additional Notes......................... 63
5 Small Private Exponent Attacks 65
5.1 Wiener s Continued Fraction Attack.............. 66
5.1.1 Extending Wiener s Attack............... 69
5.1.2 Wiener s Attack with Lattices.............. 70
5.1.2.1 Heuristic Approach.............. 71
5.1.2.2 Provable Approach .............. 72
5.2 Boneh and Durfee s Lattice Attacks .............. 74
5.2.1 Lattice Attack...................... 74
5.2.2 Sub-Lattice Attack.................... 79
5.2.3 Blomer and May s Attack................ 83
5.3 Effectiveness of the Attacks................... 87
5.4 Additional Notes......................... 89
6 Partial Key Exposure Attacks 91
6.1 Factoring with a Hint ...................... 91
6.2 Partially Known Private Exponent: MSBs .......... 93
6.2.1 Arbitrary Exponents................... 94
6.2.2 Full Sized Public Exponent............... 98
6.2.3 Full Sized Private Exponent............... 99
6.2.4 Effectiveness in Practice................. 105
IX
6.3 Partially Known Private Exponent: LSBs........... 106
6.3.1 Arbitrary Exponents................... 106
6.3.2 Full Sized Public Exponent............... 108
6.3.3 Full Sized Private Exponent............... 108
6.3.4 Practical Effectiveness.................. 112
6.4 Partially Known Primes..................... 113
6.4.1 Small Private Exponent Attacks............ 114
6.4.2 Partial Key Exposure Attacks.............. 115
6.4.3 Exhaustive Search Attacks ............... 116
6.5 Key Reconstruction with Random Errors ........... 117
6.6 Additional Notes......................... 118
7 More Small Private Exponent Attacks 121
7.1 Common Modulus Attack.................... 121
7.1.1 Practical Effectiveness.................. 128
7.2 Common Private Exponent Attack............... 129
7.2.1 Practical Effectiveness.................. 132
7.3 Additional Notes......................... 134
III Cryptanalysis of Variants of RSA 137
8 CRT-RSA 139
8.1 CRT-RSA ............................ 139
8.1.1 Variations of CRT-RSA................. 140
8.1.2 Efficiency of CRT-RSA ................. 141
8.1.3 Breaking CRT-RSA................... 142
8.2 Small CRT-Exponent Attacks ................. 143
8.3 Partial Key Exposure Attacks ................. 148
8.4 Key Reconstruction with Random Errors ........... 151
8.5 Additional Notes......................... 152
9 Multi-Prime RSA 155
9.1 Multi-Prime RSA ........................ 155
9.1.1 Efficiency of Multi-Prime RSA............. 157
9.1.2 Breaking Multi-Prime RSA............... 158
9.2 Factoring the Modulus ..................... 158
9.2.1 Factoring with a Hint.................. 159
9.3 Small Private Exponent Attacks ................ 161
9.4 Partial Key Exposure Attacks ................. 163
9.4.1 Partial Private Exponent: MSBs............ 164
9.4.1.1 Arbitrary Exponents.............. 164
9.4.1.2 Full Sized Public Exponent.......... 166
9.4.1.3 Full Sized Private Exponent ......... 167
9.4.1.4 Effectiveness in Practice............ 168
9.4.2 Partial Private Exponent: LSBs............. 169
9.4.2.1 Arbitrary Exponents.............. 170
9.4.2.2 Full Sized Public Exponent.......... 171
9.4.2.3 Full Sized Private Exponent ......... 171
9.4.2.4 Effectiveness in Practice............ 172
9.4.3 Known Primes...................... 172
9.4.3.1 Small Private Exponent Attack........ 172
9.4.3.2 Partially Known Private Exponent Attack . 174
9.4.4 Partial Primes ...................... 176
9.5 Common Modulus Attacks................... 176
9.5.1 Howgrave-Graham and Seifert s Attack ........ 176
9.5.1.1 Practical Effectiveness............. 178
9.5.2 Guo s Attack....................... 178
9.5.2.1 Practical Effectiveness............. 180
9.6 CRT Attacks........................... 181
9.6.1 Small CRT-Exponent Attack.............. 181
9.6.2 Partial CRT-Exponent Attack ............. 182
9.7 Additional Notes......................... 184
10 Multi-Power RSA 187
10.1 Takagi s Scheme ......................... 187
10.1.1 Efficiency of Takagi s Scheme.............. 188
10.1.2 Breaking Takagi s Scheme................ 190
10.2 Factoring the Modulus ..................... 191
10.2.1 Factoring with a Hint.................. 192
10.3 Small Private Exponent Attacks ................ 192
10.4 Partial Key Exposure Attacks ................. 194
10.5 Common Modulus Attack.................... 195
10.6 Multi-Exponent RSA...................... 196
10.6.1 Small Private Exponent Attacks............ 197
10.6.2 Partial Key Exposure Attacks.............. 198
10.7 Additional Notes......................... 200
11 Common Prime RSA 201
11.1 Common Prime RSA ...................... 201
11.1.1 Efficiency of Common Prime RSA........... 202
11.1.2 Breaking Common Prime RSA............. 203
11.2 Factoring the Modulus ..................... 203
11.2.1 Known a and b...................... 204
11.2.2 Known g ......................... 205
11.2.3 Factoring JV - 1 (or Computing g)........... 207
11.3 Small Private Exponent Attacks ................ 208
11.3.1 Wiener s Attack ..................... 209
11.3.2 Lattice-Based Attacks.................. 210
11.3.3 Known g Attacks..................... 214
11.3.4 Summary of Attacks................... 216
11.4 Small CRT-Exponent Attacks ................. 218
XI
11.5 Additional Notes......................... 219
12 Dual RSA 221
12.1 Dual RSA ............................ 221
12.2 Small Public Exponent ..................... 222
12.3 Small Private Exponent..................... 225
12.4 Dual CRT-RSA ......................... 226
12.5 Efficiency and Comparison ................... 228
12.5.1 Key Generation...................... 228
12.5.2 Space Requirements................... 229
12.6 Additional Notes......................... 230
A Distribution of g = gcd(p - 1, q - 1) 233
B Geometrically Progressive Matrices 235
C Some Algorithms 239
C.I Dual RSA ............................ 239
Further Reading 241
Bibliography 243
Index 265
List of Figures
2.1 Sylvester matrix.......................... 20
5.1 Boneh and Durfee s basis matrix................. 77
6.1 Partial key exposure attacks with known MSBs (theory). ... 94
6.2 Partial key exposure attacks with known MSBs (practice). . . 105
6.3 Partial key exposure attacks with known LSBs (theory). . . . 107
6.4 Partial key exposure attacks with known LSBs (practice). , . 112
7.1 Common private exponent attack with 2 r 5 (practice). . 133
7.2 Common private exponent attack with 10 r 35 (practice). 133
7.3 Common private exponent attack with different modulus sizes
(practice).............................. 134
8.1 Small CRT-exponent attacks (theory).............. 147
9.1 Partial key exposure attacks with known MSBs (theory) ... 165
9.2 Partial key exposure attacks with known MSBs (practice). . . 169
9.3 Partial key exposure attacks with known LSBs (theory). ... 170
9.4 Partial key exposure attacks with known LSBs (practice). . . 173
11.1 Small private exponent bounds for common prime RSA with
infinite modulus size (theory)................... 217
11.2 Small private exponent bounds for common prime RSA with
finite modulus size (theory).................... 217
12.1 Small public and CRT-exponent attacks on Dual CRT-RSA
(theory)............................... 226
XIll
List of Tables
5.1 Effectiveness of small private exponent attacks ........ 88
6.1 Effectiveness of exhaustive search attacks........... 117
7.1 Effectiveness of common modulus attack with two instances . 128
7.2 Effectiveness of common modulus attack with three instances 128
9.1 Maximum number of safe primes for multi-prime RSA .... 159
9.2 Fraction of bits required for factoring with a hint....... 161
9.3 Small private exponent bounds for multi-prime RSA..... 164
9.4 Howgrave-Graham and Seifert s common modulus attack in
practice.............................. 179
9.5 Guo s common modulus attack in practice........... 181
10.1 Number of modular exponentiations for decryption algorithms 190
10.2 Maximum number of safe primes for multi-power RSA .... 191
10.3 Small private exponent bounds for Takagi s scheme...... 193
10.4 Effectiveness of small private exponent attacks for Takagi s
scheme............................... 194
10.5 Common modulus bounds for Takagi s scheme......... 196
10.6 Effectiveness of common modulus attack for Takagi s scheme 196
10.7 Small private exponent bounds for multi-power RSA..... 198
11.1 Safe sizes for common factors.................. 208
12.1 Space requirements for standard decryption and small public
or private exponent........................ 230
12.2 Space requirements for CRT decryption with small CRT-
exponents ............................. 230
A.I Distribution of 2 g 20.................... 233
A.2 Distribution of 20 g 100................... 234
|
| any_adam_object | 1 |
| author | Hinek, M. Jason |
| author_GND | (DE-588)138915865 |
| author_facet | Hinek, M. Jason |
| author_role | aut |
| author_sort | Hinek, M. Jason |
| author_variant | m j h mj mjh |
| building | Verbundindex |
| bvnumber | BV035748896 |
| callnumber-first | T - Technology |
| callnumber-label | TK5102 |
| callnumber-raw | TK5102.94 |
| callnumber-search | TK5102.94 |
| callnumber-sort | TK 45102.94 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_rvk | ST 276 |
| ctrlnum | (OCoLC)181142667 (DE-599)BVBBV035748896 |
| dewey-full | 005.8/2 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.8/2 |
| dewey-search | 005.8/2 |
| dewey-sort | 15.8 12 |
| 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>01767nam a2200457zc 4500</leader><controlfield tag="001">BV035748896</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091026 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090930s2010 xxuad|| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2009019264</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781420075182</subfield><subfield code="c">hardcover : alk. paper</subfield><subfield code="9">978-1-4200-7518-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)181142667</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035748896</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5102.94</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.8/2</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">Hinek, M. Jason</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)138915865</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cryptanalysis of RSA and its variants</subfield><subfield code="c">M. Jason Hinek</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton, Fl. [u.a.]</subfield><subfield code="b">Chapman & Hall / CRC</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 268 S.</subfield><subfield code="b">Ill., 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">Chapman & Hall/CRC cryptography and network security</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Telecommunication</subfield><subfield code="x">Security measures</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Public key cryptography</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer security</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kryptoanalyse</subfield><subfield code="0">(DE-588)4830502-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">RSA-Verschlüsselung</subfield><subfield code="0">(DE-588)4738133-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">RSA-Verschlüsselung</subfield><subfield code="0">(DE-588)4738133-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kryptoanalyse</subfield><subfield code="0">(DE-588)4830502-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</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=018608975&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-018608975</subfield></datafield></record></collection> |
| id | DE-604.BV035748896 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:03:35Z |
| institution | BVB |
| isbn | 9781420075182 |
| language | English |
| lccn | 2009019264 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018608975 |
| oclc_num | 181142667 |
| open_access_boolean | |
| owner | DE-29T DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-706 |
| owner_facet | DE-29T DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-706 |
| physical | XVIII, 268 S. Ill., graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Chapman & Hall / CRC |
| record_format | marc |
| series2 | Chapman & Hall/CRC cryptography and network security |
| spelling | Hinek, M. Jason Verfasser (DE-588)138915865 aut Cryptanalysis of RSA and its variants M. Jason Hinek Boca Raton, Fl. [u.a.] Chapman & Hall / CRC 2010 XVIII, 268 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Chapman & Hall/CRC cryptography and network security Includes bibliographical references and index Mathematik Telecommunication Security measures Mathematics Public key cryptography Computer security Kryptoanalyse (DE-588)4830502-9 gnd rswk-swf RSA-Verschlüsselung (DE-588)4738133-4 gnd rswk-swf RSA-Verschlüsselung (DE-588)4738133-4 s Kryptoanalyse (DE-588)4830502-9 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018608975&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hinek, M. Jason Cryptanalysis of RSA and its variants Mathematik Telecommunication Security measures Mathematics Public key cryptography Computer security Kryptoanalyse (DE-588)4830502-9 gnd RSA-Verschlüsselung (DE-588)4738133-4 gnd |
| subject_GND | (DE-588)4830502-9 (DE-588)4738133-4 |
| title | Cryptanalysis of RSA and its variants |
| title_auth | Cryptanalysis of RSA and its variants |
| title_exact_search | Cryptanalysis of RSA and its variants |
| title_full | Cryptanalysis of RSA and its variants M. Jason Hinek |
| title_fullStr | Cryptanalysis of RSA and its variants M. Jason Hinek |
| title_full_unstemmed | Cryptanalysis of RSA and its variants M. Jason Hinek |
| title_short | Cryptanalysis of RSA and its variants |
| title_sort | cryptanalysis of rsa and its variants |
| topic | Mathematik Telecommunication Security measures Mathematics Public key cryptography Computer security Kryptoanalyse (DE-588)4830502-9 gnd RSA-Verschlüsselung (DE-588)4738133-4 gnd |
| topic_facet | Mathematik Telecommunication Security measures Mathematics Public key cryptography Computer security Kryptoanalyse RSA-Verschlüsselung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018608975&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hinekmjason cryptanalysisofrsaanditsvariants |