-
1
-
-
0027726717
-
Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols
-
ACM Press, New York
-
M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCS, pages 62-73, ACM Press, New York, 1993.
-
(1993)
Proc. of the 1st CCS
, pp. 62-73
-
-
Bellare, M.1
Rogaway, P.2
-
2
-
-
84947906522
-
The Exact Security of Digital Signatures - How to Sign with RSA and Rabin
-
Eurocrypt '96, Springer-Verlag, Berlin
-
M. Bellare and P. Rogaway. The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In Eurocrypt '96, LNCS 1070, pages 399-416, Springer-Verlag, Berlin, 1996.
-
(1996)
LNCS
, vol.1070
, pp. 399-416
-
-
Bellare, M.1
Rogaway, P.2
-
3
-
-
3743146243
-
An Attack on a Signature Scheme proposed by Okamoto and Shiraishi
-
Crypto '85, Springer-Verlag, Berlin
-
E. Brickell and J. M. DeLaurentis. An Attack on a Signature Scheme proposed by Okamoto and Shiraishi. In Crypto '85, LNCS 218, pages 28-32, Springer-Verlag, Berlin, 1986.
-
(1986)
LNCS
, vol.218
, pp. 28-32
-
-
Brickell, E.1
DeLaurentis, J.M.2
-
4
-
-
84963082611
-
On character sums and primitive roots
-
D.A. Burgess. On character sums and primitive roots, Proc. London Math. Soc., 12 (1962), 179-192.
-
(1962)
Proc. London Math. Soc.
, vol.12
, pp. 179-192
-
-
Burgess, D.A.1
-
5
-
-
0003231477
-
Multiplicative Number theory
-
Springer Verlag
-
H. Davenport. Multiplicative Number theory, Graduate Texts in Mathematics, Vol 74, Springer Verlag, (1980).
-
(1980)
Graduate Texts in Mathematics
, vol.74
-
-
Davenport, H.1
-
7
-
-
84961378541
-
Computation of Approximate L-th Roots Modulo n and Application to Cryptography
-
Crypto '88, Springer-Verlag, Berlin
-
M. Girault, P. Toffin and B. Vallée. Computation of Approximate L-th Roots Modulo n and Application to Cryptography. In Crypto '88, LNCS 403, pages 100-118, Springer-Verlag, Berlin, 1989.
-
(1989)
LNCS
, vol.403
, pp. 100-118
-
-
Girault, M.1
Toffin, P.2
Vallée, B.3
-
8
-
-
0023985465
-
A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks
-
April
-
S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
-
(1988)
SIAM Journal of Computing
, vol.17
, Issue.2
, pp. 281-308
-
-
Goldwasser, S.1
Micali, S.2
Rivest, R.3
-
9
-
-
35248837942
-
-
NESSIE internal document, may
-
L. Granboulan. How to repair ESIGN, NESSIE internal document, may 2002. See http://www.cryptonessie.org, Docuemnyt NES/DOC/ENS/WP5/019.
-
(2002)
How to Repair ESIGN
-
-
Granboulan, L.1
-
13
-
-
34250244723
-
Factoring polynomials with rational coefficients
-
A. K. Lenstra, H. W. Lenstra and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Ann., 261, (1982), 513-534.
-
(1982)
Mathematische Ann.
, vol.261
, pp. 513-534
-
-
Lenstra, A.K.1
Lenstra, H.W.2
Lovász, L.3
-
14
-
-
0025207738
-
A Fast Signature Scheme Based on Congruential Polynomial Operations
-
T. Okamoto. A Fast Signature Scheme Based on Congruential Polynomial Operations. IEEE Transactions on Information Theory, IT-36 (1), pages 47-53, 1990.
-
(1990)
IEEE Transactions on Information Theory
, vol.IT-36
, Issue.1
, pp. 47-53
-
-
Okamoto, T.1
-
17
-
-
0001772738
-
Über die Verteilung des quadratischen Reste und Nichtreste
-
G. Pólya. Über die Verteilung des quadratischen Reste und Nichtreste, Göttinger Nachtrichten (1918), 21-26.
-
(1918)
Göttinger Nachtrichten
, pp. 21-26
-
-
Pólya, G.1
-
18
-
-
0017930809
-
A Method for Obtaining Digital Signatures and Public Key Cryptosystems
-
February
-
R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.
-
(1978)
Communications of the ACM
, vol.21
, Issue.2
, pp. 120-126
-
-
Rivest, R.1
Shamir, A.2
Adleman, L.3
-
19
-
-
84880904783
-
OAEP Reconsidered
-
Crypto '2001, Springer-Verlag, Berlin
-
V. Shoup. OAEP Reconsidered. In Crypto '2001, LNCS 2139, pages 239-259. Springer-Verlag, Berlin, 2001.
-
(2001)
LNCS
, vol.2139
, pp. 239-259
-
-
Shoup, V.1
-
20
-
-
35248854557
-
-
Also appeared in the November
-
Also appeared in the Cryptology ePrint Archive 2000/060. November 2000. Available from http://eprint.iacr.org/.
-
(2000)
Cryptology ePrint Archive 2000/060
-
-
-
21
-
-
84937411969
-
Flaws in Applying Proof Methodologies to Signature Schemes
-
Crypto '02
-
J. Stern, D. Pointcheval, J. Malone-Lee, and N. Smart. Flaws in Applying Proof Methodologies to Signature Schemes. In Crypto '02, LNCS 2442, pages 93-110.
-
LNCS
, vol.2442
, pp. 93-110
-
-
Stern, J.1
Pointcheval, D.2
Malone-Lee, J.3
Smart, N.4
-
22
-
-
84969374420
-
How to break Okamoto's Cryptosystem by Reducing Lattice Bases
-
Eurocrypt '88, Springer-Verlag, Berlin
-
B. Vallée, M. Girault, and P. Toffin. How to break Okamoto's Cryptosystem by Reducing Lattice Bases. In Eurocrypt '88, LNCS 330, pages 281-292, Springer-Verlag, Berlin, 1988.
-
(1988)
LNCS
, vol.330
, pp. 281-292
-
-
Vallée, B.1
Girault, M.2
Toffin, P.3
-
23
-
-
0010250382
-
How to Guess ℓth Roots Modulo n by Reducing Lattice Bases
-
AAECC-6, Springer-Verlag, Berlin
-
B. Vallée, M. Girault and P. Toffin. How to Guess ℓth Roots Modulo n by Reducing Lattice Bases. In AAECC-6, LNCS 357, pages 427-442, Springer-Verlag, Berlin, 1988.
-
(1988)
LNCS
, vol.357
, pp. 427-442
-
-
Vallée, B.1
Girault, M.2
Toffin, P.3
-
24
-
-
0008994884
-
Sur la distributions des résidus et des non-résidus des puissances
-
I.M. Vinogradov. Sur la distributions des résidus et des non-résidus des puissances, J. Phys.-Math. Soc. Perm. 1 (1918), 94-96.
-
(1918)
J. Phys.-Math. Soc. Perm.
, vol.1
, pp. 94-96
-
-
Vinogradov, I.M.1
|