Introduction to modern cryptography:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Boca Raton, Fla. [u.a.]
Chapman & Hall / CRC
2008
|
| Series: | Chapman & Hall, CRC cryptography and network security
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XVIII, 534 S. graph. Darst. |
| ISBN: | 9781584885511 |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV022719679 | ||
| 003 | DE-604 | ||
| 005 | 20170906 | ||
| 007 | t | ||
| 008 | 070906s2008 xxud||| |||| 00||| eng d | ||
| 010 | |a 2007017861 | ||
| 016 | 7 | |a LO 2007017861 |2 DE-101 | |
| 020 | |a 9781584885511 |9 978-1-58488-551-1 | ||
| 035 | |a (OCoLC)137325053 | ||
| 035 | |a (DE-599)DNB 2007017861 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-703 |a DE-1051 |a DE-20 |a DE-634 |a DE-29T |a DE-898 |a DE-11 |a DE-91G |a DE-739 |a DE-188 |a DE-355 |a DE-1046 |a DE-83 |a DE-384 | ||
| 050 | 0 | |a QA76.9.A25 | |
| 082 | 0 | |a 005.8 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
| 084 | |a DAT 465f |2 stub | ||
| 100 | 1 | |a Katz, Jonathan |d 1974- |e Verfasser |0 (DE-588)133268101 |4 aut | |
| 245 | 1 | 0 | |a Introduction to modern cryptography |c Jonathan Katz ; Yehuda Lindell |
| 264 | 1 | |a Boca Raton, Fla. [u.a.] |b Chapman & Hall / CRC |c 2008 | |
| 300 | |a XVIII, 534 S. |b 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 | |
| 650 | 4 | |a Cryptographie | |
| 650 | 4 | |a Sécurité informatique | |
| 650 | 4 | |a Computer security | |
| 650 | 4 | |a Cryptography | |
| 650 | 0 | 7 | |a Kryptologie |0 (DE-588)4033329-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Kryptologie |0 (DE-588)4033329-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Lindell, Yehuda |d 1971- |e Verfasser |0 (DE-588)1031893946 |4 aut | |
| 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=015925422&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015925422 | ||
Record in the Search Index
| _version_ | 1804136944304652288 |
|---|---|
| adam_text | Contents
I Introduction and Classical Cryptography 1
1 Introduction 3
1.1 Cryptography and Modern Cryptography 3
1.2 The Setting of Private Key Encryption 4
1.3 Historical Ciphers and Their Cryptanalysis 9
1.4 The Basic Principles of Modern Cryptography 18
1.4.1 Principle 1 Formulation of Exact Definitions .... 18
1.4.2 Principle 2 Reliance on Precise Assumptions .... 24
1.4.3 Principle 3 Rigorous Proofs of Security 26
References and Additional Reading 27
Exercises 27
2 Perfectly Secret Encryption 29
2.1 Definitions and Basic Properties 29
2.2 The One Time Pad (Vernam s Cipher) 34
2.3 Limitations of Perfect Secrecy 36
2.4 * Shannon s Theorem 37
2.5 Summary 40
References and Additional Reading 40
Exercises 41
II Private Key (Symmetric) Cryptography 45
3 Private Key Encryption and Pseudorandomness 47
3.1 A Computational Approach to Cryptography 47
3.1.1 The Basic Idea of Computational Security 48
3.1.2 Efficient Algorithms and Negligible Success Probability 54
3.1.3 Proofs by Reduction 58
3.2 Defining Computationally Secure Encryption 60
3.2.1 The Basic Definition of Security 61
3.2.2 * Properties of the Definition 64
3.3 Pseudorandomness 69
3.4 Constructing Secure Encryption Schemes 72
3.4.1 A Secure Fixed Length Encryption Scheme 72
3.4.2 Handling Variable Length Messages 76
3.4.3 Stream Ciphers and Multiple Encryptions 77
xiii
xiv
3.5 Security Against Chosen Plaintext Attacks (CPA) 82
3.6 Constructing CPA Secure Encryption Schemes 85
3.6.1 Pseudorandom Functions 86
3.6.2 CPA Secure Encryption from Pseudorandom Functions 89
3.6.3 Pseudorandom Permutations and Block Ciphers ... 94
3.6.4 Modes of Operation 96
3.7 Security Against Chosen Ciphertext Attacks (CCA) 103
References and Additional Reading 105
Exercises 106
4 Message Authentication Codes and Collision Resistant Hash
Functions 111
4.1 Secure Communication and Message Integrity Ill
4.2 Encryption vs. Message Authentication 112
4.3 Message Authentication Codes Definitions 114
4.4 Constructing Secure Message Authentication Codes 118
4.5 CBC MAC 125
4.6 Collision Resistant Hash Functions 127
4.6.1 Defining Collision Resistance 128
4.6.2 Weaker Notions of Security for Hash Functions .... 130
4.6.3 A Generic Birthday Attack 131
4.6.4 The Merkle Damgard Transform 133
4.6.5 Collision Resistant Hash Functions in Practice .... 136
4.7 * NMAC and HMAC 138
4.7.1 Nested MAC (NMAC) 138
4.7.2 HMAC 141
4.8 * Constructing CCA Secure Encryption Schemes 144
4.9 * Obtaining Privacy and Message Authentication 148
References and Additional Reading 154
Exercises 155
5 Practical Constructions of Pseudorandom Permutations (Block
Ciphers) 159
5.1 Substitution Permutation Networks 162
5.2 Feistel Networks 170
5.3 DES The Data Encryption Standard 173
5.3.1 The Design of DES 173
5.3.2 Attacks on Reduced Round Variants of DES 176
5.3.3 The Security of DES 179
5.4 Increasing the Key Length of a Block Cipher 181
5.5 AES The Advanced Encryption Standard 185
5.6 Differential and Linear Cryptanalysis A Brief Look .... 187
Additional Reading and References 189
Exercises 189
XV
6 * Theoretical Constructions of Pseudorandom Objects 193
6.1 One Way Functions 194
6.1.1 Definitions 194
6.1.2 Candidate One Way Functions 197
6.1.3 Hard Core Predicates 198
6.2 Overview: From One Way Functions to Pseudorandomness . 200
6.3 A Hard Core Predicate for Any One Way Function 202
6.3.1 A Simple Case 202
6.3.2 A More Involved Case 203
6.3.3 The Full Proof 208
6.4 Constructing Pseudorandom Generators 213
6.4.1 Pseudorandom Generators with Minimal Expansion . 214
6.4.2 Increasing the Expansion Factor 215
6.5 Constructing Pseudorandom Functions 221
6.6 Constructing (Strong) Pseudorandom Permutations 225
6.7 Necessary Assumptions for Private Key Cryptography .... 227
6.8 A Digression Computational Indistinguishability 232
6.8.1 Pseudorandomness and Pseudorandom Generators . . 233
6.8.2 Multiple Samples 234
References and Additional Reading 237
Exercises 237
III Public Key (Asymmetric) Cryptography 241
7 Number Theory and Cryptographic Hardness Assumptions 243
7.1 Preliminaries and Basic Group Theory 245
7.1.1 Primes and Divisibility 246
7.1.2 Modular Arithmetic 248
7.1.3 Groups 250
7.1.4 The Group Z*N 254
7.1.5 * Isomorphisms and the Chinese Remainder Theorem 256
7.2 Primes, Factoring, and RSA 261
7.2.1 Generating Random Primes 262
7.2.2 * Primality Testing 265
7.2.3 The Factoring Assumption 271
7.2.4 The RSA Assumption 271
7.3 Assumptions in Cyclic Groups 274
7.3.1 Cyclic Groups and Generators 274
7.3.2 The Discrete Logarithm and Dime Hellman Assump¬
tions 277
7.3.3 Working in (Subgroups of) Z^ 281
7.3.4 * Elliptic Curve Groups 282
7.4 Cryptographic Applications of Number Theoretic Assumptions 287
7.4.1 One Way Functions and Permutations 287
7.4.2 Constructing Collision Resistant Hash Functions . . . 290
xvi
References and Additional Reading 293
Exercises 294
8 * Factoring and Computing Discrete Logarithms 297
8.1 Algorithms for Factoring 297
8.1.1 Pollard sp 1 Method 298
8.1.2 Pollard s Rho Method 301
8.1.3 The Quadratic Sieve Algorithm 303
8.2 Algorithms for Computing Discrete Logarithms 305
8.2.1 The Baby Step/Giant Step Algorithm 307
8.2.2 The Pohlig Hellman Algorithm 309
8.2.3 The Discrete Logarithm Problem in ZjV 310
8.2.4 The Index Calculus Method 311
References and Additional Reading 313
Exercises 314
9 Private Key Management and the Public Key Revolution 315
9.1 Limitations of Private Key Cryptography 315
9.2 A Partial Solution Key Distribution Centers 317
9.3 The Public Key Revolution 320
9.4 Diffie Hellman Key Exchange 324
References and Additional Reading 330
Exercises 331
10 Public Key Encryption 333
10.1 Public Key Encryption An Overview 333
10.2 Definitions 336
10.2.1 Security against Chosen Plaintext Attacks 337
10.2.2 Multiple Encryptions 340
10.3 Hybrid Encryption 347
10.4 RSA Encryption 355
10.4.1 Textbook RSA and its Insecurity 355
10.4.2 Attacks on Textbook RSA 359
10.4.3 Padded RSA 362
10.5 The El Gamal Encryption Scheme 364
10.6 Security Against Chosen Ciphertext Attacks 369
10.7 * Trapdoor Permutations 373
10.7.1 Definition 374
10.7.2 Public Key Encryption from Trapdoor Permutations . 375
References and Additional Reading 378
Exercises 379
xvii
11 * Additional Public Key Encryption Schemes 385
11.1 The Goldwasser Micali Encryption Scheme 386
11.1.1 Quadratic Residues Modulo a Prime 386
11.1.2 Quadratic Residues Modulo a Composite 389
11.1.3 The Quadratic Residuosity Assumption 392
11.1.4 The Goldwasser Micali Encryption Scheme 394
11.2 The Rabin Encryption Scheme 397
11.2.1 Computing Modular Square Roots 397
11.2.2 A Trapdoor Permutation Based on Factoring 402
11.2.3 The Rabin Encryption Scheme 406
11.3 The Paillier Encryption Scheme 408
11.3.1 The Structure of Z*m 409
11.3.2 The Paillier Encryption Scheme 411
11.3.3 Homomorphic Encryption 416
References and Additional Reading 418
Exercises 418
12 Digital Signature Schemes 421
12.1 Digital Signatures An Overview 421
12.2 Definitions 423
12.3 RSA Signatures 426
12.3.1 Textbook RSA and its Insecurity 426
12.3.2 Hashed RSA 428
12.4 The Hash and Sign Paradigm 429
12.5 Lamport s One Time Signature Scheme 432
12.6 * Signatures from Collision Resistant Hashing 435
12.6.1 Chain Based Signatures 436
12.6.2 Tree Based Signatures 439
12.7 The Digital Signature Standard (DSS) 445
12.8 Certificates and Public Key Infrastructures 446
References and Additional Reading 453
Exercises 454
13 Public Key Cryptosystems in the Random Oracle Model 457
13.1 The Random Oracle Methodology 458
13.1.1 The Random Oracle Model in Detail 459
13.1.2 Is the Random Oracle Methodology Sound? 465
13.2 Public Key Encryption in the Random Oracle Model .... 469
13.2.1 Security Against Chosen Plaintext Attacks 469
13.2.2 Security Against Chosen Ciphertext Attacks 473
13.2.3 OAEP 479
13.3 Signatures in the Random Oracle Model 481
References and Additional Reading 486
Exercises 486
xviii
Index of Common Notation 489
A Mathematical Background 493
A.I Identities and Inequalities 493
A.2 Asymptotic Notation 493
A.3 Basic Probability 494
A.4 The Birthday Problem 496
B Supplementary Algorithmic Number Theory 499
B.I Integer Arithmetic 501
B.I.I Basic Operations 501
B.I.2 The Euclidean and Extended Euclidean Algorithms . 502
B.2 Modular Arithmetic 504
B.2.1 Basic Operations 504
B.2.2 Computing Modular Inverses 505
B.2.3 Modular Exponentiation 505
B.2.4 Choosing a Random Group Element 508
B.3 * Finding a Generator of a Cyclic Group 512
B.3.1 Group Theoretic Background 512
B.3.2 Efficient Algorithms 513
References and Additional Reading 515
Exercises 515
References 517
Index 529
|
| adam_txt |
Contents
I Introduction and Classical Cryptography 1
1 Introduction 3
1.1 Cryptography and Modern Cryptography 3
1.2 The Setting of Private Key Encryption 4
1.3 Historical Ciphers and Their Cryptanalysis 9
1.4 The Basic Principles of Modern Cryptography 18
1.4.1 Principle 1 Formulation of Exact Definitions . 18
1.4.2 Principle 2 Reliance on Precise Assumptions . 24
1.4.3 Principle 3 Rigorous Proofs of Security 26
References and Additional Reading 27
Exercises 27
2 Perfectly Secret Encryption 29
2.1 Definitions and Basic Properties 29
2.2 The One Time Pad (Vernam's Cipher) 34
2.3 Limitations of Perfect Secrecy 36
2.4 * Shannon's Theorem 37
2.5 Summary 40
References and Additional Reading 40
Exercises 41
II Private Key (Symmetric) Cryptography 45
3 Private Key Encryption and Pseudorandomness 47
3.1 A Computational Approach to Cryptography 47
3.1.1 The Basic Idea of Computational Security 48
3.1.2 Efficient Algorithms and Negligible Success Probability 54
3.1.3 Proofs by Reduction 58
3.2 Defining Computationally Secure Encryption 60
3.2.1 The Basic Definition of Security 61
3.2.2 * Properties of the Definition 64
3.3 Pseudorandomness 69
3.4 Constructing Secure Encryption Schemes 72
3.4.1 A Secure Fixed Length Encryption Scheme 72
3.4.2 Handling Variable Length Messages 76
3.4.3 Stream Ciphers and Multiple Encryptions 77
xiii
xiv
3.5 Security Against Chosen Plaintext Attacks (CPA) 82
3.6 Constructing CPA Secure Encryption Schemes 85
3.6.1 Pseudorandom Functions 86
3.6.2 CPA Secure Encryption from Pseudorandom Functions 89
3.6.3 Pseudorandom Permutations and Block Ciphers . 94
3.6.4 Modes of Operation 96
3.7 Security Against Chosen Ciphertext Attacks (CCA) 103
References and Additional Reading 105
Exercises 106
4 Message Authentication Codes and Collision Resistant Hash
Functions 111
4.1 Secure Communication and Message Integrity Ill
4.2 Encryption vs. Message Authentication 112
4.3 Message Authentication Codes Definitions 114
4.4 Constructing Secure Message Authentication Codes 118
4.5 CBC MAC 125
4.6 Collision Resistant Hash Functions 127
4.6.1 Defining Collision Resistance 128
4.6.2 Weaker Notions of Security for Hash Functions . 130
4.6.3 A Generic "Birthday" Attack 131
4.6.4 The Merkle Damgard Transform 133
4.6.5 Collision Resistant Hash Functions in Practice . 136
4.7 * NMAC and HMAC 138
4.7.1 Nested MAC (NMAC) 138
4.7.2 HMAC 141
4.8 * Constructing CCA Secure Encryption Schemes 144
4.9 * Obtaining Privacy and Message Authentication 148
References and Additional Reading 154
Exercises 155
5 Practical Constructions of Pseudorandom Permutations (Block
Ciphers) 159
5.1 Substitution Permutation Networks 162
5.2 Feistel Networks 170
5.3 DES The Data Encryption Standard 173
5.3.1 The Design of DES 173
5.3.2 Attacks on Reduced Round Variants of DES 176
5.3.3 The Security of DES 179
5.4 Increasing the Key Length of a Block Cipher 181
5.5 AES The Advanced Encryption Standard 185
5.6 Differential and Linear Cryptanalysis A Brief Look . 187
Additional Reading and References 189
Exercises 189
XV
6 * Theoretical Constructions of Pseudorandom Objects 193
6.1 One Way Functions 194
6.1.1 Definitions 194
6.1.2 Candidate One Way Functions 197
6.1.3 Hard Core Predicates 198
6.2 Overview: From One Way Functions to Pseudorandomness . 200
6.3 A Hard Core Predicate for Any One Way Function 202
6.3.1 A Simple Case 202
6.3.2 A More Involved Case 203
6.3.3 The Full Proof 208
6.4 Constructing Pseudorandom Generators 213
6.4.1 Pseudorandom Generators with Minimal Expansion . 214
6.4.2 Increasing the Expansion Factor 215
6.5 Constructing Pseudorandom Functions 221
6.6 Constructing (Strong) Pseudorandom Permutations 225
6.7 Necessary Assumptions for Private Key Cryptography . 227
6.8 A Digression Computational Indistinguishability 232
6.8.1 Pseudorandomness and Pseudorandom Generators . . 233
6.8.2 Multiple Samples 234
References and Additional Reading 237
Exercises 237
III Public Key (Asymmetric) Cryptography 241
7 Number Theory and Cryptographic Hardness Assumptions 243
7.1 Preliminaries and Basic Group Theory 245
7.1.1 Primes and Divisibility 246
7.1.2 Modular Arithmetic 248
7.1.3 Groups 250
7.1.4 The Group Z*N 254
7.1.5 * Isomorphisms and the Chinese Remainder Theorem 256
7.2 Primes, Factoring, and RSA 261
7.2.1 Generating Random Primes 262
7.2.2 * Primality Testing 265
7.2.3 The Factoring Assumption 271
7.2.4 The RSA Assumption 271
7.3 Assumptions in Cyclic Groups 274
7.3.1 Cyclic Groups and Generators 274
7.3.2 The Discrete Logarithm and Dime Hellman Assump¬
tions 277
7.3.3 Working in (Subgroups of) Z^ 281
7.3.4 * Elliptic Curve Groups 282
7.4 Cryptographic Applications of Number Theoretic Assumptions 287
7.4.1 One Way Functions and Permutations 287
7.4.2 Constructing Collision Resistant Hash Functions . . . 290
xvi
References and Additional Reading 293
Exercises 294
8 * Factoring and Computing Discrete Logarithms 297
8.1 Algorithms for Factoring 297
8.1.1 Pollard"sp 1 Method 298
8.1.2 Pollard's Rho Method 301
8.1.3 The Quadratic Sieve Algorithm 303
8.2 Algorithms for Computing Discrete Logarithms 305
8.2.1 The Baby Step/Giant Step Algorithm 307
8.2.2 The Pohlig Hellman Algorithm 309
8.2.3 The Discrete Logarithm Problem in ZjV 310
8.2.4 The Index Calculus Method 311
References and Additional Reading 313
Exercises 314
9 Private Key Management and the Public Key Revolution 315
9.1 Limitations of Private Key Cryptography 315
9.2 A Partial Solution Key Distribution Centers 317
9.3 The Public Key Revolution 320
9.4 Diffie Hellman Key Exchange 324
References and Additional Reading 330
Exercises 331
10 Public Key Encryption 333
10.1 Public Key Encryption An Overview 333
10.2 Definitions 336
10.2.1 Security against Chosen Plaintext Attacks 337
10.2.2 Multiple Encryptions 340
10.3 Hybrid Encryption 347
10.4 RSA Encryption 355
10.4.1 "Textbook RSA" and its Insecurity 355
10.4.2 Attacks on Textbook RSA 359
10.4.3 Padded RSA 362
10.5 The El Gamal Encryption Scheme 364
10.6 Security Against Chosen Ciphertext Attacks 369
10.7 * Trapdoor Permutations 373
10.7.1 Definition 374
10.7.2 Public Key Encryption from Trapdoor Permutations . 375
References and Additional Reading 378
Exercises 379
xvii
11 * Additional Public Key Encryption Schemes 385
11.1 The Goldwasser Micali Encryption Scheme 386
11.1.1 Quadratic Residues Modulo a Prime 386
11.1.2 Quadratic Residues Modulo a Composite 389
11.1.3 The Quadratic Residuosity Assumption 392
11.1.4 The Goldwasser Micali Encryption Scheme 394
11.2 The Rabin Encryption Scheme 397
11.2.1 Computing Modular Square Roots 397
11.2.2 A Trapdoor Permutation Based on Factoring 402
11.2.3 The Rabin Encryption Scheme 406
11.3 The Paillier Encryption Scheme 408
11.3.1 The Structure of Z*m 409
11.3.2 The Paillier Encryption Scheme 411
11.3.3 Homomorphic Encryption 416
References and Additional Reading 418
Exercises 418
12 Digital Signature Schemes 421
12.1 Digital Signatures An Overview 421
12.2 Definitions 423
12.3 RSA Signatures 426
12.3.1 "Textbook RSA" and its Insecurity 426
12.3.2 Hashed RSA 428
12.4 The "Hash and Sign" Paradigm 429
12.5 Lamport's One Time Signature Scheme 432
12.6 * Signatures from Collision Resistant Hashing 435
12.6.1 "Chain Based" Signatures 436
12.6.2 "Tree Based" Signatures 439
12.7 The Digital Signature Standard (DSS) 445
12.8 Certificates and Public Key Infrastructures 446
References and Additional Reading 453
Exercises 454
13 Public Key Cryptosystems in the Random Oracle Model 457
13.1 The Random Oracle Methodology 458
13.1.1 The Random Oracle Model in Detail 459
13.1.2 Is the Random Oracle Methodology Sound? 465
13.2 Public Key Encryption in the Random Oracle Model . 469
13.2.1 Security Against Chosen Plaintext Attacks 469
13.2.2 Security Against Chosen Ciphertext Attacks 473
13.2.3 OAEP 479
13.3 Signatures in the Random Oracle Model 481
References and Additional Reading 486
Exercises 486
xviii
Index of Common Notation 489
A Mathematical Background 493
A.I Identities and Inequalities 493
A.2 Asymptotic Notation 493
A.3 Basic Probability 494
A.4 The "Birthday" Problem 496
B Supplementary Algorithmic Number Theory 499
B.I Integer Arithmetic 501
B.I.I Basic Operations 501
B.I.2 The Euclidean and Extended Euclidean Algorithms . 502
B.2 Modular Arithmetic 504
B.2.1 Basic Operations 504
B.2.2 Computing Modular Inverses 505
B.2.3 Modular Exponentiation 505
B.2.4 Choosing a Random Group Element 508
B.3 * Finding a Generator of a Cyclic Group 512
B.3.1 Group Theoretic Background 512
B.3.2 Efficient Algorithms 513
References and Additional Reading 515
Exercises 515
References 517
Index 529 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Katz, Jonathan 1974- Lindell, Yehuda 1971- |
| author_GND | (DE-588)133268101 (DE-588)1031893946 |
| author_facet | Katz, Jonathan 1974- Lindell, Yehuda 1971- |
| author_role | aut aut |
| author_sort | Katz, Jonathan 1974- |
| author_variant | j k jk y l yl |
| building | Verbundindex |
| bvnumber | BV022719679 |
| 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 | SK 170 ST 276 |
| classification_tum | DAT 465f |
| ctrlnum | (OCoLC)137325053 (DE-599)DNB 2007017861 |
| 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 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>01857nam a2200481zc 4500</leader><controlfield tag="001">BV022719679</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170906 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070906s2008 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2007017861</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">LO 2007017861</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781584885511</subfield><subfield code="9">978-1-58488-551-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)137325053</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB 2007017861</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-703</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-384</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></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">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="100" ind1="1" ind2=" "><subfield code="a">Katz, Jonathan</subfield><subfield code="d">1974-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133268101</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to modern cryptography</subfield><subfield code="c">Jonathan Katz ; Yehuda Lindell</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton, Fla. [u.a.]</subfield><subfield code="b">Chapman & Hall / CRC</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 534 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">Chapman & Hall, CRC cryptography and network security</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptographie</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sécurité informatique</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">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lindell, Yehuda</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1031893946</subfield><subfield code="4">aut</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=015925422&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-015925422</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV022719679 |
| illustrated | Illustrated |
| index_date | 2024-07-02T18:29:39Z |
| indexdate | 2024-07-09T21:04:26Z |
| institution | BVB |
| isbn | 9781584885511 |
| language | English |
| lccn | 2007017861 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015925422 |
| oclc_num | 137325053 |
| open_access_boolean | |
| owner | DE-703 DE-1051 DE-20 DE-634 DE-29T DE-898 DE-BY-UBR DE-11 DE-91G DE-BY-TUM DE-739 DE-188 DE-355 DE-BY-UBR DE-1046 DE-83 DE-384 |
| owner_facet | DE-703 DE-1051 DE-20 DE-634 DE-29T DE-898 DE-BY-UBR DE-11 DE-91G DE-BY-TUM DE-739 DE-188 DE-355 DE-BY-UBR DE-1046 DE-83 DE-384 |
| physical | XVIII, 534 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Chapman & Hall / CRC |
| record_format | marc |
| series2 | Chapman & Hall, CRC cryptography and network security |
| spelling | Katz, Jonathan 1974- Verfasser (DE-588)133268101 aut Introduction to modern cryptography Jonathan Katz ; Yehuda Lindell Boca Raton, Fla. [u.a.] Chapman & Hall / CRC 2008 XVIII, 534 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Chapman & Hall, CRC cryptography and network security Cryptographie Sécurité informatique Computer security Cryptography Kryptologie (DE-588)4033329-2 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Kryptologie (DE-588)4033329-2 s DE-604 Lindell, Yehuda 1971- Verfasser (DE-588)1031893946 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015925422&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Katz, Jonathan 1974- Lindell, Yehuda 1971- Introduction to modern cryptography Cryptographie Sécurité informatique Computer security Cryptography Kryptologie (DE-588)4033329-2 gnd |
| subject_GND | (DE-588)4033329-2 (DE-588)4151278-9 |
| title | Introduction to modern cryptography |
| title_auth | Introduction to modern cryptography |
| title_exact_search | Introduction to modern cryptography |
| title_exact_search_txtP | Introduction to modern cryptography |
| title_full | Introduction to modern cryptography Jonathan Katz ; Yehuda Lindell |
| title_fullStr | Introduction to modern cryptography Jonathan Katz ; Yehuda Lindell |
| title_full_unstemmed | Introduction to modern cryptography Jonathan Katz ; Yehuda Lindell |
| title_short | Introduction to modern cryptography |
| title_sort | introduction to modern cryptography |
| topic | Cryptographie Sécurité informatique Computer security Cryptography Kryptologie (DE-588)4033329-2 gnd |
| topic_facet | Cryptographie Sécurité informatique Computer security Cryptography Kryptologie Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015925422&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT katzjonathan introductiontomoderncryptography AT lindellyehuda introductiontomoderncryptography |