Cryptography Reference
In-Depth Information
[227]
P. Gaudry and D. Lubicz, The arithmetic of characteristic 2 Kummer surfaces and of elliptic
Kummer lines, Finite Fields Appl. 15 (2009), 246-260.
P. Gaudry and E. Schost, A low-memory parallel version of Matsuo, Chao, and Tsujii's
algorithm. In ANTS VI (D. A. Buell, ed.), LNCS , vol. 3076, Springer, 2004, pp. 208-222.
[228]
[229]
P. Gaudry, E. Thome, N. Theriault and C. Diem, A double large prime variation for small
genus hyperelliptic index calculus, Math. Comp. 76 (257) (2007), 475-492.
[230]
C. Gentry, The geometry of provable security: some proofs of security in which lattices make
a surprise appearance, The LLL Algorithm (P. Q. Nguyen and B. Vallee, eds.), Springer, 2010,
pp. 391-426.
[231]
M. Girault, An identity-based identification scheme based on discrete logarithms modulo a
composite number. In EUROCRYPT 1990 (I. Damgard, ed.), LNCS , vol. 473, Springer, 1991,
pp. 481-486.
[232]
M. Girault, G. Poupard and J. Stern, On the fly authentication and signature schemes based
on groups of unknown order, J. Crypt. 19 (2006), 463-487.
[233]
O. Goldreich, S. Goldwasser and S. Halevi, Public-key cryptosystems from lattice reduction
problems. In CRYPTO 1997 (B. S. Kaliski Jr., ed.), LNCS , vol. 1294, Springer, 1997, pp. 112-
131.
[234]
O. Goldreich, D. Ron and M. Sudan, Chinese remaindering with errrors, IEEE Trans. Inf.
Theory 46 (4) (2000), 1330-1338.
[235]
S. Goldwasser, S. Micali and R. L. Rivest, A digital signature scheme secure against adaptive
chosen-message attacks, SIAM J. Comput. 17 (2) (1988), 281-308.
[236]
G. Gong and L. Harn, Public-key cryptosystems based on cubic finite field extensions, IEEE
Trans. Inf. Theory 45 (7) (1999), 2601-2605.
[237]
M. I. Gonzalez Vasco, M. Naslund and I. E. Shparlinski, New results on the hardness of
Diffie-Hellman bits, PKC 2004 (F. Bao, R. H. Deng and J. Zhou, eds.), LNCS , vol. 2947,
Springer, 2004, pp. 159-172.
[238]
M. I. Gonzalez Vasco and I. E. Shparlinski, On the security of Diffie-Hellman bits. In Cryptog-
raphy and Computational Number Theory (H. Wang K. Y. Lam, I. E. Shparlinski and C. Xing,
eds.), Progress in Computer Science and Applied Logic, Birkhauser, 2001, pp. 257-268.
[239]
D. M. Gordon, On the number of elliptic pseudoprimes, Math. Comp. 52 (185) (1989), 231-
245.
[240]
D. M. Gordon and K. S. McCurley, Massively parallel computation of discrete logarithms. In
CRYPTO 1992 (E.F.Brickell,ed.), LNCS , vol. 740, Springer, 1993, pp. 312-323.
[241]
R. Granger, F. Hess, R. Oyono, N. Theriault and F. Vercauteren, Ate pairing on hyperelliptic
curves. In EUROCRYPT 2007 (M. Naor, ed.), LNCS , vol. 4515, Springer, 2007, pp. 430-447.
[242]
R. Granger and F. Vercauteren, On the discrete logarithm problem on algebraic tori. In CRYPTO
2005 (V. Shoup, ed.), LNCS , vol. 3621, Springer, 2005, pp. 66-85.
[243]
A. Granville, Smooth numbers: computational number theory and beyond. In Algorithmic
Number Theory (J. P. Buhler and P. Stevenhagen, eds.), MSRI Proceedings , vol. 44, Cambridge
University Press, 2008, pp. 267-323.
[244]
B. H. Gross, Heights and the special values of L -series. In CMS Conf. Proc. , vol. 7, 1987,
pp. 115-187.
[245]
M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Opti-
mization , Springer, 1993.
[246]
R. K. Guy, Unsolved Problems in Number Theory , 2nd edn, Springer, 1994.
[247]
J. L. Hafner and K. S. McCurley, Asymptotically fast triangularization of matrices over rings,
SIAM J. Comput. 20 (6) (1991), 1068-1083.
[248]
D. Hankerson, A. Menezes and S. Vanstone, Guide to Elliptic Curve Cryptography , Springer,
2004.
Search WWH ::




Custom Search