Cryptography Reference
In-Depth Information
[426]
P. Paillier and D. Vergnaud, Discrete-log-based signatures may not be equivalent to discrete
log. In
ASIACRYPT 2005
(B. K. Roy, ed.),
LNCS
, vol. 3788, Springer, 2005, pp. 1-20.
[427]
P. Paillier and J. L. Villar, Trading one-wayness against chosen-ciphertext security in factoring-
based encryption. In
ASIACRYPT 2006
(X. Lai and K. Chen, eds.),
LNCS
, vol. 4284, Springer,
2006, pp. 252-266.
[428]
S. Patel and G. S. Sundaram, An efficient discrete log pseudo random generator. In
CRYPTO
1998
(H. Krawczyk, ed.),
LNCS
, vol. 1462, Springer, 1998, pp. 304-317.
[429]
S. Paulus and H.-G. R uck, Real and imaginary quadratic representations of hyperelliptic
function fields,
Math. Comp.
68
(227) (1999), 1233-1241.
[430]
R. Peralta, Simultaneous security of bits in the discrete log. In
EUROCRYPT 1985
(F. Pichler,
ed.),
LNCS
, vol. 219, Springer, 1986, pp. 62-72.
[431]
A. K. Pizer, Ramanujan graphs. In
Computational Perspectives on Number Theory
(D. A.
Buell and J. T. Teitelbaum, eds.), Studies in Advanced Mathematics, vol. 7, AMS, 1998,
pp. 159-178.
[432]
S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and
its cryptographic significance,
IEEE Trans. Inf. Theory
24
(1978), 106-110.
[433]
D. Pointcheval and J. Stern, Security arguments for digital signatures and blind signatures,
J.
Crypt.
13
(3) (2000), 361-396.
[434]
D. Pointcheval and S. Vaudenay, On provable security for digital signature algorithms, Tech-
nical report LIENS 96-17, Ecole Normale Superieure, 1996.
[435]
J. M. Pollard, Theorems on factorisation and primality testing,
Proc. Camb. Phil. Soc.
76
(1974), 521-528.
[436]
A Monte Carlo method for factorization,
BIT
15
(1975), 331-334.
[437]
Monte Carlo methods for index computation (mod p),
Math. Comp.
32
(143) (1978),
918-924.
[438]
Kangaroos, monopoly and discrete logarithms,
J. Crypt.
13
(4) (2000), 437-447.
[439]
C. Pomerance, A tale of two sieves,
Notices of the Amer. Math. Soc.
43
(1996), 1473-
1485.
[440]
V. R. Pratt, Every prime has a succinct certificate,
SIAM J. Comput.
4
(3) (1974), 214-220.
[441]
X. Pujol and D. Stehle, Rigorous and efficient short lattice vectors enumeration. In
ASIACRYPT
2008
(J. Pieprzyk, ed.),
LNCS
, vol. 5350, Springer, 2008, pp. 390-405.
[442]
G. Qiao and K.-Y. Lam, RSA signature algorithm for microcontroller implementation. In
CARDIS 1998
(J.-J. Quisquater and B. Schneier, eds.),
LNCS
, vol. 1820, Springer, 2000,
pp. 353-356.
[443]
J. J. Quisquater and C. Couvreur, Fast decipherment algorithm for RSA public-key cryptosys-
tem,
Electronics Letters
(21) (1982), 905-907.
[444]
M. O. Rabin, Digitalized signatures and public-key functions as intractable as factorization,
Tech. Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979.
[445]
J.-F. Raymond and A. Stiglic,
Security Issues in the Diffie-Hellman Key Agreement Protocol
,
Preprint, 2000.
[446]
O. Regev, The learning with errors problem (invited survey),
25th Annual IEEE Conference
on Computational Complexity
, IEEE, 2010, pp. 191-204.
[447]
M. Reid,
Undergraduate Algebraic Geometry
, Cambridge University Press, 1988.
[448]
Graded rings and varieties in weighted projective space, Chapter of unfinished topic,
2002.
[449]
G. Reitwiesner, Binary arithmetic,
Advances in Computers
1
(1960), 231-308.
[450]
P. Rogaway, Formalizing human ignorance. In
VIETCRYPT 2006
(P. Q. Nguyen, ed.),
LNCS
,
vol. 4341, Springer, 2006, pp. 211-228.
[451]
S. Ross,
A First Course in Probability
, 6th edn, Prentice Hall, 2001.
