applied cryptography - protocols, algorithms, and source code in c

Central facilities 127128 secure elections cont

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: closure of secrets Anonymous message broadcast, 137–139 ANSI X3.105, 267 ANSI X3.106, 267 ANSI X9.8, 267 ANSI X9.17, 268, 359 key generation, 175 ANSI X9.19, 267 ANSI X9.26, 268 Arbitrated protocol, 23–26 Arbitration, timestamping, 75–76 Arbitrator, 23 document signing with, 35–37 group signatures with, 84–85 AR hash function, 453 Arithmetic, modular, 242–245 Arms Export Control Act, 610 Asmuth-Bloom scheme, 529–530 Association for Computing Machinery, 608 Asymmetric algorithms, see Public-key algorithms Atomic Energy Act, 610 Attack, 5 AT&ampT Model 3600 Telephone Security Device, 594–595 Authentication, 2, 52–56 DASS, 62 Denning-Sacco protocol, 63 dictionary attacks, 52 ISO framework, 574–577 Kerberos, 60 message, 56 Needham-Schroeder protocol, 58–59 Neuman-Stubblebine protocol, 60–62 Otway-Rees protocol, 59–60 protocols, formal analysis, 65–68 salt, 52–53 Schnorr, 511 SESAME, 572 SKEY, 53 SKID, 55–56 using interlock protocol, 54–55 using one-way functions, 52 using public-key cryptography, 53–54 Wide-Mouth Frog protocol, 56–57 Woo-Lam protocol, 63–64 Yahalom, 57–58 Authenticators, 568 Avalanche effect, 273 Backup keys, 181–182 BAN logic, 66–67 Barrett’s algorithm, 244 BaseKing, 346 Basis, polarization measurement, 555 Battista, Leon, 11 BBS generator, 417 add to spelled out, 553–554 Beacons, 64 Bellovin, Steve, 518, 520–521, 571 Bennett, Charles, 555, 557 Berlekamp-Massey algorithm, 380, 404 Bernstein, Dan, 616 Berson, Tom, 441 Best affine approximation attack, 381 Beth-Piper stop-and-go generator, 383–384 Bias, 425 Bidirectional message authentication codes, 457 Biham, Eli, 284–285, 288, 296, 301, 303, 306, 308, 311–312, 314, 316, 319, 354, 361, 434 Bilateral stop-and-go generator, 384–385 Binary trees, 78 Biotechnology, as cryptanalysis tool, 156–157 Birthday attack, 165–166, 430 Bit commitment, 86–88 using one-way functions, 87–88 using pseudo-random-sequence generators, 88 using symmetric cryptography, 86–87 Blakley, George, 72, 529 Blaze, Matt, 346, 364 Blinding factor, 112 Blind signatures, 112–115, 549–550 patents, 115 voting with, 126–127 Blobs, 88 Block algorithms, 4 Block chain mode, 206–207 Block ciphers, 4, 189 Blowfish, 336–339 CA-1.1, 327–328 cascading algorithms, 367–368 CAST, 334–335 CDMF key shortening, 366 choosing algorithms, 354–355 combining algorithms, 368 counter mode, 205–206, 209 Crab, 342...
View Full Document

This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.

Ask a homework question - tutors are online