references.pdf

(448 KB) Pobierz
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van
Oorschot, and S. Vanstone, CRC Press, 1996.
For further information, see www.cacr.math.uwaterloo.ca/hac
CRC Press has granted the following specic permissions for the electronic version of this
book:
Permission is granted to retrieve, print and store a single copy of this chapter for
personal use. This permission does not extend to binding multiple chapters of
the book, photocopying or producing copies for other than personal use of the
person creating the copy, or making electronic copies available for retrieval by
others without prior permission in writing from CRC Press.
Except where over-ridden by the specic permission above, the standard copyright notice
from CRC Press applies to this electronic version:
Neither this book nor any part may be reproduced or transmitted in any form or
by any means, electronic or mechanical, including photocopying, microlming,
and recording, or by any information storage or retrieval system, without prior
permission in writing from the publisher.
The consent of CRC Press does not extend to copying for general distribution,
for promotion, for creating new works, or for resale. Specic permission must be
obtained in writing from CRC Press for such copying.
c
1997 by CRC Press, Inc.
864445020.021.png 864445020.022.png
References
[1] M. A BADI AND R. N EEDHAM , “Prudent en-
gineering practice for cryptographic proto-
cols”, DEC SRC report #125, Digital Equip-
ment Corporation, Palo Alto, CA, 1994.
[2] M. A BADI AND M.R. T UTTLE , “A seman-
tics for a logic of authentication”, Proceed-
ings of the Tenth Annual ACM Symposium
on Principles of Distributed Computing , 201–
216, 1991.
[3] C. A DAMS , “Symmetric cryptographic sys-
tem
[11] L.M. A DLEMAN AND J. D E M ARRAIS ,“A
subexponential algorithm for discrete loga-
rithms over all finite fields”, Mathematics of
Computation , 61 (1993), 1–15.
[12] L.M. A DLEMAN ,J.D E M ARRAIS , AND M.-
D. H UANG , “A subexponential algorithm for
discrete logarithms over the rational subgroup
of the Jacobians of large genus hyperelliptic
curves over finite fields”, Algorithmic Number
Theory (LNCS 877) , 28–40, 1994.
[13] L.M. A DLEMAN AND M.-D. A. H UANG ,
Primality Testing and Abelian Varieties Over
Finite Fields , Springer-Verlag, Berlin, 1992.
[14] L.M. A DLEMAN AND H.W. L ENSTRA J R .,
“Finding irreducible polynomials over finite
fields”, Proceedings of the 18th Annual ACM
Symposium on Theory of Computing , 350–
355, 1986.
[15] L.M. A DLEMAN AND K.S. M C C URLEY ,
“Open problems in number theoretic com-
plexity,
for
data
encryption”,
U.S.
Patent
#
5,511,123, 23 Apr 1996.
[4] , “IDUP and SPKM: Developing
public-key-based APIs and mechanisms for
communication security services”, Proceed-
ings of the Internet Society Symposium on Net-
work and Distributed System Security , 128–
135, IEEE Computer Society Press, 1996.
[5] C. A DAMS AND H. M EIJER , “Security-
related comments regarding McEliece’s
public-key cryptosystem”, Advances in
Cryptology–CRYPTO ’87 (LNCS 293) , 224–
228, 1988.
[6] , “Security-related comments regard-
ing McEliece’s public-key cryptosystem”,
IEEE Transactions on Information Theory ,35
(1989), 454–455. An earlier version appeared
in [5].
[7] C. A DAMS AND S.E. T AVA R E S , “Design-
ing S-boxes for ciphers resistant to differen-
tial cryptanalysis”, W. Wolfowicz, editor, Pro-
ceedings of the 3rd Symposium on State and
Progress of Research in Cryptography, Rome,
Italy , 181–190, 1993.
[8] L.M. A DLEMAN , “A subexponential algo-
rithm for the discrete logarithm problem with
applications to cryptography”, Proceedings of
the IEEE 20th Annual Symposium on Founda-
tions of Computer Science , 55–60, 1979.
II”,
Algorithmic
Number
Theory
(LNCS 877) , 291–322, 1994.
[16] L.M. A DLEMAN ,C.P OMERANCE , AND
R.S. R UMELY , “On distinguishing prime
numbers from composite numbers”, Annals of
Mathematics , 117 (1983), 173–206.
[17] G.B. A GNEW , “Random sources for crypto-
graphic systems”, Advances in Cryptology–
EUROCRYPT ’87 (LNCS 304) , 77–81, 1988.
[18] G.B. A GNEW ,R.C.M ULLIN ,I.M.O NYSZ -
CHUK , AND S.A. V ANSTONE ,“Animple-
mentation for a fast public-key cryptosystem”,
Journal of Cryptology , 3 (1991), 63–79.
[19] G.B. A GNEW ,R.C.M ULLIN , AND S.A.
V ANSTONE , “Improved digital signature sch-
eme based on discrete exponentiation”, Elec-
tronics Letters , 26 (July 5, 1990), 1024–1025.
[20] S.G. A KL , “On the security of com-
pressed encodings”, Advances in Cryptology–
Proceedings of Crypto 83 , 209–230, 1984.
[21] N. A LEXANDRIS ,M.B URMESTER ,V.C HR -
ISSIKOPOULOS , AND Y. D ESMEDT ,“Ase-
cure key distribution system”, W. Wolfowicz,
[9]
, “The function field sieve”, Algorith-
mic Number Theory (LNCS 877) , 108–121,
1994.
[10]
, “Molecular computation of solutions
to
combinatorial
problems”,
Science ,
266
(1994), 1021–1024.
703
864445020.023.png 864445020.024.png 864445020.001.png 864445020.002.png 864445020.003.png
704
References
editor, Proceedings of the 3rd Symposium on
State and Progress of Research in Cryptogra-
phy, Rome, Italy , 30–34, Feb. 1993.
[22] W. A LEXI ,B.C HOR ,O.G OLDREICH , AND
C.P. S CHNORR , “RSA/Rabin bits are 2 +
1
[34] ANSI X3.106, “American National Standard
for Information Systems – Data Encryption
Algorithm – Modes of Operation”, American
National Standards Institute, 1983.
[35] ANSI X9.8, “American National Standard
for Financial Services – Banking – Personal
Identification Number management and se-
curity. Part 1: PIN protection principles and
techniques; Part 2: Approved algorithms for
PIN encipherment”, ASC X9 Secretariat –
American Bankers Association, 1995.
) secure”, Proceedings of the
IEEE 25th Annual Symposium on Founda-
tions of Computer Science , 449–457, 1984.
=poly
(log
n
[23]
, “RSA and Rabin functions: Certain
parts are as hard as the whole”, SIAM Journal
on Computing , 17 (1988), 194–209.
An ear-
lier version appeared in [22].
[24] W.R. A LFORD , A. G RANVILLE , AND
C. P OMERANCE , “There are infinitely many
Carmichael numbers”, Annals of Mathemat-
ics , 140 (1994), 703–722.
[25] H. A MIRAZIZI AND M. H ELLMAN ,“Time-
memory-processor trade-offs”, IEEE Trans-
actions on Information Theory , 34 (1988),
505–512.
[26] R. A NDERSON , “Practical RSA trapdoor”,
Electronics Letters , 29 (May 27, 1993), 995.
[36] ANSI X9.9 ( REVISED ), “American National
Standard – Financial institution message au-
thentication (wholesale)”, ASC X9 Secretariat
– American Bankers Association, 1986 (re-
places X9.9–1982).
[37] ANSI X9.17, “American National Stan-
dard – Financial institution key management
(wholesale)”, ASC X9 Secretariat – American
Bankers Association, 1985.
[38] ANSI X9.19, “American National Standard
– Financial institution retail message authen-
tication”, ASC X9 Secretariat – American
Bankers Association, 1986.
[27]
, “The classification of hash functions”,
P.G. Farrell, editor, Codes and Cyphers:
Cryptography and Coding IV , 83–93, Institute
of Mathematics & Its Applications (IMA),
1995.
[39] ANSI X9.23, “American National Standard
– Financial institution encryption of whole-
sale financial messages”, ASC X9 Secretariat
– American Bankers Association, 1988.
[28]
, “On Fibonacci keystream generators”,
B. Preneel, editor, Fast Software Encryption,
Second International Workshop (LNCS 1008) ,
346–352, Springer-Verlag, 1995.
[40] ANSI X9.24, “American National Standard
for Financial Services – Financial services re-
tail key management”, ASC X9 Secretariat –
American Bankers Association, 1992.
[29]
, “Searching for the optimum correla-
tion attack”, B. Preneel, editor, Fast Software
Encryption, Second International Workshop
(LNCS
1008) ,
137–143,
Springer-Verlag,
[41] ANSI X9.26, “American National Standard
– Financial institution sign-on authentication
for wholesale financial transactions”, ASC X9
Secretariat – American Bankers Association,
1990.
1995.
[30] R. A NDERSON AND E. B IHAM , “Two prac-
tical and provably secure block ciphers:
BEAR and LION”, D. Gollmann, editor,
Fast Software Encryption, Third International
Workshop (LNCS 1039) , 113–120, Springer-
Verlag, 1996.
[31] R. A NDERSON AND R. N EEDHAM , “Robust-
ness principles for public key protocols”, Ad-
vances in Cryptology–CRYPTO ’95 (LNCS
963) , 236–247, 1995.
[32] N.C. A NKENY , “The least quadratic non
residue”, Annals of Mathematics , 55 (1952),
65–72.
[33] ANSI X3.92, “American National Standard
– Data Encryption Algorithm”, American Na-
tional Standards Institute, 1981.
[42] ANSI X9.28, “American National Stan-
dard for Financial Services – Financial in-
stitution multiple center key management
(wholesale)”, ASC X9 Secretariat – American
Bankers Association, 1991.
[43] ANSI X9.30 (P ART 1), “American National
Standard for Financial Services – Public key
cryptography using irreversible algorithms for
the financial services industry – Part 1: The
digital signature algorithm (DSA)”, ASC X9
Secretariat – American Bankers Association,
1995.
c
1997 by CRC Press, Inc. — See accompanying notice at front of chapter.
864445020.004.png 864445020.005.png 864445020.006.png 864445020.007.png 864445020.008.png 864445020.009.png
References
705
[44] ANSI X9.30 (P ART 2), “American National
Standard for Financial Services – Public key
cryptography using irreversible algorithms
for the financial services industry – Part 2:
The secure hash algorithm (SHA)”, ASC X9
Secretariat – American Bankers Association,
1993.
[45] ANSI X9.31 (P ART 1), “American National
Standard for Financial Services – Public key
cryptography using RSA for the financial ser-
vices industry – Part 1: The RSA signature al-
gorithm”, draft, 1995.
[46] ANSI X9.31 (P ART 2), “American National
Standard for Financial Services – Public key
cryptography using RSA for the financial ser-
vices industry – Part 2: Hash algorithms for
RSA”, draft, 1995.
[47] ANSI X9.42, “Public key cryptography for
the financial services industry: Management
of symmetric algorithm keys using Diffie-
Hellman”, draft, 1995.
[48] ANSI X9.44, “Public key cryptography us-
ing reversible algorithms for the financial ser-
vices industry: Transport of symmetric algo-
rithm keys using RSA”, draft, 1994.
[49] ANSI X9.45, “Public key cryptography for
the financial services industry – Enhanced
management controls using digital signatures
and attribute certificates”, draft, 1996.
[50] ANSI X9.52, “Triple data encryption algo-
rithm modes of operation”, draft, 1996.
[51] ANSI X9.55, “Public key cryptography for
the financial services industry – Extensions to
public key certificates and certificate revoca-
tion lists”, draft, 1995.
[52] ANSI X9.57, “Public key cryptography for
the financial services industry – Certificate
management”, draft, 1995.
[53] K. A OKI AND K. O HTA , “Differential-linear
cryptanalysis of FEAL-8”, IEICE Transac-
tions on Fundamentals of Electronics, Com-
munications and Computer Science , E79-A
(1996), 20–27.
[54] B. A RAZI , “Integrating a key distribution pro-
cedure into the digital signature standard”,
Electronics Letters , 29 (May 27, 1993), 966–
967.
[56] F. A RNAULT , “Rabin-Miller primality test:
composite numbers which pass it”, Mathemat-
ics of Computation , 64 (1995), 355–361.
[57] A.O.L. A TKIN AND R.G. L ARSON ,“Ona
primality test of Solovay and Strassen”, SIAM
Journal on Computing , 11 (1982), 789–791.
[58] A.O.L. A TKIN AND F. M ORAIN , “Elliptic
curves and primality proving”, Mathematics
of Computation , 61 (1993), 29–68.
[59] D. A TKINS ,M.G RAFF ,A.K.L ENSTRA ,
AND P. C . L EYLAND , “The magic words are
SQUEAMISH OSSIFRAGE”, Advances in
Cryptology–ASIACRYPT
’94
(LNCS
917) ,
263–277, 1995.
[60] L. B ABAI , “Trading group theory for random-
ness”, Proceedings of the 17th Annual ACM
Symposium on Theory of Computing , 421–
429, 1985.
[61] L. B ABAI AND S. M ORAN , “Arthur-Merlin
games: a randomized proof system, and a
hierarchy of complexity classes”, Journal of
Computer and System Sciences , 36 (1988),
254–276.
[62] E. B ACH , “Discrete logarithms and factor-
ing”, Report No. UCB/CSD 84/186, Com-
puter Science Division (EECS), University of
California, Berkeley, California, 1984.
[63]
, Analytic Methods in the Analysis and
Design of Number-Theoretic Algorithms ,MIT
Press, Cambridge, Massachusetts, 1985.
An
ACM Distinguished Dissertation.
[64] , “Explicit bounds for primality testing
and related problems”, Mathematics of Com-
putation , 55 (1990), 355–380.
[65] , “Number-theoretic algorithms”, An-
nual Review of Computer Science , 4 (1990),
119–172.
[66] , “Realistic analysis of some random-
ized algorithms”, Journal of Computer and
System Sciences , 42 (1991), 30–53.
[67] , “Toward a theory of Pollard’s rho
method”, Information and Computation ,90
(1991), 139–155.
[68] E. B ACH AND J. S HALLIT , “Factoring with
cyclotomic polynomials”, Proceedings of the
IEEE 26th Annual Symposium on Founda-
tions of Computer Science , 443–450, 1985.
[55]
, “On primality testing using purely di-
visionless operations”, The Computer Jour-
nal , 37 (1994), 219–222.
[69]
, “Factoring with cyclotomic polynomi-
als”, Mathematics of Computation , 52 (1989),
201–219. An earlier version appeared in [68].
Handbook of Applied Cryptography by A. Menezes, P. van Oorschot and S. Vanstone.
864445020.010.png 864445020.011.png 864445020.012.png 864445020.013.png 864445020.014.png 864445020.015.png 864445020.016.png 864445020.017.png
706
References
[70]
, Algorithmic Number Theory, Volume
I: Efficient Algorithms ,
that are probably prime”, Journal of Cryptol-
ogy , 1 (1988), 53–64.
MIT Press,
Cam-
bridge, Massachusetts, 1996.
[71] E. B ACH AND J. S ORENSON , “Sieve algo-
rithms for perfect power testing”, Algorith-
mica , 9 (1993), 313–328.
[72] A. B AHREMAN , “PEMToolKit: Building a
top-down certification hierarchy”, Proceed-
ings of the Internet Society Symposium on Net-
work and Distributed System Security , 161–
171, IEEE Computer Society Press, 1995.
[73] T. B ARITAUD ,M.C AMPANA ,P.C HAU -
VAUD , AND H. G ILBERT , “On the security
of the permuted kernel identification scheme”,
Advances in Cryptology–CRYPTO ’92 (LNCS
740) , 305–311, 1993.
[74] W. B ARKER , Cryptanalysis of the Hagelin
Cryptograph ,
[82] P. B EGUIN AND J.-J. Q UISQUATER ,“Se-
cure acceleration of DSS signatures using
insecure server”, Advances in Cryptology–
ASIACRYPT ’94 (LNCS 917) , 249–259, 1995.
[83] A. B EIMEL AND B. C HOR , “Interaction
in key distribution schemes”, Advances in
Cryptology–CRYPTO ’93 (LNCS 773) , 444–
455, 1994.
[84] H. B EKER AND F. P IPER , Cipher Systems:
The Protection of Communications , John Wi-
ley & Sons, New York, 1982.
[85] H. B EKER AND M. W ALKER , “Key manage-
ment for secure electronic funds transfer in a
retail environment”, Advances in Cryptology–
Proceedings
Aegean
Park Press,
Laguna
of
CRYPTO 84
(LNCS 196) ,
Hills, California, 1977.
[75] P. B ARRETT , “Implementing the Rivest
Shamir and Adleman public key encryption
algorithm on a standard digital signal proces-
sor”, Advances in Cryptology–CRYPTO ’86
(LNCS 263) , 311–323, 1987.
[76] R.K. B AUER ,T.A.B ERSON , AND R.J.
F EIERTAG , “A key distribution protocol using
event markers”, ACM Transactions on Com-
puter Systems , 1 (1983), 249–255.
[77] U. B AUM AND S. B LACKBURN , “Clock-
controlled pseudorandom generators on finite
groups”, B. Preneel, editor, Fast Software
Encryption, Second International Workshop
(LNCS 1008) , 6–21, Springer-Verlag, 1995.
[78] F. B AUSPIESS AND H.-J. K NOBLOCH ,
“How to keep authenticity alive in a com-
puter network”, Advances in Cryptology–
EUROCRYPT ’89 (LNCS 434) , 38–46, 1990.
[79] D. B AYE R ,S.H ABER , AND W. S . S TOR -
NETTA , “Improving the efficiency and reli-
ability of digital time-stamping”, R. Capoc-
elli, A. De Santis, and U. Vaccaro, editors,
Sequences II: Methods in Communication,
Security, and Computer Science , 329–334,
Springer-Verlag, 1993.
[80] P. B EAUCHEMIN AND G. B RASSARD ,“A
generalization of Hellman’s extension to
Shannon’s approach to cryptography”, Jour-
nal of Cryptology , 1 (1988), 129–131.
[81] P. B EAUCHEMIN , G. B RASSARD , C.
C R EPEAU ,C.G OUTIER , AND C. P OMER -
ANCE , “The generation of random numbers
401–410, 1985.
[86] M. B ELLARE ,R.C ANETTI , AND H. K RAW -
CZYK , “Keying hash functions for message
authenticaion”, Advances in Cryptology–
CRYPTO ’96 (LNCS 1109) , 1–15, 1996.
[87] M. B ELLARE AND O. G OLDREICH ,“On
defining proofs of knowledge”, Advances in
Cryptology–CRYPTO ’92 (LNCS 740) , 390–
420, 1993.
[88] M. B ELLARE , O. G OLDREICH , AND
S. G OLDWASSER , “Incremental cryptogra-
phy: The case of hashing and signing”, Ad-
vances in Cryptology–CRYPTO ’94 (LNCS
839) , 216–233, 1994.
[89]
, “Incremental cryptography and appli-
cation to virus protection”, Proceedings of the
27th Annual ACM Symposium on Theory of
Computing , 45–56, 1995.
[90] M. B ELLARE ,R.G U ERIN , AND P. R O -
GAWAY , “XOR MACs: New methods for
message authentication using finite pseudo-
random functions”, Advances in Cryptology–
CRYPTO ’95 (LNCS 963) , 15–28, 1995.
[91] M. B ELLARE ,J.K ILIAN , AND P. R OG -
AWAY , “The security of cipher block chain-
ing”, Advances in Cryptology–CRYPTO ’94
(LNCS 839) , 341–358, 1994.
[92] M. B ELLARE AND S. M ICALI ,“Howtosign
given any trapdoor function”, Advances in
Cryptology–CRYPTO ’88 (LNCS 403) , 200–
215, 1990.
c
1997 by CRC Press, Inc. — See accompanying notice at front of chapter.
864445020.018.png 864445020.019.png 864445020.020.png

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin