AAAAAA

   
Results: 1-25 | 26-50 | 51-73

Table of contents of journal: *Journal of cryptology

Results: 1-25/73
FAST MULTIPLICATION ON ELLIPTIC-CURVES OVER SMALL FIELDS OF CHARACTERISTIC-2
Authors: MULLER V
Citation: V. Muller, FAST MULTIPLICATION ON ELLIPTIC-CURVES OVER SMALL FIELDS OF CHARACTERISTIC-2, Journal of cryptology, 11(4), 1998, pp. 219-234
AN ANALYSIS OF SAFER
Authors: MURPHY S
Citation: S. Murphy, AN ANALYSIS OF SAFER, Journal of cryptology, 11(4), 1998, pp. 235-251
CRYPTANALYSIS OF MD4
Authors: DOBBERTIN H
Citation: H. Dobbertin, CRYPTANALYSIS OF MD4, Journal of cryptology, 11(4), 1998, pp. 253-271
A SOFTWARE-OPTIMIZED ENCRYPTION ALGORITHM
Authors: ROGAWAY P
Citation: P. Rogaway, A SOFTWARE-OPTIMIZED ENCRYPTION ALGORITHM, Journal of cryptology, 11(4), 1998, pp. 273-287
ZERO-KNOWLEDGE AUTHENTICATION SCHEME WITH SECRET KEY EXCHANGE
Authors: BRANDT J DAMGARD I LANDROCK P PEDERSEN T
Citation: J. Brandt et al., ZERO-KNOWLEDGE AUTHENTICATION SCHEME WITH SECRET KEY EXCHANGE, Journal of cryptology, 11(3), 1998, pp. 147-159
LATTICE REDUCTION - A TOOLBOX FOR THE CRYPTANALYST
Authors: JOUX A STERN J
Citation: A. Joux et J. Stern, LATTICE REDUCTION - A TOOLBOX FOR THE CRYPTANALYST, Journal of cryptology, 11(3), 1998, pp. 161-185
AN EFFICIENT EXISTENTIALLY UNFORGEABLE SIGNATURE SCHEME AND ITS APPLICATIONS
Authors: DWORK C NAOR M
Citation: C. Dwork et M. Naor, AN EFFICIENT EXISTENTIALLY UNFORGEABLE SIGNATURE SCHEME AND ITS APPLICATIONS, Journal of cryptology, 11(3), 1998, pp. 187-208
2-KEY TRIPLE ENCRYPTION
Authors: DAMGARD IB KNUDSEN LR
Citation: Ib. Damgard et Lr. Knudsen, 2-KEY TRIPLE ENCRYPTION, Journal of cryptology, 11(3), 1998, pp. 209-218
ON MATROID CHARACTERIZATION OF IDEAL SECRET SHARING SCHEMES
Authors: GOLIC JD
Citation: Jd. Golic, ON MATROID CHARACTERIZATION OF IDEAL SECRET SHARING SCHEMES, Journal of cryptology, 11(2), 1998, pp. 75-86
PERFECT ZERO-KNOWLEDGE ARGUMENTS FOR NP USING ANY ONE-WAY PERMUTATION
Authors: NAOR M OSTROVSKY R VENKATESAN R YUNG M
Citation: M. Naor et al., PERFECT ZERO-KNOWLEDGE ARGUMENTS FOR NP USING ANY ONE-WAY PERMUTATION, Journal of cryptology, 11(2), 1998, pp. 87-108
A PUBLIC-KEY CRYPTOSYSTEM USING PURELY CUBIC FIELDS
Authors: SCHEIDLER R
Citation: R. Scheidler, A PUBLIC-KEY CRYPTOSYSTEM USING PURELY CUBIC FIELDS, Journal of cryptology, 11(2), 1998, pp. 109-124
THE BLACK-BOX MODEL FOR CRYPTOGRAPHIC PRIMITIVES
Authors: SCHNORR CP VAUDENAY S
Citation: Cp. Schnorr et S. Vaudenay, THE BLACK-BOX MODEL FOR CRYPTOGRAPHIC PRIMITIVES, Journal of cryptology, 11(2), 1998, pp. 125-140
THE IMPROBABILITY THAT AN ELLIPTIC CURVE HAS SUBEXPONENTIAL DISCRETE LOG PROBLEM UNDER THE MENEZES-OKAMOTO-VANSTONE ALGORITHM
Authors: BALASUBRAMANIAN R KOBLITZ N
Citation: R. Balasubramanian et N. Koblitz, THE IMPROBABILITY THAT AN ELLIPTIC CURVE HAS SUBEXPONENTIAL DISCRETE LOG PROBLEM UNDER THE MENEZES-OKAMOTO-VANSTONE ALGORITHM, Journal of cryptology, 11(2), 1998, pp. 141-145
AN EFFICIENT NONINTERACTIVE ZERO-KNOWLEDGE PROOF SYSTEM FOR NP WITH GENERAL ASSUMPTIONS
Authors: KILIAN J PETRANK E
Citation: J. Kilian et E. Petrank, AN EFFICIENT NONINTERACTIVE ZERO-KNOWLEDGE PROOF SYSTEM FOR NP WITH GENERAL ASSUMPTIONS, Journal of cryptology, 11(1), 1998, pp. 1-27
A STRUCTURAL COMPARISON OF THE COMPUTATIONAL DIFFICULTY OF BREAKING DISCRETE LOG CRYPTOSYSTEMS
Authors: SAKURAI K SHIZUYA H
Citation: K. Sakurai et H. Shizuya, A STRUCTURAL COMPARISON OF THE COMPUTATIONAL DIFFICULTY OF BREAKING DISCRETE LOG CRYPTOSYSTEMS, Journal of cryptology, 11(1), 1998, pp. 29-43
CRYPTANALYSIS OF MULTIPLE-MODES OF OPERATION
Authors: BIHAM E
Citation: E. Biham, CRYPTANALYSIS OF MULTIPLE-MODES OF OPERATION, Journal of cryptology, 11(1), 1998, pp. 45-58
ATTACKS ON FAST DOUBLE BLOCK LENGTH HASH FUNCTIONS
Authors: KNUDSEN LR LAI XJ PRENEEL B
Citation: Lr. Knudsen et al., ATTACKS ON FAST DOUBLE BLOCK LENGTH HASH FUNCTIONS, Journal of cryptology, 11(1), 1998, pp. 59-72
THE SIZE OF A SHARE MUST BE LARGE
Authors: CSIRMAZ L
Citation: L. Csirmaz, THE SIZE OF A SHARE MUST BE LARGE, Journal of cryptology, 10(4), 1997, pp. 223-231
SMALL SOLUTIONS TO POLYNOMIAL EQUATIONS, AND LOW EXPONENT RSA VULNERABILITIES
Authors: COPPERSMITH D
Citation: D. Coppersmith, SMALL SOLUTIONS TO POLYNOMIAL EQUATIONS, AND LOW EXPONENT RSA VULNERABILITIES, Journal of cryptology, 10(4), 1997, pp. 233-260
MUTUALLY TRUSTED AUTHORITY-FREE SECRET SHARING SCHEMES
Authors: JACKSON WA MARTIN KM OKEEFE CM
Citation: Wa. Jackson et al., MUTUALLY TRUSTED AUTHORITY-FREE SECRET SHARING SCHEMES, Journal of cryptology, 10(4), 1997, pp. 261-289
A CONSTRUCTION OF A CIPHER FROM A SINGLE PSEUDORANDOM PERMUTATION
Authors: EVEN S MANSOUR Y
Citation: S. Even et Y. Mansour, A CONSTRUCTION OF A CIPHER FROM A SINGLE PSEUDORANDOM PERMUTATION, Journal of cryptology, 10(3), 1997, pp. 151-161
ON THE EXISTENCE OF STATISTICALLY HIDING BIT COMMITMENT SCHEMES AND FAIL-STOP SIGNATURES
Authors: DAMGARD IB PEDERSEN TP PFITZMANN B
Citation: Ib. Damgard et al., ON THE EXISTENCE OF STATISTICALLY HIDING BIT COMMITMENT SCHEMES AND FAIL-STOP SIGNATURES, Journal of cryptology, 10(3), 1997, pp. 163-194
AN IMPROVEMENT OF DAVIES ATTACK ON DES
Authors: BIHAM E BIRYUKOV A
Citation: E. Biham et A. Biryukov, AN IMPROVEMENT OF DAVIES ATTACK ON DES, Journal of cryptology, 10(3), 1997, pp. 195-205
THE SECURITY OF THE BIRATIONAL PERMUTATION SIGNATURE SCHEMES
Authors: COPPERSMITH D STERN J VAUDENAY S
Citation: D. Coppersmith et al., THE SECURITY OF THE BIRATIONAL PERMUTATION SIGNATURE SCHEMES, Journal of cryptology, 10(3), 1997, pp. 207-221
BATCH RSA
Authors: FIAT A
Citation: A. Fiat, BATCH RSA, Journal of cryptology, 10(2), 1997, pp. 75-88
Risultati: 1-25 | 26-50 | 51-73