<<

. 4
( 8)



>>

159. E. Biham, “On the Applicability of Differ-
fication Scheme for Smart Cards,”
ential Cryptanalysis to Hash Functions,”
Advances in Cryptology-EUROCRYPT
lecture at EIES Workshop on Crypto-
˜88 Proceedings, Springer-Verlag, 1988, pp.
graphic Hash Functions, Mar 1992.
77-84.
160. E. Biham, personal communication, 1993.
147. T. Beth, B.M. Cook, and D. Gollmann,
E. Biham, “Higher Order Differential
161.
“Architectures for Exponentiation in
Cryptanalysis,” unpublished manuscript,
Cryptology-
GF(2”),” Advances in
Jan 1994.
CRYPTO ˜86 Proceedings, Springer-VerIag,
162. E. Biham, “On Modes of Operation,” Past
1987, pp. 302-310.
Software Encryption, Cambridge Security
148. T. Beth and Y. Desmedt, “Identification
Workshop Proceedings, Springer-Verlag,
Tokens-or: Solving the Chess Grandmas-
1994, pp. 116-120.
ter Problem,” Advances in Cryptology-
163. E. Biham, “New Types of Cryptanalytic
CRYPTO ˜90 Proceedings, Springer-VerIag,
Attacks Using Related Keys,” fournal of
1991, pp. 169-176.
Cryptology, v. 7, n. 4, 1994, pp. 229-246.
149. T. Beth and C. Ding, “On Almost Nonlin-
164. E. Biham, “On Matsui™s Linear CryptanaI-
ear Permutations,” Advances in Cryp-
ysis,” Advances in Cryptology-EURO-
tology-EUROCRYPT ˜93 Proceedings,
CRYPT ˜94 Proceedings, Springer-VerIag,
Springer-Verlag, 1994, pp. 65-76.
1995, pp. 398-412.
150. T. Beth, M. Frisch, and G.J. Simmons, eds.,
165. E. Biham and A. Biryukov, “How to
Lecture Notes in Computer Science 578;
Existing
Strengthen DES Using
Public Key Cryptography: State of the Art
Hardware,” Advances in Cryptology-
and Future Directions, Springer-Verlag,
ASIACRYPT ˜94 Proceedings, Springer-
1992.
Verlag 1995, to appear.
151. T. Beth and EC. Piper, “The Stop-and-Go
166. E. Biham and PC. Kocher, “A Known
Generator,” Advances in Cryptology: Pro-
Plaintext Attack on the PKZIP Encryp-
ceedings of EUROCRYPT 84, Springer-
tion,” K. U. Leuven Workshop on Crypto-
Verlag, 1984, pp. 88-92.
graphic Algorithms, Springer-Verlag. 1995,
152. T. Beth and F. Schaefer, “Non Supersingular
to appear.
Elliptic Curves for Public Key Cryptosys-
167. E. Biham and A. Shamir, “Differential
terns,” Advances in Cryptology-EURO-
DES-like
Cryptanalysis of
CRYPT ˜91 Proceedings, Springer-Verlag,
Advances in Cryptol-
Cryptosystems,”
1991, pp. 316-327.
ogy-CRYPTO ˜90 Proceedings, Springer-
153. A. Beutelspacher, “How to Say ˜No™,”
Advances in Cryptology-EUROCRYPT Verlag 1991, pp. 2-21.
168. E. Biham and A. Shamir, “Differential
˜89 Proceedings, Springer-Verlag, 1990, pp.
DES-like
Cryptanalysis of
491-496.
154. J. Bidzos, letter to NIST regarding DSS, 20 Cryptosystems,” fournal of Cryptology, v.
4, n. 1, 1991, pp 3-72.
Sep 1991.
169. E. Biham and A. Shamir, “Differential
155. J. Bidzos, personal communication, 1993.
Cryptanalysis of Feal and N-Hash,”
156. P. Bieber, “A Logic of Communication in a
Advances in Cryptology-EUROCRYPT
Hostile Environment,” Proceedings of the




Page 679
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


181. I.F. Blake, R.C. Mullin, and S.A. Vanstone,
˜91 Proceedings, Springer-Verlag, 1991, pp.
“Computing Logarithms in GF (2”),”
1-16.
Advances in Cryptology: Proceedings of
170. E. Biham and A. Shamir, “Differential
CRYPTO 84, Springer-Verlag, 1985, pp.
Cryptanalysis of Snefru, Khafre, REDOC-
73-82.
II, LOKI, and Lucifer,” Advances in Cryp-
182. G.R. Blakley, “Safeguarding Cryptographic
tology-CRYPTO ˜91 Proceedings, 1992,
Keys,” Proceedings of the National Com-
pp. 156-171.
puter Conference, 1979, American Federa-
171. E. Biham and A. Shamir, “Differential
Cryptanalysis of the Full 16-Round DES,” tion of Information Processing Societies, v.
48, 1979, pp. 313317.
Advances in Cryptology-CRYPTO ˜92
Proceedings, Springer-Verlag, 1993, 487- 183. G.R. Blakley, “One-Time Pads are Key
496. Safeguarding Schemes, Not Cryptosys-
terns-Fast Key Safeguarding Schemes
172. E. Biham and A. Shamir, Differential
(Threshold Schemes) Exist,” Proceedings
Cryptanalysis of the Data Encryption
Standard, Springer-Verlag, 1993. of the 1980 Symposium on Security and
Privacy, IEEE Computer Society, Apr 1980,
173. R. Bird, I. Gopal, A. Herzberg, P. Janson, S.
Kutten, R. Molva, and M. Yung, “System- pp. 108-l 13.
184. G.R. Blakley and I. Borosh, “Rivest-
atic Design of Two-Party Authentication
Protocols,” Advances in Cryptology- Shamir-Adleman Public Key Cryptosys-
CRYPTO ˜91 Proceedings, Springer-Verlag, terns Do Not Always Conceal Messages,”
Computers and Mathematics with Appli-
1992, pp. 44-61.
cations, v. 5, n. 3, 1979, pp. 169-178.
174. R. Bird, I. Gopal, A. Herzberg, P. Janson, S.
185. G.R. Blakley and C. Meadows, “A Data-
Kutten, R. Molva, and M. Yung, “System-
atic Design of a Family of Attack-Resistant base Encryption Scheme which Allows the
Computation of Statistics Using Encrypted
Authentication Protocols,” IEEE fournal
of Selected Areas in Communication, to Data,” Proceedings of the 1985 Sympo-
sium on Security and Privacy, IEEE Com-
appear.
175. R. Bird, I. Gopal, A. Herzberg, P. Janson, S. puter Society, Apr 1985, pp. 116-122.
Kutten, R. Molva, and M. Yung, “A Modu- 186. M. Blaze, “A Cryptographic File System
for UNIX,” 1st ACM Conference on Com-
lar Family of Secure Protocols for Authenti-
cation and Key Distribution,” IEEE/ACM puter and Communications Security,
Transactions on Networking, to appear. ACM Press, 1993, pp. 9-16.
176. M. Bishop, “An Application for a Fast Data 187. M. Blaze, “Protocol Failure in the
Encryption Standard Implementation,” Escrowed Encryption Standard,” 2nd ACM
Computing Systems, v. 1, n. 3, 1988, pp. Conference on Computer and Communi-
221-254. cations Security, ACM Press, 1994, pp.
177. M. Bishop, “Privacy-Enhanced Electronic 59-67.
Mail,” Distributed Computing and Cryp- 188. M. Blaze, “Key Management in an
tography, J. Feigenbaum and M. Merritt, Encrypting File System,” Proceedings of
eds., American Mathematical Society, the Summer 94 USENIX Conference,
1991, pp. 93-106. USENIX Association, 1994, pp. 27-35.
178. M. Bishop, “Privacy-Enhanced Electronic 189. M. Blaze and B. Schneier, “The MacGuffin
Mail,” Internetworking: Research and Block Cipher Algorithm,” K.U. Leuven
Experience, v. 2, n. 4, Dee 1991, pp. Workshop on Cryptographic Algorithms,
199-233. Springer-Verlag, 1995, to appear.
179. M. Bishop, “Recent Changes to Privacy 190. U. Blocher and M. Dichtl, “Fish: A Fast
Enhanced Electronic Mail,” Internetwork- Software Stream Cipher,” Fast Software
ing: Research and Experience, v. 4, n. 1, Encryption, Cambridge Security Work-
Mar 1993, pp. 47-59. shop Proceedings, Springer-Verlag 1994,
180. LF. Blake, R. Fuji-Hara, R.C. Mullin, and pp. 4144.
S.A. Vanstone, “Computing Logarithms in 191. R. Blom, “Non-Public Key Distribution,”
Finite Fields of Characteristic Two,” SIAM Advances in Cryptology: Proceedings of
fournal on Algebraic Discrete Methods, v. Crypto 82, Plenum Press, 1983, pp.
5, 1984, pp. 276-285. 231-236.




Page 680
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


204. J.-P. Boly, A. Bosselaers, R. Cramer, R.
192. K.J. Blow and S.J.D. Phoenix, “On a Funda-
Michelsen, S. Mjelsnes, F. Muller, T. Ped-
mental Theorem of Quantum Cryptogra-
ersen, B. Pfitzmann, P. de Rooij, B. Schoen-
phy,” lournal of Modern Optics, v. 40, n. 1,
makers, M. Schunter, L. Vallee, and M.
Jan 1993, pp. 3336.
Waidner, “Digital Payment Systems in the
193. L. Blum, M. Blum, and M. Shub, “A Simple
ESPRIT Project CAFE,” Securicom 94,
Unpredictable Pseudo-Random Number
Paris, France, 2-6 Jan 1994, pp. 3545.
Generator,” SIAM fournal on Computing,
205. J.-P. Boly, A. Bosselaers, R. Cramer, R.
v. 15, n. 2, 1986, pp. 364383.
Michelsen, S. Mjslsnes, F. Muller, T. Ped-
194. M. Blum, “Coin Flipping by Telephone: A
ersen, B. Pfitzmann, P. de Rooij, B. Schoen-
for Impossible
Protocol Solving
makers, M. Schunter, L. Vallee, and M.
Problems,” Proceedings of the 24th IEEE
Waidner, “The ESPRIT Project CAFE-
Computer Conference (CompCon), 1982,
High Security Digital Payment System,”
pp. 133-137.
Security-ESORICS 94,
195. M. Blum, “How to Exchange (Secret] Computer
Keys,” ACM Transactions on Computer Springer-Verlag, 1994, pp. 217-230.
206. D.J. Bond, “Practical Primality Testing,”
Systems, v. 1, n. 2, May 1983, pp. 175-193.
Proceedings of IEE International Confer-
196. M. Blum, “How to Prove a Theorem So No
ence on Secure Communications Systems,
One Else Can Claim It,” Proceedings of
22-23 Feb 1984, pp. 50-53.
the International Congress of Mathemati-
207. H. Bonnenberg, Secure Testing of VSLI
cians, Berkeley, CA, 1986, pp. 1444-1451.
Cryptographic Equipment, Series in
197. M. Blum, A. De Santis, S. Micah, and
G. Persiano, “Noninteractive Zero-Know- Microelectronics, Vol. 25, Konstanz: Har-
tung Gorre Verlag, 1993.
ledge,” SIAM fournal on Computing, v. 20,
208. H. Bonnenberg, A. Curiger, N. Felber, H.
n. 6, Dee 1991, pp. 1084-l 118.
Kaeslin, and X. Lai, “VLSI Implementation
198. M. Blum, P. Feldman, and S. Micah, “Non-
of a New Block Cipher,” Proceedings of the
Interactive Zero-Knowledge and Its Appli-
IEEE International Conference on Com-
cations,” Proceedings of the 20th ACM
puter Design: VLSI in Computers and Pro-
Symposium on Theory of Computing,
cessors (ICCD 91) Ott 1991, pp. 510-513.
1988, pp. 103-l 12.
199. M. Blum and S. Goldwasser, “An Efficient 209. KS. Booth, “Authentication of Signatures
Probabilistic Encryption Using Public Key Encryption,” Communi-
Public-Key
Scheme Which Hides AI1 Partial Informa- cations of the ACM, v. 24, n. 11, Nov 1981,
tion,” Advances in Cryptology: Proceed- pp. 772-774.
ings of CRYPTO 84, Springer-VerIag, 1985, 210. A. Bosselaers, R. Govaerts, and J. Vander-
pp. 289-299. walle, Advances in Cryptology-CRYPTO
200. M. Blum and S. Micah, “How to Generate ˜93 Proceedings, Springer-Verlag, 1994, pp.
Cryptographically-Strong Sequences of 175-186.
Pseudo-Random Bits,” SIAM fournal on 211. D.P. Bovet and P. Crescenzi, Introduction
Computing, v. 13, n. 4, Nov 1984, pp. to the Theory of Complexity, Englewood
850-864. Cliffs, N.J.: Prentice-Hall, 1994.
201. B. den Boer, “Cryptanalysis of F.E.A.L.,” 212. J. Boyar, “Inferring Sequences Produced by
Advances in Cryptology-EUROCRYPT a Linear Congruential Generator Missing
˜88 Proceedings, Springer-Verlag, 1988, pp. Low-Order Bits,” lournal of Cryptology, v.
293-300. 1, n. 3, 1989, pp. 177-184.
202. B. den Boer and A. Bosselaers, “An Attack 213. J. Boyar, D. Chaum, and I. Damgard,
on the Last Two Rounds of MD4,” “Convertible Undeniable Signatures,”
Advances in Cryptology-CRYPTO ˜91 Advances in Cryptology-CRYPTO ˜90
Proceedings, Springer-Verlag, 1992, pp. Proceedings, Springer-Verlag, 199 1, pp.
194-203. 189-205.
203. B. den Boer and A. Bosselaers, “Collisions 214. J. Boyar, K. Friedl, and C. Lund, “Practical
for the Compression Function of MD5,” Zero-Knowledge Proofs: Giving Hints and
Advances in Cryptology-EUROCRYPT Using Deficiencies,” Advances in Cryptol-
˜93 Proceedings, Springer-Verlag, 1994, pp. ˜89 Proceedings,
ogy-EUROCRYPT
293304. Springer-Verlag, 1990, pp. 155-172.




Page 681
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


227. S.A. Brands, “Electronic Cash on the Inter-
215. J. Boyar, C. Lund, and R. Peralta, “On the
net,” Proceedings of the Internet Society
Communication Complexity of Zero-
1995 Symposium on Network and Dis-
Knowledge Proofs,” fournal of Cryptology,
tributed Systems Security, IEEE Computer
v. 6, n. 2, 1993, pp. 65-85.
216. J. Boyar and R. Peralta, “On the Concrete Society Press 1995, pp 64-84.
Complexity of Zero-Knowledge Proofs,” 228. D.K. Branstad, “Hellman™s Data Does Not
Support His Conclusion,” IEEE Spectrum,
Advances in Cryptology-CRYPTO ˜89
Proceedings, Springer-Verlag 1990, pp. v. 16, n. 7, Jul 1979, p. 39.
507-525. 229. D.K. Branstad, J. Gait, and S. Katzke,
217. C. Boyd, “Some Applications of Multiple “Report on the Workshop on Cryptogra-
Key Ciphers,” Advances in Cryptology- phy in Support of Computer Security,”
NBSIR 77-1291, National Bureau of Stan-
EUROCRYPT ˜88 Proceedings, Springer-
dards, Sep 21-22, 1976, September 1977.
Verlag 1988, pp. 455-467.
218. C. Boyd, “Digital Multisignatures,” Cryp- 230. G. Brassard, “A Note on the Complexity of
tography and Coding, H.J. Beker and EC. Cryptography,” IEEE Transactions on
Piper, eds., Oxford: Clarendon Press, 1989, Information Theory, v. IT-25, n. 2, Mar
pp. 241-246. 1979, pp. 232-233.
219. C. Boyd, “A New Multiple Key Cipher and 23 1. G. Brassard, “Relativized Cryptography, ”
Proceedings of the IEEE 20th Annual Sym-
an Improved Voting Scheme,” Advances in
Cryptology-EUROCRYPT ˜89 Proceed- posium on the Foundations of Computer
Science, 1979, pp. 383391.
ings, Springer-Verlag, 1990, pp. 6 17-625.
232. G. Brassard, “A Time-Luck Tradeoff in
220. C. Boyd, “Multisignatures Revisited,”
Cryptography and Coding Ill, M.J. Ganley, Relativized Cryptography,” Proceedings of
the IEEE 21st Annual Symposium on the
ed., Oxford: Clarendon Press, 1993, pp.
2130. Foundations of Computer Science, 1980,
221. C. Boyd and W. Mao, “On the Limitation pp. 380-386.
of BAN Logic,” Advances in Cryptology- 233. G. Brassard, “A Time-Luck Tradeoff in
EUROCRYPT ˜93 Proceedings, Springer- Relativized Cryptography,” fournal of
Computer and System Sciences, v. 22, n. 3,
Verlag, 1994, pp. 240-247.
222. C. Boyd and W. Mao, “Designing Secure Jun 1981, pp. 280-311.
Key Exchange Protocols,” Computer Secu- 234. G. Brassard, “An Optimally Secure Rela-
rity-ESORICS 94, Springer-Verlag, 1994, tivized Cryptosystem,” SIGACT News, v.
pp. 217-230. 15, n. 1, 1983, pp. 28-33.
223. B.O. Brachtl, D. Coppersmith, M.M. 235. G. Brassard, “Relativized Cryptography,”
Hyden, SM. Matyas, C.H. Meyer, J. Oseas, IEEE Transactions on Information Theory,
S. Pilpel, and M. Schilling, “Data Authen- v. IT-29, n. 6, Nov 1983, pp. 877-894.
tication Using Modification Detection 236. G. Brassard, Modern Cryptology: A Tirto-
Codes Based on a Public One Way Func- rial, Springer-Verlag, 1988.
tion,” U.S. Patent #4,908,861, 13 Mar 237. G. Brassard, “Quantum Cryptography: A
1990. Bibliography,” SIGACT News, v. 24, n. 3,
224. J. Brandt, I.B. DamgPrd, P. Landrock, and T. Ott 1993, pp. 16-20.
Pederson, “Zero-Knowledge Authentica- 238. G. Brassard, D. Chaum, and C. Crepeau,
tion Scheme with Secret Key Exchange,” “An Introduction to Minimum Disclo-
Advances in Cryptology-CRYPTO ˜88, sure,” CWI Quarterly, v. 1, 1988, pp. 3-17.
Springer-Verlag 1990, pp. 583-588. 239. G. Brassard, D. Chaum, and C. Crepeau,
225. S.A. Brands, “An Efficient Off-Line Elec- “Minimum Disclosure Proofs of Knowl-
tronic Cash System Based on the Repre- edge,” Iournal of Computer and System
sentation Problem,” Report CSR9323, Sciences, v. 37, n. 2, Ott 1988, pp. 156-189.
Computer Science/Department of Algo- 240. G. Brassard and C. Crepeau, “Non-
rithms and Architecture, CWI, Mar 1993. Transitive Transfer of Confidence: A Per-
226. S.A. Brands, “Untraceable Off-line Cash fect Zero-Knowledge Interactive Protocol
in Wallet with Observers,” Advances for SAT and Beyond,” Proceedings of the
in Cryptology-CRYPTO ˜93, Springer- 27th IEEE Symposium on Foundations of
Verlag, 1994, pp. 302-318. Computer Science, 1986, pp. 188-195.




Page 682
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page



Key Cryptography,” Advances in Cryptol-
241. G. Brassard and C. Crepeau, “Zero-
ogy: Proceedings of Crypto 82, Plenum
Knowledge Simulation of Boolean Cir-
Press, 1982, pp. 51-60.
Cryptology-
Advances in
cuits,”
253. E.F. Brickell, “Are Most Low Density Poly-
CRYPTO ˜86 Proceedings, Springer-Verlag,
nomial Knapsacks Solvable in Polynomial
1987, pp. 223-233.
Time?” Proceedings of the 14th Southeast-
242. G. Brassard and C. Crepeau, “Sorting Out
ern Conference on Combinatorics, Graph
Zero-Knowledge,” Advances in Cryptol-
Theory, and Computing, 1983.
˜89 Proceedings,
ogy-EUROCRYPT
254. E.F. Brickell, “Solving Low Density Knap-
Springer-Verlag, 1990, pp. 181-191.
sacks,” Advances in Cryptology: Proceed-
243. G. Brassard and C. Crepeau, “Quantum Bit
Tossing ings of Crypto 83, Plenum Press, 1984, pp.
Coin
Commitment and
2537.
Protocols,” Advances in Cryptology-
255. E.F. Brickell, “Breaking Iterated Knap-
CRYPTO ˜90 Proceedings, Springer-Verlag,
sacks,” Advances in Cryptology: Proceed-
1991, pp. 49-61.
ings of Crypto 84, Springer-Verlag, 1985,
244. G. Brassard, C. Crepeau, R. Jozsa, and D.
pp. 342-358.
Langlois, “A Quantum Bit Commitment
256. E.F. Brickell, “Cryptanalysis of the
Scheme Provably Unbreakable by Both
Uagisawa Public Key Cryptosystem,”
Parties,” Proceedings of the 34th IEEE
Abstracts of Papers, EUROCRYPT ˜86,
Symposium on Foundations of Computer
20-22 May 1986.
Science, 1993, pp. 362371.
257. E.F. Brickell, “The Cryptanalysis of Knap-
245. G. Brassard, C. Crepeau, and J.-M. Robert,
sack Cryptosystems,” Applications of Dis-
“Information Theoretic Reductions
crete Mathematics, R.D. Ringeisen and
Among Disclosure Problems,” Proceed-
F.S. Roberts, eds., Society for Industrial
ings of the 27th IEEE Symposium on Foun-
and Applied Mathematics, Philadelphia,
dations of Computer Science, 1986, pp.
1988, pp. 3-23.
168-173.
258. E.F. Brickell, “Survey of Hardware Imple-
246. G. Brassard, C. Crepeau, and J.-M. Robert,
mentations of RSA,” Advances in Cryptol-
“All-or-Nothing Disclosure of Secrets,”
ogy-CRYPTO ˜89 Proceedings, Springer-
Advances in Cryptology-CRYPTO ˜86
Verlag, 1990, pp. 368370.
Proceedings, Springer-Verlag, 1987, pp.
259. E.F. Brickell, D. Chaum, I.B. Damgard, and
234-238.
J. van de Graff, “Gradual and Verifiable
247. G. Brassard, C. Crepeau, and M. Yung,
Release of a Secret,” Advances in Cryptol-
“Everything in NP Can Be Argued in Per-
fect Zero-Knowledge in a Bounded Num- ogy-CRYPTO ˜87 Proceedings, Springer-
Verlag, 1988, pp. 156-166.
ber of Rounds,” Proceedings on the 16th
260.
International Colloquium on Automata, E.F. Brickell, J.A. Davis, and G.J. Simmons,
Languages, and Programming, Springer- “A Preliminary Report on the Cryptanaly-
sis of Merkle-Hellman Knapsack,”
Verlag, 1989, pp. 123-136.
248. R.P. Brent, “An Improved Monte-Carlo Advances in Cryptology: Proceedings of
Crypto 82, Plenum Press, 1983, pp.
Factorization Algorithm,” BIT v. 20, n. 2,
1980, pp. 176-184. 289303.
261. E.F. Brickell and J. DeLaurentis, “An
249. R.P. Brent, “On the Periods of Generalized
Fibonacci Recurrences, Mathematics of Attack on a Signature Scheme Proposed by
Okamoto and Shiraishi,” Advances in
Computation, v. 63, n. 207, Jul 1994, pp.
Cryptology-CRYPTO ˜85 Proceedings,
389-401.
250. R.P. Brent, “Parallel Algorithms for Integer Springer-Verlag, 1986, pp. 2832.
262. E.F. Brickell, D.E. Denning, S.T. Kent, D.P.
Factorization,” Research Report CMA-
Maher, and W. Tuchman, “SKIPJACK
R49-89, Computer Science Laboratory,
The Australian National University, Ott Review-Interim Report,” unpublished
1989. manuscript, 28 Jul 1993.
251. D.M. Bressoud, Factorization and Primal- 263. E.F. Brickell, J.C. Lagarias, and A.M.
Odlyzko, “Evaluation of the Adleman
ity Testing, Springer-Verlag, 1989.
252. E.F. Brickell, “A Fast Modular Multiplica- Attack of Multiple Iterated Knapsack
tion Algorithm with Applications to Two Cryptosystems,” Advances in Cryptology:




Page 683
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


Proceedings of Crypto 83, Plenum Press, Advances in Cryptology-AUSCRYPT ˜90
1984, pp. 39-42. Proceedings, Springer-Verlag. 1990, pp.
264. E.F. Brickell, P.J. Lee, and Y. Yacobi, 221-228.
“Secure Audio Teleconference,” Advances 275. L. Brown and J. Seberry, “On the Design of
in Cryptology-CRYPTO ˜87 Proceedings, Permutation P in DES Type Cryptosys-
Springer-Verlag, 1988, pp. 418426. terns,” Advances in Cryptology-EURO-
265. E.F. Brickell and KS. McCurley, “An Inter- CRYPT ˜89 Proceedings, Springer-Verlag,
active Identification Scheme Based on 1990, pp. 696-705.
Discrete Logarithms and Factoring,” 276. W. Brown, “A Quantum Leap in Secret
Advances in Cryptology-EUROCRYPT Communications,” New Scientist, n.
˜90 Proceedings, Springer-Verlag, 1991, pp. 1585,30 Jan 1993, p. 21.
63-71. 277. J.O. Brtier, “On Pseudo Random Sequences
266. E.F. Brickell, J.H. Moore, and M.R. Purtill, as Crypto Generators,” Proceedings of the
“Structure in the S-Boxes of the DES,” International Zurich Seminar on Digital
Advances in Cryptology-CRYPTO ˜86 Communication, Switzerland, 1984.
Proceedings, Springer-Verlag 1987, pp. 278. L. Brynielsson “On the Linear Complexity
3-8. of Combined Shift Register Sequences,”
267. E.F. Brickell and A.M. Odlyzko, “Crypt- Advances in Cryptology-EUROCRYPT
analysis: A Survey of Recent Results,” PIO- ˜85, Springer-Verlag, 1986, pp. 156-166.
ceedings of the IEEE, v. 76, n. 5, May 1988, 279. J. Buchmann, J. Loho, and J. Zayer, “An
pp. 578-593. Implementation of the General Number
268. E.F. Brickell and A.M. Odlyzko, “Crypt- Field Sieve,” Advances in Cryptology-
analysis: A Survey of Recent Results,” CRYPTO ˜93 Proceedings, Springer-Verlag,
Contemporary Cryptology: The Science of 1994, pp. 159-165.
Information Integrity, G.J. Simmons, ed., 280. M. Burmester and Y. Desmedt, “Broadcast
IEEE Press, 1991, pp. 501-540. Interactive Proofs,” Advances in Cryp-
269. E.F. Brickell and G.J. Simmons, “A Status tology-EUROCRYPT ˜91 Proceedings,
Report on Knapsack Based Public Key Springer-Verlag, 1991, pp. 81-95.
Cryptosystems,” Congressus Numeran- 281. M. Burmester and Y. Desmedt, “A Secure
tium, v. 7, 1983, pp. 3-72. and Efficient Conference Key Distribution
270. E.F. Brickell and D.R. Stinson, “The Detec- System,” Advances in Cryptology-
tion of Cheaters in Threshold Schemes,” EUROCRYPT ˜94 Proceedings, Springer-
Advances in Cryptology-CRYPTO ˜88 Verlag, 1995, to appear.
Proceedings, Springer-Verlag, 1990, pp. 282. D. Burnham, “NSA Seeking 500,000
564-577. ˜Secure™ Telephones,” The New York
271. A.G. Broscius and J.M. Smith, “Exploiting Times, 6 Ott 1994.
Parallelism in Hardware Implementation 283. M. Burrows, M. Abadi, and R. Needham,
of the DES,” Advances in Cryptology- “A Logic of Authentication,” Research
CRYPTO ˜91 Proceedings, Springer-Verlag, Report 39, Digital Equipment Corp. Sys-
1992, pp. 367-376. tems Research Center, Feb 1989.
272. L. Brown, M. Kwan, J. Pieprzyk, and J. 284. M. Burrows, M. Abadi, and R. Needham,
Seberry, “Improving Resistance to Differ- “A Logic of Authentication,” ACM Trans-
ential Cryptanalysis and the Redesign of actions on Computer Systems, v. 8, n. 1,
LOKI,” Advances in Cryptology-ASIA- Feb 1990, pp. 1836.
CRYPT ˜91 Proceedings, Springer-Verlag, 285. M. Burrows, M. Abadi, and R. Needham,
1993, pp. 36-50. “Rejoinder to Nessett,” Operating System
273. L. Brown, J. Pieprzyk, and J. Seberry, Review, v. 20, n. 2, Apr 1990, pp. 39-40.
“LOKI: A Cryptographic Primitive for 286. J.J.Cade, “A Modification of a Broken Pub-
Authentication and Secrecy lic-Key Cipher,” Advances in Cryptol-
Applications,” Advances in Cryptology- ogy-CRYPTO ˜86 Proceedings, Springer-
AUSCRYPT ˜90 Proceedings, Springer- Verlag, 1987, pp. 64-83.
Verlag, 1990, pp. 229-236. 287. T.R. Cain and A.T. Sherman, “How to
274. L. Brown, J. Pieprzyk, and J. Seberry, “Key Break Gifford™s Cipher,” Proceedings of
Scheduling in DES Type Cryptosystems,” the 2nd Annual ACM Conference on




Page 684
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page



300. J.M. Carroll, “The Three Faces of Informa-
Computer and Communications Security,
tion Security,” Advances in Cryptology-
ACM Press, 1994, pp. 198-209.
AUSCRYPT ˜90 Proceedings, Springer-
288. C. Calvelli and V. Varadharajan, “An Anal-
Verlag, 1990, pp. 433-450.
ysis of Some Delegation Protocols for Dis-
301. J.M. Carroll, ” ˜Do-it-yourself™ Cryptogra-
tributed Systems,” Proceedings of the
phy,” Computers d Security, v. 9, n. 7,
Computer Security Foundations Work-
Nov 1990, pp. 613-619.
shop V, IEEE Computer Society Press,
302. T.R. Caron and R.D. Silverman, “Parallel
1992, pp. 92-l 10.
the Quadratic
Implementation of
289. J.L. Camenisch, J.-M. Piveteau, and M.A.
Scheme,” Journal of Supercomputing, v. 1,
Stadler, “An Efficient Electronic Payment
n. 3, 1988, pp. 273-290.
System Protecting Privacy,” Computer
303. CCITT, Draft Recommendation X.509,
Security-ESORICS 94, Springer-Verlag,
“The Directory-Authentication Frame-
1994, pp. 207-215.
work,” Consultation Committee, Interna-
290. P. Camion and J. Patarin, “The Knapsack
tional Telephone and Telegraph, Inter-
Hash Function Proposed at Crypto ˜89 Can
national Telecommunications Union,
Be Broken,” Advances in Cryptology-
Geneva, 1987.
EUROCRYPT ˜91, Springer-Verlag, 1991,
304. CCITT, Recommendation X.509, “The
pp. 39-53.
Directory-Authentication Framework,”
291. C.M. Campbell, “Design and Specification
Consultation Committee, International
of Cryptographic Capabilities,” IEEE Com-
Telephone and Telegraph, International
puter Society Magazine, v. 16, n. 6, Nov
Telecommunications Union, Geneva, 1989.
1978, pp. 15-19.
305. CCITT, Recommendation X.800, “Secu-
292. E.A. Campbell, R. Safavi-Naini, and P.A.
rity Architecture for Open Systems Inter-
Pleasants, “Partial Belief and Probabilistic
connection for CCIlT Applications,”
Reasoning in the Analysis of Secure Proto-
International Telephone and Telegraph,
cols,” Proceedings of the Computer Secu-
International Telecommunications Union,
rity Foundations Workshop V, IEEE Com-
Geneva, 1991.
puter Society Press, 1992, pp. 92-l 10.
306. F. Chabaud, “On the Security of Some
293. K.W. Campbell and M.J. Wiener, “DES Is
Cryptosystems Based on Error-Correcting
Not a Group,” Advances in Cryptology-
Codes,” Advances in Cryptology-EURO-
CRYPTO ˜92 Proceedings, Springer-Verlag,
CRYPT ˜94 Proceedings, Springer-Verlag,
pp. 512-520.
294. Z.F. Cao and G. Zhao, “Some New MC 1995, to appear.
307. F. Chabaud and S. Vaudenay, “Links
Knapsack Cryptosystems,” CHINACRYPT
˜94, Xidian, China, 11-15 Nov 1994, pp. Between Differential and Linear Crypt-
analysis, ” Advances in Cryptology-
70-75. (In Chinese).
EUROCRYPT ˜94 Proceedings, Springer-
295. C. Carlet, “Partially-Bent Functions,”
Verlag, 1995, to appear.
Advances in Cryptology-CRYPTO ˜92
308. W.G. Chambers and D. Gollmann, “Gen-
Proceedings, Springer-Verlag, 1993, pp.
erators for Sequences with Near-Maximal
280-291.
C. Carlet, “Partially Bent Functions,” Linear Equivalence,” IEE Proceedings, V.
296.
135, Pt. E, n. 1, Jan 1988, pp. 67-69.
Designs, Codes and Cryptography, v. 3,
309. W.G. Chambers and D. Gollmann, “Lock-
1993, pp. 135-145.
297. C. Carlet, “Two New Classes of Bent In Effect in Cascades of Clock-Controlled
Functions” Advances in Cryptology- Shirt Registers,” Advances in Cryptol-
EUROCRYPT ˜93 Proceedings, Springer- ogy-EUROCRYPT ˜88 Proceedings,
Springer-Verlag, 1988, pp. 331343.
Verlag, 1994, pp. 77-101.
310. A. Chan and R. Games, “On the Linear
298. C. Carlet, J. Seberry, and X.M. Zhang,
“Comments on ˜Generating and Counting Span of Binary Sequences from Finite
Geometries,” Advances in Cryptology-
Binary Bent Sequences,“™ IEEE Transac-
tions on Information Theory, v. IT-40, n. 2, CRYPTO ˜86 Proceedings, Springer-Verlag,
1987, pp. 405-417.
Mar 1994, p. 600.
311. J.P.Chandler, D.C. Arrington, D.R. Berkel-
299. J.M. Carroll, Computer Security, 2nd edi-
hammer, and W.L. Gill, “Identification and
tion, Butterworths, 1987.




Page 685
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


Analysis of Foreign Laws and Regulations 321. D. Chaum, “The Dining Cryptographers
Pertaining to the Use of Commercial Problem: Unconditional Sender and
Encryption Products for Voice and Data Receiver Untraceability,” fournal of Cryp-
Communications,” National Intellectual tology, v. 1, n. 1, 1988, pp. 65-75.
Property Law Institute, George Washing- 322. D. Chaum, “Elections with Uncondition-
ton University, Washington, D.C., Jan ally Secret Ballots and Disruptions Equiva-
1994. lent to Breaking RSA,” Advances in Cryp-
312. C.C. Chang and S.J. Hwang, “Crypto- tology-EUROCRYPT ˜88 Proceedings,
graphic Authentication of Passwords,” Springer-Verlag, 1988, pp. 177-18 1.
Proceedings of the 25th Annual 1991 IEEE 323. D. Chaum, “Blind Signature Systems,”
International Carnahan Conference on U.S. Patent #4,759,063, 19 Jul 1988.
Security Technology, Taipei, Taiwan, 13 324. D. Chaum, “Blind Unanticipated Signa-
Ott 1991, pp. 126-130. ture Systems,” U.S. Patent #4,759,064, 19
313. C.C. Chang and S.J. Hwang, “A Strategy Jul 1988.
for Transforming Public-Key Cryptosys- 325. D. Chaum, “Online Cash Checks,”
terns into Identity-Based Cryptosystems,” Advances in Cryptology-EUROCRYPT
Proceedings of the 25th Annual 1991 IEEE ˜89 Proceedings, Springer-Verlag, 1990, pp.
International Carnahan Conference on 288-293.
Security Technology, Taipei, Taiwan, 13 326. D. Chaum, “One-Show Blind Signature
Ott 1991, pp. 68-72. Systems,” U.S. Patent #4,914,698, 3 Apr
314. C.C. Chang and C.H. Lin, “An ID-Based 1990.
Signature Scheme Based upon Rabin™s Pub- 327. D. Chaum, “Undeniable Signature Sys-
lic Key Cryptosystem,” Proceedings of the tems,” U.S. Patent #4,947,430, 7 Aug 1990.
25th Annual 1991 IEEE International Car- 328. D. Chaum, “Returned-Value Blind Signa-
nahan Conference on Security Technol- ture Systems,” U.S. Patent #4,949,380, 14
ogy, Taipei, Taiwan, l-3 Ott 1991, pp. Aug 1990.
139-141. 329. D. Chaum, “Zero-Knowledge Undeniable
C. Charnes and J. Pieprzyk, “Attacking the
315. Signatures,” Advances in Cryptology-
SLp Hashing Scheme,” Advances in Cryp- EUROCRYPT ˜90 Proceedings, Springer-
tology-ASIACRYPT ˜94 Proceedings, Verlag, 1991, pp. 458-464.
Springer-Verlag, 1995, pp. 322r330. 330. D. Chaum, “Group Signatures,” Advances
316. D. Chaum, “Untraceable Electronic in Cryptology-EUROCRYPT ˜91 PIO-
Mail, Return Addresses, and Digital ceedings, Springer-Verlag, 1991, pp.
Pseudonyms,” Communications of the 257-265.
ACM, v. 24, n. 2, Feb 1981, pp. 84-88. 331. D. Chaum, “Unpredictable Blind Signa-
317. D. Chaum, “Blind Signatures for Untrace- ture Systems,” U.S. Patent #4,991,210, 5
able Payments,” Advances in Cryptology: Feb 1991.
Proceedings of Crypto 82, Plenum Press, 332. D. Chaum, “Achieving Electronic Pri-
1983, pp. 199-203. vacy,” Scientific American, v. 267, n. 2,
318. D. Chaum, “Security Without Identifica- Aug 1992, pp. 96-101.
tion: Transaction Systems to Make Big 333. D. Chaum, “Designated Confirmer Signa-
Brother Obsolete,” Communications of tures,” Advances in Cryptology-EURO-
the ACM, v. 28, n. 10, Ott 1985, pp. CRYPT ˜94 Proceedings, Springer-Verlag,
1030-1044. 1995, to appear.
319. D. Chaum, “Demonstrating that a Public 334. D. Chaum, C. Crepeau, and I.B. Damgird,
Predicate Can Be Satisfied without Reveal- “Multiparty Unconditionally Secure Pro-
ing Any Information about How,” tocols,” Proceedings of the 20th ACM
Advances in Cryptology-CRYPTO ˜86 Symposium on the Theory of Computing
Proceedings, Springer-Verlag, 1987, pp. 1988, pp. 11-19.
159-199. 335. D. Chaum, B. den Boer, E. van Heyst, S.
320. D. Chaum, “Blinding for Unanticipated Mjalsnes, and A. Steenbeek, “Efficient
Signatures,” Advances in Cryptology- Offline Electronic Checks,” Advances in
EUROCRYPT ˜87 Proceedings, Springer- Cryptology-EUROCRYPT ˜89 Proceed-
Verlag, 1988, pp. 227-233. ings, Springer-Verlag, 1990, pp. 294-301.




Page 686
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


ers to Abstain,” CHINACRYPT ˜94, Xid-
336. D. Chaum and J.-H. Evertse, “Cryptanaly-
ian, China, 11-15 Nov 1994, pp. 100-107.
sis of DES with a Reduced Number of
L. Chen and T.P. Pedersen “New Group
348.
Rounds; Sequences of Linear Factors in
Signature Schemes,” Advances in Cryp-
Block Ciphers,” Advances in Cryptology-
tology-EUROCRYPT ˜94 Proceedings,
CRYPTO ˜85 Proceedings, Springer-Verlag,
Springer-Verlag, 1995, to appear.
1986, pp. 192-211.
J. Chenhui, “Spectral Characteristics of
349.
337. D. Chaum, J.-H. Evertse, and J. van de
Partially-Bent Functions,” CHINACRYPT
Graff, “An Improved Protocol for Demon-
˜94, Xidian, China, 11-15 Nov 1994, pp.
strating Possession of Discrete Loga-
48-5 1.
rithms and Some Generalizations,” Ad-
350. V. Chepyzhov and B. Smeets, “On a Fast
vances in Cryptology-EUROCRYPT ˜87
Correlation Attack on Certain Stream
Proceedings, Springer-Verlag, 1988, pp.
Ciphers, ” Advances in Cryptology-
127-141.
EUROCRYPT ˜91 Proceedings, Springer-
338. D. Chaum, J.-H. Evertse, J. van de Graff,
Verlag, 1991, pp. 176-185.
and R. Peralta, “Demonstrating Possession
351. T.C. Cheung, “Management of PEM Pub-
of a Discrete Logarithm without Revealing
lic Key Certificates Using X.500 Directory
It,” Advances in Cryptology-CRYPTO
Service: Some Problems and Solutions,”
˜86 Proceedings, Springer-Verlag, 1987, pp.
Proceedings of the Internet Society 1994
200-212.
Workshop on Network and Distributed
339. D. Chaum, A. Fiat, and M. Naor,
System Security, The Internet Society,
“Untraceable Electronic Cash,” Advances
in Cryptology-CRYPTO ˜88 Proceedings, 1994, pp. 35-42.
352. G.C. Chiou and WC. Chen, “Secure
Springer-Verlag, 1990, pp. 319327.
Broadcasting Using the Secure Lock,” IEEE
340. D. Chaum and T. Pedersen, “Transferred
Cash Grows in Size,” Advances in Cryp- Transactions on Software Engineering, v.
tology-EUROCRYPT ˜92 Proceedings, SE-15, n. 8, Aug 1989, pp. 929-934.
Springer-Verlag, 1993, pp. 391-407. 353. Y.J. Choie and H.S. Hwoang, “On the
Cryptosystem Using Elliptic Curves,” Pro-
341. D. Chaum and T. Pedersen, “Wallet
ceedings of the 1993 Korea-fapan Work-
Databases with Observers,” Advances in
Cryptology-CRYPTO ˜92 Proceedings, shop on Information Security and Cryp-
Springer-Verlag, 1993, pp. 89-105. tography, Seoul, Korea, 24-26 Ott 1993,
342. D. Chaum and I. Schaumuller-Bichel, eds., pp. 105-l 13.
Smart Card 2000, North Holland: Elsevier 354. B. Chor and 0. Goldreich, “RSA/Rabin
Science Publishers, 1989. Least Significant Bits are 1/2+l/poly(log N)
343. D. Chaum and H. van Antwerpen, “Unde- Secure,” Advances in Cryptology: Pro-
ceedings of CRYPTO 84, Springer-Verlag,
niable Signatures,” Advances in Cryptol-
ogy-CRYPTO ˜89 Proceedings, Springer- 1985, pp. 303313.
Verlag, 1990, pp. 212-216. 355. B. Char, S. Goldwasser, S. Micali, and B.
Awerbuch, “Verifiable Secret Sharing and
344. D. Chaum, E. van Heijst, and B. Pfitz-
mann, “Cryptographically Strong Undeni- Achieving Simultaneity in the Presence of
able Signatures, Unconditionally Secure Faults,” Proceedings of the 26th Annual
for the Signer,” Advances in Cryptology- IEEE Symposium on the Foundations of
CRYPTO ˜91 Proceedings, Springer-Verlag, Computer Science, 1985, pp. 383395.
1992, pp. 470-484. 356. B. Chor and R.L. Rivest, “A Knapsack Type
345. T.M. Chee, “The Cryptanalysis of a New Public Key Cryptosystem Based on Arith-
Public-Key Cryptosystem Based on Modu- metic in Finite Fields,” Advances in Cryp-
lar Knapsacks,” Advances in Cryptology- tology: Proceedings of CRYPTO 84,
CRYPTO ˜91 Proceedings, Springer-Verlag, Springer-Verlag, 1985, pp. 54-65.
1992, pp. 204-212. P. Christoffersson, S.-A. Ekahll, V. Fak, S.
357.
346. L. Chen, “Oblivious Signatures,” Com- Herda, P. Mattila, W. Price, and H.-O. Wid-
puter Security-ESORICS 94, Springer- man, Crypto Users™ Handbook: A Guide
Verlag, 1994, pp. 161-172. for Implementors of Cryptographic Protec-
347. L. Chen and M. Burminster, “A Practical tion in Computer Systems, North Holland:
Secret Voting Scheme which Allows Vot- Elsevier Science Publishers, 1988.




Page 687
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


371. D. Coppersmith, “The Real Reason for
358. R. Cleve, “Controlled Gradual Disclosure
Rivest™s Phenomenon,” Advances in
Schemes for Random Bits and Their Appli-
cations,” Advances in Cryptology- Cryptology-CRYPTO ˜85 Proceedings,
Springer-Verlag, 1986, pp. 535-536.
CRYPTO ˜89 Proceedings, Springer-Verlag.
1990, pp. 572-588. 372. D. Coppersmith, “Two Broken Hash Func-
359. J.D. Cohen, “Improving Privacy in Crypto- tions,” Research Report RD 18397, IBM
TJ. Watson Center, Ott 1992.
graphic Elections,” Yale University Com-
373. D. Coppersmith, “The Data Encryption
puter Science Department Technical
Report YALEU/DCS/TR-454, Feb 1986. Standard (DES) and Its Strength against
360. J.D. Cohen and M.H. Fischer, “A Robust Attacks,” Technical Report RC 18613,
IBM T.J. Watson Center, Dee 1992.
and Verifiable Cryptographically Secure
Election Scheme,” Proceedings of the 26th 374. D. Coppersmith, “The Data Encryption
Standard (DES) and its Strength against
Annual IEEE Symposium on the Founda-
tions of Computer Science, 1985, pp. Attacks,” IBM fournal of Research and
372-382. Development, v. 38, n. 3, May 1994, pp.
361. R. Cole, “A Model for Security in Dis- 243-250.
tributed Systems,” Computers and Secu- 375. D. Coppersmith, “Attack on the Crypto-
graphic Scheme NIKS-TAS,” Advances in
rity, v. 9, n. 4, Apr 1990, pp. 319330.
Cryptology-CRYPTO ˜94 Proceedings,
362. Comptroller General of the United States,
“Matter of National Institute of Standards Springer-Verlag 1994, pp. 294-307.
and Technology-Use of Electronic Data Coppersmith, personal
376. D.
Interchange Technology to Create Valid communication, 1994.
Obligations,” File B-245714, 13 Dee 1991. 377. D. Coppersmith and E. Grossman, “Gener-
363. M.S. Corm, letter to Joe Abernathy, ators for Certain Alternating Groups with
National Security Agency, Ser: Q43-11 l- Applications to Cryptography,” SIAM
92, 10 Jun 1992. Journal on Applied Mathematics, v. 29, n.
364. C. Connell, “An Analysis of NewDES: A 4, Dee 1975, pp. 624-627.
Modified Version of DES,” Cryptologia, v. 378. D. Coppersmith, H. Krawczyk, and Y.
14, n. 3, Jul 1990, pp. 217-223. Mansour, “The Shrinking Generator,”
365. S.A. Cook, “The Complexity of Theorem- Advances in Cryptology-CRYPTO ˜93
Proving Procedures,” Proceedings of the Proceedings, Springer-Verlag, 1994, pp.
3rd Annual ACM Symposium on the The- 22-39.
ory of Computing, 1971, pp. 151-158. 379. D. Coppersmith, A. Odlykzo, and R.
366. R.H. Cooper and W. Patterson, “A Gener- Schroeppel, “Discrete Logarithms in
alization of the Knapsack Method Using GF(p),” Algorithmica, v. 1, n. 1, 1986, pp.
Galois Fields,” Cryptologia, v. 8, n. 4, Ott 1-16.
1984, pp. 343-347. 380. D. Coppersmith and P. Rogaway, “Soft-
367. R.H. Cooper and W. Patterson, “RSA as a ware Efficient Pseudo Random Function
Benchmark for Multiprocessor Machines,” and the Use Thereof for Encryption,” U.S.
Advances in Cryptology-AUSCRYPT ˜90 Patent pending, 1995.
Proceedings, Springer-Verlag 1990, pp. 381. D. Coppersmith, J. Stern, and S. Vaudenay,
356-359. “Attacks on the Birational Signature
368. D. Coppersmith, “Fast Evaluation of Loga- Schemes,” Advances in Cryptology-
rithms in Fields of Characteristic Two,” CRYPTO ˜93 Proceedings, Springer-Verlag,
IEEE ˜Iransuctions on Information Theory, 1994, pp. 435-443.
v. 30, n. 4, Jul 1984, pp. 587-594. 382. V. Cordonnier and J.-J. Quisquater, eds.,
369. D. Coppersmith, “Another Birthday CARDIS ˜94-Proceedings of the First
Attack,” Advances in Cryptology- Smart Card Research and Advanced
CRYPTO ˜85 Proceedings, Springer-Verlag, Application Conference, Lille, France,
1986, pp. 14-17. 24-26 Ott 1994.
370. D. Coppersmith, “Cheating at Mental 383. C. Couvreur and J.-J.Quisquater, “An Intro-
Poker,” Advances in Cryptology- duction to Fast Generation of Large Prime
CRYPTO ˜85 Proceedings, Springer-Verlag, Numbers,” Philips fournal Research, v. 37,
1986, pp. 104-107. n. 5-6, 1982, pp. 231-264.




Page 688
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page




CRYPTO ˜88 Proceedings, Springer-Verlag,
384. C. Couvreur and J.-J.Quisquater, “An Intro-
1990, pp. 2-7.
duction to Fast Generation of Large Prime
396. C. Crepeau and L. Salvail, “Quantum Obliv-
Numbers,” Philips lournal Research, v. 38,
ious Mutual Identification,” Advances in
1983, p. 77.
Cryptology-EUROCRYPT ˜95 Proceed-
385. C. Coveyou and R.D. MacPherson,
ings, Springer-Verlag, 1995, pp. 133-146.
“Fourier Analysis of Uniform Random
397. A. Curiger, H. Bonnenberg, R. Zimmer-
Number Generators,” fournal of the ACM,
mann, N. Felber, H. Kaeslin and W. Ficht-
v. 14, n. 1, 1967, pp. 100-119.
ner, “VINCI: VLSI Implementation of the
386. T.M. Cover and R.C. King, “A Convergent
New Block Cipher IDEA,” Proceedings of
Gambling Estimate of the Entropy of
IEEE CICC ˜93, San Diego, CA, May 1993,
English,” IEEE Transactions on Informa-
pp. 15.5.1-15.5.4.
tion Theory, v. IT-24, n. 4, Jul 1978, pp.
398. A. Curiger and B. Stuber, “Specification for
413421.
the IDEA Chip,” Technical Report No.
387. R.J.F.Cramer and T.P. Pedersen, “Improved
92/03, Institut fiir Integrierte Systeme,
Privacy in Wallets with Observers,”
ETH Zurich, Feb 1992.
Advances in Cryptology-EUROCRYPT
399. T. Cusick, “Boolean Functions Satisfying a
˜93 Proceedings, Springer-Verlag. 1994, pp.
Higher Order Strict Avalanche Criterion,”
329343.
Advances in Cryptology-EUROCRYPT
388. R.E. Crandell, “Method and Apparatus for
˜93 Proceedings, Springer-Verlag, 1994, pp.
Public Key Exchange in a Cryptographic
102-l 17.
System,” U.S. Patent #5,159,632, 27 Ott
400. T.W. Cusick and M.C. Wood, “The
1992.
389. C. Crepeau, “A Secure Poker Protocol REDOC-II Cryptosystem,” Advances in
Cryptology-CRYPTO ˜90 Proceedings,
That Minimizes the Effect of Player Coali-
Cryptology- Springer-Verlag. 1991, pp. 545-563.
tions,” Advances in
401. Cylink Corporation, Cylink Corporation
CRYPTO ˜85 Proceedings, Springer-Verlag,
vs. RSA Data Security, Inc., Civil Action
1986, pp. 73-86.
No. C94-02332CW, United States District
390. C. Crepeau, “A Zero-Knowledge Poker
Court for the Northern District of Califor-
Protocol that Achieves Confidentiality of
the Players™ Strategy, or How to Achieve nia, 30 Jun 1994.
402. J. Daeman, “Cipher and Hash Function
an Electronic Poker Face,” Advances in
Design,” Ph.D. Thesis, Katholieke Univer-
Cryptology-CRYPTO ˜86 Proceedings,
Springer-Verlag, 1987, pp. 239-247. siteit Leuven, Mar 95.
403. J. Daeman, A. Bosselaers, R. Govaerts, and
391. C. Crepeau, “Equivalence Between Two
J. Vandewalle, “Collisions for Schnorr™s
Flavours of Oblivious Transfer,” Advances
Hash Function FFT-Hash Presented at
in Cryptology-CRYPTO ˜87 Proceedings,
crypt0 ˜91,” Advances in Cryptology-
Springer-Verlag, 1988, pp. 350-354.
ASIACRYPT ˜91 Proceedings, Springer-
392. C. Crepeau, “Correct and Private Reduc-
Verlag, 1993, pp. 477480.
tions among Oblivious Transfers,” Ph.D.
404.
dissertation, Department of Electrical J. Daeman, R. Govaerts, and J. Vandewalle,
Engineering and Computer Science, Mas- “A Framework for the Design of One-Way
Hash Functions Including Cryptanalysis of
sachusetts Institute of Technology, 1990.
393. C. Crepeau, “Quantum Oblivious Trans- Damgiird™s One-Way Function Based on
Cellular Automata,” Advances in Cryp-
fer,” Iournal of Modern Optics, v. 41, n. 12,
Dee 1994, pp. 2445-2454. tology-ASIACRYPT ˜91 Proceedings,
Springer-Verlag, 1993, pp. 82-96.
394. C. Crepeau and J. Kilian, “Achieving
405.
Oblivious Transfer Using Weakened Secu- J. Daeman, R. Govaerts, and J. Vandewalle,
rity Assumptions,” Proceedings of the “A Hardware Design Model for Crypto-
29th Annual Symposium on the Founda- graphic Algorithms,” ESORICS 92, Pro-
ceedings of the Second European Sympo-
tions of Computer Science, 1988, pp.
42-52. sium on Research in Computer Security,
Springer-Verlag, 1992, pp. 419-434.
395. C. Crepeau and J. Kilian, “Weakening
406. J. Daemen, R. Govaerts, and J. Vandewalle,
Security Assumptions and Oblivious
Transfer,” Advances in Cryptology- “Block Ciphers Based on Modular Arith-




Page 689
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


metic,” Proceedings of the 3rd Symposium ed., Oxford: Clarendon Press, 1993, pp.
on State and Progress of Research in Cryp 117-128.
418. LB. Damgard, P. Landrock and C. Pomer-
tography, Rome, Italy, 15-16 Feb 1993, pp.
80-89. ante, “Average Case Error Estimates for
J. Daemen, R. Govaerts, and J. Vandewalle, the Strong Probable Prime Test,” Mathe-
407.
“Fast Hashing Both in Hardware and Soft- matics of Computation, v. 61, n. 203, Jul
ware,” presented at the rump session of 1993, pp. 177-194.
CRYPTO ˜93, Aug 1993. 419. H.E. Daniels, Jr., letter to Datapro
408. J. Daeman, R. Govaerts, and J. Vandewalle, Research Corporation regarding CCEP, 23
“Resynchronization Weaknesses in Syn- Dee 1985.
chronous Stream Ciphers,” Advances in 420. H. Davenport, The Higher Arithmetic,
Cryptology-EUROCRYPT ˜93 Proceed- Dover Books, 1983.
ings, Springer-Verlag, 1994, pp. 159-167. 421. G.I. Davida, “Inverse of Elements of a
J. Daeman, R. Govaerts, and J. Vandewalle,
409. Galois Field,” Electronics Letters, v. 8, n.
“Weak Keys for IDEA,” Advances in 21, 19 Ott 1972, pp. 518-520.
Cryptology-CRYPTO ˜93 Proceedings, 422. G.I. Davida, “Hellman™s Scheme Breaks
Springer-Verlag, 1994, pp. 224-230. DES in Its Basic Form,” IEEE Spectrum, v.
J. Daemen, R. Govaerts, and J. Vandewalle,
410. 16, n. 7, Jul 1979, p. 39.
“A New Approach to Block Cipher 423. G.I. Davida, “Chosen Signature Cryptanal-
Design,” Fast Software Encryption, Cam- ysis of the RSA (MIT] Public Key Cryp-
bridge Security Workshop Proceedings, tosystem,” Technical Report TR-CS-82-2,
Springer-Verlag, 1994, pp. 1832. Department of EECS, University of Wis-
Z.-D. Dai, “Proof of Rueppel™s Linear Com-
411. consin, 1982.
plexity Conjecture,” IEEE Transactions on 424. G.I. Davida and G.G. Walter, “A Public
Information Theory, v. IT-32, n. 3, May Key Analog Cryptosystem,” Advances in
1986, pp. 440-443. Cryptology-EUROCRYPT ˜87 Proceed-
412. LB. Damgird, “Collision Free Hash Func- ings, Springer-Verlag, 1988, pp. 143-147.
tions and Public Key Signature Schemes,” 425. G.I. Davida, D. Wells, and J. Kam, “A
Advances in Cryptology-EUROCRYPT Database Encryption System with Sub-
˜87 Proceedings, Springer-Verlag, 1988, pp. keys,” ACM Transactions on Database
203-216. Systems, v. 6, n. 2, Jun 1981, pp. 312328.
413. I.B. Damgard, “Payment Systems and Cre- 426. D.W. Davies, “Applying the RSA Digital
dential Mechanisms with Provable Secu- Signature to Electronic Mail,” Computer,
rity Against Abuse by Individuals,” v. 16, n. 2, Feb 1983, pp. 55-62.
Advances in Cryptology-CRYPTO ˜88 427. D.W. Davies, “Some Regular Properties of
Proceedings, Springer-Verlag. 1990, pp. the DES,” Advances in Cryptology: Pro-
328335. ceedings of Crypto 82, Plenum Press, 1983,
414. I.B. Damgard, “A Design Principle for pp. 89-96.
Hash Functions,” Advances in Cryptol- 428. D.W. Davies, “A Message Authentication
ogy-CRYPTO ˜89 Proceedings, Springer- Algorithm Suitable for a Mainframe Com-
Verlag, 1990, pp. 416-427. puter,” Advances in Cryptology: Proceed-
415. I.B. Damgbrd, “Practical and Provably ings of Crypto 82, Springer-Verlag, 1985,
Secure Release of a Secret and Exchange of pp. 393-400.
Signatures,” Advances in Cryptology- 429. D.W. Davies and S. Murphy, “Pairs and
EUROCRYPT ˜93 Proceedings, Springer- Triplets of DES S-boxes,” Cryptologia, v. 8,
Verlag, 1994, pp. 200-217. n. 1, 1995, pp. l-25.
416. LB. Damgard and L.R. Knudsen, “The 430. D.W. Davies and G.I.P. Parkin, “The Aver-
Breaking of the AR Hash Function,” age Size of the Key Stream in Output Feed-
Advances in Cryptology-EUROCRYPT back Encipherment,” Cryptography, Pro-
˜93 Proceedings, Springer-Verlag, 1994, pp. ceedings of the Workshop on Cryptography,
286-292. Burg Feuerstein, Germany, March 29-April
417. LB. Damglrd and P. Landrock, “Improved 2, 1982, Springer-Verlag, 1983, pp. 263-279.
Bounds for the Rabin Primality Test,” 43 1. D.W. Davies and G.I.P. Parkin, “The Aver-
Cryptography and Coding III, M.J. Ganley, age Size of the Key Stream in Output Feed-




Page 690
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


442. E. Dawson and A. Clark, “Cryptanalysis of
back Mode,” Advances in Cryptology: Pro-
Universal Logic Sequences,” Advances in
ceedings of Crypto 82, Plenum Press, 1983,
Cryptology-EUROCRYPT ˜93 Proceed-
pp. 97-98.
ings, Springer-Verlag. to appear.
432. D.W. Davies and W.L. Price, “The Applica-
443. M.H. Dawson and S.E. Tavares, “An
tion of Digital Signatures Based on Public-
Expanded Set of Design Criteria for Substi-
Key Cryptosystems,” Proceedings of the
tution Boxes and Their Use in Strengthen-
Fifth International Computer Communi-
ing DES-Like Cryptosystems,” IEEE
cations Conference, Ott 1980, pp. 525-530.
Pacific Rim Conference on Communica-
433. D.W. Davies and W.L. Price, “The Applica-
tion of Digital Signatures Based on Public- tions, Computers, and Signal Processing,
Victoria, BC, Canada, 9-10 May 1991, pp.
Key Cryptosystems,” National Physical
Laboratory Report DNACS 39/80, Dee 191-195.
444. M.H. Dawson and S.E. Tavares, “An
1980.
Expanded Set of S-Box Design Criteria Based
434. D.W. Davies and W.L. Price, “Digital Sig-
nature-An Update,” Proceedings of Inter- on Information Theory and Its Relation to
Differential-like Attacks,” Advances in
national Conference on Computer Com-
munications, Sydney, Ott 1984, North Cryptology-EUROCRYPT ˜91 Proceed-
Holland: Elsevier, 1985, pp. 843-847. ings, Springer-Verlag. 1991, pp. 352-367.
445. C.A. Deavours, “Unicity Points in Crypt-
435. D.W. Davies and W.L. Price, Security for
Computer Networks, second edition, John analysis,” Cryptologia, v. 1, n. 1, 1977, pp.
Wiley & Sons, 1989. 46-68.
446. CA. Deavours, “The Black Chamber: A
436. M. Davio, Y. Desmedt, M. Fosseprez, R.
Govaerts, J. Hulsbrosch, P. Neutjens, P. Column; How the British Broke Enigma,”
Piret, J.-J.Quisquater, J. Vandewalle, and S. Cryptologia, v. 4, n. 3, Jul 1980, pp. 129-
Wouters, “Analytical Characteristics of 132.
the Data Encryption Standard,” Advances 447. CA. Deavours, “The Black Chamber: A
in Cryptology: Proceedings of Crypto 83, Column; La Methode des Batons,” Cryp-
Plenum Press, 1984, pp. 171-202. tologia, v. 4, n. 4. Ott 1980, pp. 240-247.
437. M. Davio, Y. Desmedt, J. Goubert, F. Hoor- 448. C.A. Deavours and L. Kruh, Machine
naert, and J.-J.Quisquater, “Efficient Hard- Cryptography and Modern Cryptanalysis,
ware and Software Implementation of the Norwood MA: Artech House, 1985.
DES,” Advances in Cryptology: Proceed- 449. J.M. DeLaurentis, “A Further Weakness in
ings of CRYPTO 84, Springer-Verlag 1985, the Common Modulus Protocol for the
pp. 144-146. RSA Cryptosystem,” Cryptologia, v. 8, n.
438. M. Davio, Y. Desmedt, and J.-J. 3, Jul 1984, pp. 253-259.
Quisquater, “Propagation Characteristics 450. P. Delsarte, Y. Desmedt, A. Odlyzko, and
of the DES,” Advances in Cryptology: Pro- P. Piret, “Fast Cryptanalysis of the
ceedings of EUROCRYPT 84, Springer- Matsumoto-Imai Public-Key Scheme,”
Verlag. 1985, 62-73. Advances in Cryptology: Proceedings of
439. D. Davis, R. Ihaka, and P. Fenstermacher, EUROCRYPT 84, Springer-Verlag 1985,
“Cryptographic Randomness from Air pp. 142-149.
Turbulence in Disk Drives,” Advances in 451. P. Delsarte and P. Piret, “Comment on
Cryptology-CRYPTO ˜94 Proceedings, ˜Extension of RSA Cryptostructure: A
Springer-Verlag, 1994, pp. 114-120. Galois Approach™,” Electronics Letters, v.
440. J.A. Davis, D.B. Holdbridge, and G.J. Sim- 18, n. 13,24 Jun 1982, pp. 582-583.
mons, “Status Report on Factoring (at the 452. R. DeMillo, N. Lynch, and M. Merritt,
Sandia National Laboratories),” Advances “Cryptographic Protocols,” Proceedings of
in Cryptology: Proceedings of CRYPTO 84, the 14th Annual Symposium on the The-
Springer-Verlag, 1985, pp. 183-215. ory of Computing, 1982, pp. 383400.
441. R.M. Davis, “The Data Encryption Stan- 453. R. DeMillo and M. Merritt, “Protocols for
dard in Perspective,” Computer Security Data Security,” Computer, v. 16, n. 2, Feb
and the Data Encryption Standard, 1983, pp. 39-50.
National Bureau of Standards Special Pub- 454. N. Demytko, “A New Elliptic Curve Based
lication 500-27, Feb 1978. Analogue of RSA,” Advances in Cryptol-




Page 691
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


˜93 Proceedings,
ogy-EUROCRYPT Manual, Chapter TD 81, Section 80,
Springer-Verlag 1994, pp. 40-49. Department of the Treasury, 16 Aug 1984.
469. Department of the Treasury, “Criteria and
455. D.E. Denning, “Secure Personal Comput-
ing in an Insecure Network,” Communi- Procedures for Testing, Evaluating, and
cations of the ACM, v. 22, n. 8, Aug 1979, Certifying Message Authentication Deci-
pp. 476-482. sions for Federal E.F.T. Use,” Department
456. D.E. Denning, Cryptography and Data of the Treasury, 1 May 1985.
470. Department of the Treasury, “Electronic
Security, Addison-Wesley, 1982.
D.E. Denning, “Protecting Public Keys and Funds and Securities Transfer Policy-
457.
Signature Keys,” Computer, v. 16, n. 2, Feb Message Authentication and Enhanced
1983, pp. 27-35. Security,” Order No. 106-09, Department
458. D.E. Denning, “Digital Signatures with of the Treasury, 2 Ott 1986.
RSA and Other Public-Key Cryptosys- 471. H. Dobbertin, “A Survey on the Construc-
terns,” Communications of the ACM, v. tion of Bent Functions,” K.U. Leuven
27, n. 4, Apr 1984, pp. 388392. Workshop on Cryptographic Algorithms,
D.E. Denning, “The Data Encryption Stan-
459. Springer-Verlag 1995, to appear.
dard: Fifteen Years of Public Scrutiny,” 472. B. Dodson and A.K. Lenstra, “NFS with
Proceedings of the Sixth Annual Com- Four Large Primes: An Explosive Experi-
puter Security Applications Conference, ment,” draft manuscript.
IEEE Computer Society Press, 1990. 473. D. Dolev and A. Yao, “On the Security of
D.E. Denning, “The Clipper Chip: A Tech-
460. Public-Key Protocols,” Communications
nical Summary,” unpublished manuscript, of the ACM, v. 29, n. 8, Aug 1983, pp.
21 Apr 1993. 198-208.
461. D.E. Denning and G.M. Sacco, “Time- 474. J. Domingo-Ferrer, “Probabilistic Authen-
stamps in Key Distribution Protocols,” tication Analysis,” CARDIS 94-Proceed-
Communications of the ACM, v. 24, n. 8, ings of the First Smart Card Research and
Aug 1981, pp. 533-536. Applications Conference, Lille, France,
462. D.E. Denning and M. Smid, “Key Escrow- 24-26 Ott 1994, pp. 49-60.
ing Today,” IEEE Communications Maga- 475. P. de Rooij, “On the Security of the Schnorr
zine, v. 32, n. 9, Sep 1994, pp. 58-68. Scheme Using Preprocessing,” Advances
463. T. Denny, B. Dodson, A.K. Lenstra, and in Cryptology-EUROCRYPT ˜91 Proceed-
M.S. Manasse, “On the Factorization of ings, Springer-Verlag, 1991, pp. 71-80.
RSA-120,” Advances in Cryptology- 476. A. De Santis, G. Di Crescenzo, and G. Per-
CRYPTO ˜93 Proceedings, Springer-Verlag, siano, “Secret Sharing and Perfect Zero
1994, pp. 166-174. Knowledge,” Advances in Cryptology-
464. W.F. Denny, “Encryptions Using Linear CRYPTO ˜93 Proceedings, Springer-Verlag,
and Non-Linear Codes: Implementations 1994, pp. 73-84.
and Security Considerations,” Ph.D. dis- 477. A. De Santis, S. Micali, and G. Persiano,
sertation, The Center for Advanced Com- “Non-Interactive Zero-Knowledge Proof
puter Studies, University of Southern Systems,” Advances in Cryptology-
Louisiana, Spring 1988. CRYPTO ˜87 Proceedings, Springer-Verlag,
465. Department of Defense, “Department of 1988, pp. 52-72.
Defense Trusted Computer System Evalu- 478. A. De Santis, S. Micali, and G. Persiano,
ation Criteria,” DOD 5200.28-STD, Dee “Non-Interactive Zero-Knowledge with
1985. Preprocessing,” Advances in Cryptology-
466. Department of State, “International Traf- CRYPTO ˜88 Proceedings, Springer-Verlag,
fic in Arms Regulations (ITAR),” 22 CFR 1990, pp. 269-282.
120-130, Office of Munitions Control, 479. Y. Desmedt, “What Happened with Knap-
Nov 1989. sack Cryptographic Schemes” Perfor-
467. Department of State, “Defense Trade Reg- mance Limits in Communication, Theory
ulations,” 22 CFR 120-130, Office of and Practice, NATO ASI Series E: Applied
Defense Trade Controls, May 1992. Sciences, v. 142, Kluwer Academic Pub-
468. Department of the Treasury, “Electronic lishers, 1988, pp. 113-134.
Funds and Securities Transfer Policy, ” 480. Y. Desmedt, “Subliminal-Free Authentica-
Department of the Treasury Directives tion and Signature,” Advances in Cryptol-




Page 692
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page



493. W. Diffie, “Authenticated Key Exchange
ogy-EUROCRYPT ˜88 Proceedings,
and Secure Interactive Communication,”
Springer-Verlag, 1988, pp. 23-33.
Proceedings of SECURICOM ˜90, 1990.
481. Y. Desmedt, “Abuses in Cryptography and
494. W. Diffie, “The First Ten Years of Public-
How to Fight Them,” Advances in Cryptol-
ogy-CRYPTO ˜88 Proceedings, Springer- Key Cryptography,” in Contemporary
Cryptology: The Science of Information
Verlag 1990, pp. 375-389.
Integrity, G.J. Simmons, ed., IEEE Press,
482. Y. Desmedt and M. Burrnester, “An Effi-
cient Zero-Knowledge Scheme for the 1992, pp. 135-175.
495. W. Diffie and M.E. Hellman, “Multiuser
Discrete Logarithm Based on Smooth
Cryptographic Techniques, )I Proceedings
Numbers,” Advances in Cryptology-
of AFIPS National Computer Conference,
ASIACRYPT ˜91 Proceedings, Springer-
1976, pp. 109-l 12.
Verlag, 1993, pp. 360367.
496. W. Diffie and M.E. Hellman, “New Direc-
483. Y. Desmedt and Y. Frankel, “Threshold
tions in Cryptography,” IEEE Transactions
Cryptosystems,” Advances in Cryptol-
ogy-CRYPTO ˜89 Proceedings, Springer- on Information Theory, v. IT-22, n. 6, Nov
Verlag, 1990, pp. 307315. 1976, pp. 644-654.
497. W. Diffie and M.E. Hellman, “Exhaustive
484. Y. Desmedt and Y. Frankel, “Shared Gen-
Cryptanalysis of the NBS Data Encryption
eration of Authentication and Signatures,”
Standard,” Computer, v. 10, n. 6, Jun 1977,
Advances in Cryptology-CRYPTO ˜91
Proceedings, Springer-Verlag, 1992, pp. pp. 74-84.
498. W. Diffie and M.E. Hellman, “Privacy and
457-469.
Authentication: An Introduction to Cryp-
485 Y. Desmedt, C. Goutier, and S. Bengio,
tography,” Proceedings of the IEEE, v. 67,
“Special Uses and Abuses of the Fiat-
Shamir Passport Protocol,” Advances in n. 3, Mar 1979, pp. 397-427.
499. W. Diffie, L. Strawczynski, B. O™Higgins,
Cryptology-CRYPTO ˜87 Proceedings,
and D. Steer, “An ISDN Secure Telephone
Springer-Verlag, 1988, pp. 2139.
Unit,” Proceedings of the National Tele-
486 Y. Desmedt and A.M. Odlykzo, “A Chosen
communications Forum, v. 41, n. 1, 1987,
Text Attack on the RSA Cryptosystem and
Some Discrete Logarithm Problems,” pp. 473-477.
Advances in Cryptology-CRYPTO ˜85 500. W. Diffie, P.C. van Oorschot, and M.J.
Proceedings, Springer-Verlag, 1986, pp. Wiener, “Authentication and Authenti-
516-522. cated Key Exchanges,” Designs, Codes and
487. Y. Desmedt, J.-J. Quisquater, and M. Cryptography, v. 2, 1992, 107-125.
Davio, “Dependence of Output on Input in 501. C. Ding, “The Differential Cryptanalysis
DES: Small Avalanche Characteristics,” and Design of Natural Stream Ciphers,”
Advances in Cryptology: Proceedings of Fast Software Encryption, Cambridge
CRYPTO 84, Springer-Verlag, 1985, pp. Security Workshop Proceedings, Springer-
359376. Verlag 1994, pp. 101-l 15.
488. Y. Desmedt, J. Vandewalle, and R. Go- 502 C. Ding G. Xiao, and W. Shan, The Stabil-
vaerts, “Critical Analysis of the Security of ity Theory of Stream Ciphers, Springer-
Knapsack Public Key Algorithms,” IEEE Verlag, 1991.
Transactions on Information Theory, v. IT- 503. A. Di Porto and W. Wolfowicz, “VINO: A
30, n. 4, Jul 1984, pp. 601-611. Block Cipher Including Variable Permuta-
489. Y. Desmedt and M. Yung, “Weaknesses of tions,” Fast Software Encryption, Cam-
Undeniable Signature Schemes,” Ad- bridge Security Workshop Proceedings,
vances in Cryptology-EUROCRYPT ˜91 Springer-Verlag, 1994, pp. 205-210.
Proceedings, Springer-Verlag 1991, pp. 504. B. Dixon and A.K. Lenstra, “Factoring Inte-
205-220. gers Using SIMD Sieves,” Advances in
490. W. Diffie, lecture at IEEE Information The- Cryptology-EUROCRYPT ˜93 Proceed-
ory Workshop, Ithaca, N.Y., 1977. ings, Springer-Verlag, 1994, pp. 2839.
491. W. Diffie, “Cryptographic Technology: Fif- 505. J.D. Dixon, “Factorization and Primality
teen Year Forecast,” BNR Inc., Jan 1981. Tests,” American Mathematical Monthly,
492. W. Diffie, “The First Ten Years of Public- v. 91, n. 6, 1984, pp. 333-352.
Key Cryptography,” Proceedings of the 506. D. Dolev and A. Yao, “On the Security of
IEEE, v. 76, n. 5, May 1988, pp. 560-577. Public Key Protocols,” Proceedings of the




Page 693
Prev. Chapter Home Previous Page
Next Page
Prev. page
Next Page
References


519. T. ElGamal, “A Public-Key Cryptosystem
22nd Annual Symposium on the Founda-
and a Signature Scheme Based on Discrete
tions of Computer Science, 1981, pp. 350-
Logarithms,” IEEE Transactions on Infor-
357.
mation Theory, v. IT-31, n. 4, 1985, pp.
507. L.X. Duan and C.C. Nian, “Modified Lu-
469472.
Lee Cryptosystems,” Electronics Letters,
520. T. ElGamal, “On Computing Logarithms
v. 25, n. 13, 22 Jun 1989, p. 826.
Over Finite Fields,” Advances in Cryptol-
508. R. Durstenfeld, “Algorithm 235: Random
ogy-CRYPTO ˜85 Proceedings, Springer-
Permutation,” Communications of the
Verlag, 1986, pp. 39tiO2.
ACM, v. 7, n. 7, Jul 1964, p. 420.
521. T. ElGamal and B. Kaliski, letter to the edi-
509. S. Dusse and B. Kaliski, Jr., “A Crypto-
tor regarding LUC, Dr. Dobb™s Tournal, v.
Library for the Motorola
graphic
18, n. 5, May 1993, p. 10.
DSP56000,” Advances in Cryptology-
522. T. Eng and T. Okamoto, “Single-Term
EUROCRYPT ˜90 Proceedings, Springer-
Divisible Electronic Coins,” Advances in
Verlag, 1991, pp. 230-244.
Cryptology-EUROCRYPT ˜94 Proceed-
510. C. Dwork and L. Stockmeyer, “Zero-
ings, Springer-Verlag, 1995, to appear.
Knowledge with Finite State Verifiers,”
523. M.H. Er, D.J. Wang, A.A. Sethu, and K.S.
Advances in Cryptology-CRYPTO ˜88
Ngeow, “Design and Implementation of
Proceedings, Springer-Verlag, 1990, pp.
RSA Cryptosystem Using Multiple DSP
71-75.
Chips,” 1991 IEEE International Sympo-
511. D.E. Eastlake, S.D. Cracker, and J.I.
sium on Circuits and Systems, v. 1, Singa-
Schiller, “Randomness Requirements for
pore, 11-14 Jun 1991, pp. 49-52.
Security,” RFC 1750, Dee 1994.
524. D. Estes, L.M. Adlernan, K. Konpella, K.S.
512. H. Eberle, “A High-Speed DES Implemen-
McCurley, and G.L. Miller, “Breaking the
tation for Network Applications,”
Ong-Schnorr-Shamir Signature Schemes
Advances in Cryptology-CRYPTO ˜92
for Quadratic Number Fields,” Advances
Proceedings, Springer-Verlag, pp. 521-539.
in Cryptology-CRYPTO ˜85 Proceedings,
J. Edwards, “Implementing Electronic
513.
Poker: A Practical Exercise in Zero- Springer-Verlag, 1986, pp. 3-13.
525. ETEBAC, “8changes TklCmatiques Entre
Knowledge Interactive Proofs,” Master™s
thesis, Department of Computer Science, Les Banques et Leurs Clients,” Standard
ETEBAC 5, ComitB FranGais d™organisa-
University of Kentucky, May 1994.
tion et de Normalisation Bancaires, Apr
514. W.F. Ehrsam, C.H.W. Meyer, R.L. Powers,
1989. (In French.)
J.L. Smith, and W.L. Tuchman, “Product
Block Cipher for Data Security,” U.S. 526. A. Evans, W. Kantrowitz, and E. Weiss, “A
User Identification Scheme Not Requiring
Patent #3,962,539, 8 Jun 1976.
Secrecy in the Computer,” Communica-
515. W.F. Ehrsam, C.H.W. Meyer, and W.L.
Tuchman, “A Cryptographic Key Manage- tions of the ACM, v. 17, n. 8, Aug 1974, pp.
ment Scheme for Implementing the Data 437472.
527. S. Even and 0. Goldreich, “DES-Like
Encryption Standard,” IBM Systems Jour-
Functions Can Generate the Alternating
nal, v. 17, n. 2, 1978, pp. 106125.
516. R. Eier and H. Lagger, “Trapdoors in Knap- Group,” IEEE lkansactions on Informa-
sack Cryptosystems,” Lecture Notes in tion Theory, v. IT-29, n. 6, Nov 1983, pp.
Computer Science 149; Cryptography- 863-865.
Proceedings, Burg Feuerstein 1982, 528. S. Even and 0. Goldreich, “On the Power
Springer-Verlag, 1983, pp. 316-322. of Cascade Ciphers,” ACM Transactions
517. A.K. Ekert, “Quantum Cryptography on Computer Systems, v. 3, n. 2, May
Based on Bell™s Theorem,” Physical 1985, pp. 108-116.
Review Letters, v. 67, n. 6, Aug 1991, pp. 529. S. Even, 0. Goldreich, and A. Lempel, “A
661-663. Randomizing Protocol for Signing Con-

<<

. 4
( 8)



>>