Ãëàâíàÿ    Ex Libris    Êíèãè    Æóðíàëû    Ñòàòüè    Ñåðèè    Êàòàëîã    Wanted    Çàãðóçêà    ÕóäËèò    Ñïðàâêà    Ïîèñê ïî èíäåêñàì    Ïîèñê    Ôîðóì   
blank
Àâòîðèçàöèÿ

       
blank
Ïîèñê ïî óêàçàòåëÿì

blank
blank
blank
Êðàñîòà
blank
Konheim A.G. — Computer Security and Cryptography
Konheim A.G. — Computer Security and Cryptography



Îáñóäèòå êíèãó íà íàó÷íîì ôîðóìå



Íàøëè îïå÷àòêó?
Âûäåëèòå åå ìûøêîé è íàæìèòå Ctrl+Enter


Íàçâàíèå: Computer Security and Cryptography

Àâòîð: Konheim A.G.

Àííîòàöèÿ:

Gain the skills and knowledge needed to create effective data security systems


This book updates readers with all the tools, techniques, and concepts needed to understand and implement data security systems. It presents a wide range of topics for a thorough understanding of the factors that affect the efficiency of secrecy, authentication, and digital signature schema. Most importantly, readers gain hands-on experience in cryptanalysis and learn how to create effective cryptographic systems.

The author contributed to the design and analysis of the Data Encryption Standard (DES), a widely used symmetric-key encryption algorithm. His recommendations are based on firsthand experience of what does and does not work.

Thorough in its coverage, the book starts with a discussion of the history of cryptography, including a description of the basic encryption systems and many of the cipher systems used in the twentieth century. The author then discusses the theory of symmetric- and public-key cryptography. Readers not only discover what cryptography can do to protect sensitive data, but also learn the practical limitations of the technology. The book ends with two chapters that explore a wide range of cryptography applications.

Three basic types of chapters are featured to facilitate learning:
Chapters that develop technical skills
Chapters that describe a cryptosystem and present a method of analysis
Chapters that describe a cryptosystem, present a method of analysis, and provide problems to test your grasp of the material and your ability to implement practical solutions

With consumers becoming increasingly waryof identity theft and companies struggling to develop safe, secure systems, this book is essential reading for professionals in e-commerce and information technology. Written by a professor who teaches cryptography, it is also ideal for students.


ßçûê: en

Ðóáðèêà: Computer science/

Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö

ed2k: ed2k stats

Èçäàíèå: 1st edition

Ãîä èçäàíèÿ: 2006

Êîëè÷åñòâî ñòðàíèö: 544

Äîáàâëåíà â êàòàëîã: 11.12.2007

Îïåðàöèè: Ïîëîæèòü íà ïîëêó | Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
blank
Ïðåäìåòíûé óêàçàòåëü
Japanese PURPLE Machine, cribbing PURPLE, finding the C-Stepper      238—243
Japanese PURPLE Machine, cribbing PURPLE, finding the V-Stepper      220—237
Japanese PURPLE Machine, cryptanalysis by Denning, Mary Jo      218
Japanese PURPLE Machine, cryptanalysis by Ferner, Robert      218
Japanese PURPLE Machine, cryptanalysis by Grotjan, Genevive      218
Japanese PURPLE Machine, cryptanalysis by Rowlett, Frank B. (1908—1998)      218
Japanese PURPLE Machine, cryptanalysis by Snyder, Sam      218
Japanese PURPLE Machine, cryptanalysis of      219—243
Japanese PURPLE Machine, encipherment of CON-letters      212—216
Japanese PURPLE Machine, encipherment of CON-letters, period of      216—217
Japanese PURPLE Machine, encipherment of VOW-letters      211—212
Japanese PURPLE Machine, key, components of the PURPLE      212—218
Japanese PURPLE Machine, partition of letters (VOW-CON)      211
Japanese RED machine      191—209
Japanese RED machine, components of      193—194
Japanese RED machine, components of, breakwheel of      194—196
Japanese RED machine, cribbing RED ciphertext      200—298
Japanese RED machine, cribbing RED ciphertext, vowel/consonant pattern in      200—201
Japanese RED machine, cribbing RED ciphertext, with all breakwheel pins active      201—204
Japanese RED machine, cribbing RED ciphertext, with some inactive breakwheel pins      204—209
Japanese RED machine, cribbing RED ciphertext, with some inactive breakwheel pins, estimating number of inactive pins      199—200
Japanese RED machine, cribbing RED ciphertext, with some inactive breakwheel pins, stepping equations for      206—209
Japanese RED machine, cryptanalysis of      200—209
Japanese RED machine, cryptanalysis of, estimating number of pins removed      199
Japanese RED machine, cryptanalysis of, shifted ciphertext      198
Japanese RED machine, encipherment rules of      197—198
Japanese RED machine, encipherment rules of, encipherment of CON-letters      197—198
Japanese RED machine, encipherment rules of, encipherment of VOW-letters      197—198
Japanese RED machine, encipherment rules of, partition of letters: (VOW, CON)      197
Japanese RED machine, generalized vowels/consonants      209
Japanese RED machine, pins of      194—195
Japanese RED machine, plugboard of      194
Japanese RED machine, plugboard of, stepping sequence of      194—196
Japanese RED machine, plugboard of, stepping shifts of      195
Key      4
Key distribution      335—336
Key distribution, in a network      335—336 447
Key running      116—117
Key space      4
Key stream      244—282
Key, Diffie — Hellman protocol      448—450
Key, Diffie — Hellman protocol, El Gamal's extension of      450—451
Key, Shamir's autonomous protocol      451—453
Knapsack cryptosystem      350—371
Knapsack cryptosystem, trapdoor      350—371
Knapsack problem (modulo m)      350
Knapsack problem (subset sum problem)      338—340
Knapsack problem (subset sum problem), with modular arithmetic      350—371
Knapsack vector      344
Knapsack vector, evaluation using      138
Knapsack vector, Kolmogorov — Smirnov test      136—138
Knapsack vector, significance level in      137
Knapsack vector, super-increasing      345 350—354
Kohnfelder, Lauren      341—342 467 495
Kohnfelder, Lauren, certificates of      495
Kullback, Dr. Solomon (1903—1994)      11 85
Lattice      368—370
Lattice, short vectors in      368—370
Least common multiple lcmfg      385
Leibler, Richard A. (1914—2003)      85
Lenstra's factorization algorithm on elliptic curves      432—433
Letter counts and probabilities      32
Letters (of text)      1 2
Linear feedback shift register (LFSR)      245—246 254—273
Linear feedback shift register (LFSR), characteristic polynomial of a      251—253
Linear feedback shift register (LFSR), combining      259
Linear feedback shift register (LFSR), cribbing of LFSR-enciphered ASCII plaintext      260—271
Linear feedback shift register (LFSR), irregular clocking of      274—278
Linear feedback shift register (LFSR), sequences of      254
Linear feedback shift register (LFSR), sequences of, matrix representation of      260—261
Linear feedback shift register (LFSR), sequences of, maximal length LFSR sequences      254—258
Linear feedback shift register (LFSR), sequences of, maximal length LFSR sequences, autocorrelation function of      255—258
Linear feedback shift register (LFSR), sequences of, maximal length LFSR sequences, linear complexity (equivalence) of      258
Linear feedback shift register (LFSR), sequences of, maximal length LFSR sequences, properties of      258
Lorenz Schluesselzusatz (SZ40/fish)      170—190
Lorenz Schluesselzusatz (SZ40/fish), cribbing of ciphertext      176—190
Lorenz Schluesselzusatz (SZ40/fish), cryptanalysis problems for      173
Lorenz Schluesselzusatz (SZ40/fish), finding the active pins of      171
Lorenz Schluesselzusatz (SZ40/fish), key of      173
Lorenz Schluesselzusatz (SZ40/fish), key stream generated by      170
Lorenz Schluesselzusatz (SZ40/fish), move indicator of      183—190
Lorenz Schluesselzusatz (SZ40/fish), pin wheels of      171—173
Lorenz Schluesselzusatz (SZ40/fish), statistical model of pin motion      177—183
Lorenz Schluesselzusatz (SZ40/fish), steps in encipherment      174
Lucifer      283—287
LUCIFER, implementation in IBM 2984      284—287
LUCIFER, key schedule of      285—286
LUCIFER, operations in      286—287
LUCIFER, P-Box of      286—287
LUCIFER, S-box of      285—286
M-94 (CSP-488)      6 7
Magnetic stripe technology      482—483
Magnetic stripe technology, protecting recording in      482—483
Making a secure credit card payment on the Web      502—505
Markman hearing      514
Markov log-odds score      38
Markov parameters, Gmarkov      34
Markov parameters, Hmarkov      34
Markov parameters, Smarkov      34
Markov score      34
Markov scoring      34
Markov source      31 32
Markov source, homogeneous      31
Markov source, Law of large numbers for      40
Matyas, Stephen M.      455
Mauborgne, Joseph Oswald (1881—1971)      119
Maximum likelihood estimation (MLE)      81
Maximum likelihood estimation (MLE), partial maximum likelihood estimation      73—78
Menezes — Vanstone elliptic curve cryptosystem      443
Merkle — Hellman trapdoor knapsack cryptosystem      350—371
Merkle — Hellman trapdoor knapsack cryptosystem, ASCII-text decipherment of      357—358
Merkle — Hellman trapdoor knapsack cryptosystem, ASCII-text encipherment of      355—356
Merkle — Hellman trapdoor knapsack cryptosystem, cryptanalysis of      358—372
Merkle, Ralph C.      15 512
Mersenne primes      408—409
Mersenne, Marin (1588—1648)      409
Message authentication      3
Message authentication code (MAC)      3 466 498—500
Message authentication code (MAC), MD5      471—473
Message authentication code (MAC), message digest      471
Meyer, Carl H.      455
Miller — Rabin primality test      406—407
Miller — Rabin theorem      405—406
Modular arithmetic $Z_p$      346—347
Modular arithmetic $Z_p$, multiplicative inverse in      347 378
Modular arithmetic $Z_p$polynomial      248—250
Modular arithmetic $Z_p$residues in      346—347
Modular exponentiation      338—339 376—377
Modular exponentiation, program for      376
Monoalphabetic substitution      1
Monoalphabetic substitution, cryptanalysis of      73
Monoalphabetic substitution, examples of      68—73
Monoalphabetic substitution, table for a      64
Multiprecision modular arithmetic      387—389
Multiprecision modular arithmetic, basic modular operations      387
Multiprecision modular arithmetic, internal representation of numbers      387
Myer, Albert J. (1828—1880)      63—64
N-gram      1
National Security Agency (NSA)      9 10
Needham — Schroeder protocol      335 456—462
Needham — Schroeder protocol, using a public key cryptosystem      459—462
Needham — Schroeder protocol, using a symmetric key crypto system      456—459
Needham, Roger M.      335 456
NIST's digital signature algorithm      474—475
NIST's secure hash algorithm      473—474
NIST's secure hash algorithm, NIST's long run test      139
NIST's secure hash algorithm, NIST's monobit test      138
NIST's secure hash algorithm, NIST's poker test      138
NIST's secure hash algorithm, NIST's runs rest      139
NIST's secure hash algorithm, NIST's statistical tests      138—139
Nonlinear feedback shift registers      271—273
Nonlinear key stream generation      273—274
Nonpatentable subjects      508
Number theory and cryptography      391
Oblivious transfer      478
Odlyzko, Andrew M.      428
One-gram scoring using a Markov language model      75
One-gram scoring using a one-gram language model      74
One-time pad (tape)      119—120 128—129
One-time pad (tape), detecting reuse of Soviet      130—131
One-time pad (tape), Soviet KGB protocol for      128—129
One-way function      340 480—481
One-way function, trapdoor      340
Parameters of a Markov model, deriving the      34
password cracking      481—482
Patents      506—509
Patents, 3 C's, 507
Patents, claims of      507—508
Patents, claims of, anticipated      508
Patents, claims of, invalid      508
Patents, claims of, means plus function      508
Patents, claims of, obvious      508
Patents, equivalent structures/acts of a      509
Patents, file history      508
Patents, format of      507—508
Patents, invalid      508
Patents, prior art      507
Patents, requirements of      507
Patents, requirements of, enablement      507
Patents, requirements of, novelty      507
Patents, requirements of, obviousness / nonobviousness      507
Patents, requirements of, utility      507
Patents, requirements of, written description      508
Patents, role in cryptography      509
Patents, specification of      507
Patents, subjects, Nonpatentable      507—508
Patents, submarine      515
Patents, validity of      508
Perfect numbers      408—409
Plaintext      2 6
Plaintext language models      30 31
Pohlig — Hellman algorithm      415—418
Pollard's $\rho$-algorithm      394 424—426
Pollard's $\rho$-algorithm for discrete logarithm problem      424—426
Pollard's $\rho$-algorithm for integer factorization      394
Pollard's p-1 method      391 393—394
Polyalphabetic substitution      116
Polyalphabetic substitution, periodic      117
Polyalphabetic substitution, periodic, correlation analysis of      120—124
Polyalphabetic substitution, periodic, estimating the period of periodic polyalphabetic substitution using coincidence      126—127
Polyalphabetic substitution, periodic, estimating the period of using correlation to find the Vernam — Vigenere key of      120—124
Polyalphabetic substitution, periodic, estimating the period of using the $\kappa$-value for the cryptanalysis of      127—128
Polynomials over $Z_2$      247—250
Polynomials over $Z_2$, division algorithm for      247—248
Polynomials over $Z_2$, exponent of      249
Polynomials over $Z_2$, factorization of      249
Polynomials over $Z_2$, irreducible polynomials      247
Polynomials over $Z_2$, modular arithmetic for      248—250
Polynomials over $Z_2$, reducible polynomials      247
Porta, Giambattista della (1538—1615)      117
Primality testing      405
Prime number theorem      391
Primes, factorization of integers into      390
Primitive roots modulo p      397 414
Privacy      3
Private information (about a cryptographic system)      5
Private key      337—340 354
Product block-cipher      283
Product block-cipher, Feistel-like      283
Project Gutenberg Free eBook Library      34
Pseudo-random bit generator (PRBG)      502
Pseudo-random number generator (PRBG)      257—258
Pseudo-random number generator (PRBG), next bit test of      257 502
Pseudorandom sequence      257
Public information (about a cryptographic system)      5
Public key      337—340 354
Public key certificates      342 449 495—497
Public key cryptography      334—341
Public key cryptosystem(s)      334—341
Purdy, George B.      480
Pythagorean triples      428
Quadratic residue      396—401
Quadratic residue, sieve      403—405
Quadratic residue, sieve, factor base in      404
Quadratic residue, sieve, steps in      403
Quantum computers      428
Quantum computers, RSA's      502
Rabin's quadratic residue signature protocol      468—470
Rabin, Michael O.      468—470
Random factorization (Dixon)      401—403
RC4      278—280
RC4, key scheduling algorithm of      278—279
RC4, pseudorandom number generator (PRGA) of      278—280
Relatively prime numbers      377
Riemann hypothesis      407
Riemann hypothesis, generalized      407
Riemann zeta function $\zeta(z)$      407
Rijndael      312—326
Rijndael, activity pattern      323—325
Rijndael, block sizes of      313
Rijndael, key sizes of      313
Rijndael, operations of      314—323
Rijndael, operations of, AddRoundKey      321—323
Rijndael, operations of, ByteSub and InvByteSub      316—317
Rijndael, operations of, MixColumn and InvMixColumn      320
Rijndael, operations of, ShiftRow and InvShiftRow      317—318
Rijndael, propagation of patterns      323—326
Ring      10
Rivest, Ronald      340 378
Rotor      150—151
Rotor system(s)      152—153
Rotor system(s), Hebern's straight-through rotor system      152 161
Rotor system(s), patents of      153—154
Rotor, displacement sequence (of a rotor)      158—160
Rotor, rotational displacement function of      153
Rotor, wiring by interval method      158—160
Rowlett, Frank B.      11 12 218 243
RSA challenge      16 407—408
RSA cryptosystem      16 340 378—382
RSA cryptosystem, attacks on      382—383
RSA cryptosystem, deciphering exponent      378
RSA cryptosystem, enciphering exponent      378
RSA cryptosystem, encipherment/decipherment of ASCII-Plaintext      379—382
RSA cryptosystem, encipherment/decipherment transformation      378
RSA cryptosystem, parameter set      378
RSA cryptosystem, William's variation of      383—387
RSA cryptosystem, Williams quadratic encipherment      384—387
RSA-129      408
Scherbius, Arthur (1878—1929)      160—161
Schroeder, Michael D.      335
Secrecy      2
Secrecy, digital signatures and authentication, comparison of      468
Secrecy, in GSM      276—278
Secrecy, secrecy systems      465
Secure Socket Layer (SSL)      497—502
Secure socket layer (SSL), cryptographically secure random number generator for      502
Secure socket layer (SSL), master secret in      500—501
Secure socket layer (SSL), message authentication code in      499—500
Secure socket layer (SSL), message digest algorithm of      498 499—500
Secure socket layer (SSL), messages in      497—499
Secure socket layer (SSL), messages in, Client_Hello      497—498
Secure socket layer (SSL), messages in, record protocol of      499
Secure socket layer (SSL), messages in, Server_Hello      498
Secure socket layer (SSL), messages in, SessionID of      498
Secure socket layer (SSL), transaction      497—499
Secure socket layer (SSL), transaction, data encipherment algorithm in      498
Secure socket layer (SSL), transaction, handshake protocol in      497
Secure socket layer (SSL), transaction, key exchange protocol of      498 500
Secure socket layer (SSL), transaction, key exchange protocol of, anonymous Diffie — Hellman      500
Secure socket layer (SSL), transaction, key exchange protocol of, anonymous ephemeral Diffie — Hellman      500
1 2 3
blank
Ðåêëàìà
blank
blank
HR
@Mail.ru
       © Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01! | Valid CSS! Î ïðîåêòå