History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 | next | last

Result 1 to 20 of 31 total

Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. (English)
Int. J. Appl. Cryptogr. 2, No. 3, 212-228 (2012).
1
An analysis of affine coordinates for pairing computation. (English)
Joye, Marc (ed.) et al., Pairing-based cryptography ‒ Pairing 2010. 4th international conference, Yamanaka Hot Spring, Japan, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17454-4/pbk). Lecture Notes in Computer Science 6487, 1-20 (2010).
2
Factorization of a 768-bit RSA modulus. (English)
Rabin, Tal (ed.), Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14622-0/pbk). Lecture Notes in Computer Science 6223, 333-350 (2010).
3
Factorizations of cunningham numbers with bases 13 to 99. (English)
Comput. Res. Repos. 2010, Article No. 1004.3169 (2010).
4
TB database: an integrated platform for tuberculosis research. (English)
Nucleic Acids Res. 37, No. Database-Issue, 499-508 (2009).
5
An observation about variations of the Diffie-Hellman assumption. (English)
Serdica J. Comput. 3, No. 3, 309-318 (2009).
6
Vulnerabilities in anonymous credential systems. (English)
Electron. Notes Theor. Comput. Sci. 197, No. 2, 141-148 (2008).
7
Improved stage 2 to P $\pm 1$ factoring algorithms. (English)
van der Poorten, Alfred J. (ed.) et al., Algorithmic number theory. 8th international symposium, ANTS-VIII Banff, Canada, May 17‒22, 2008 Proceedings. Berlin: Springer (ISBN 978-3-540-79455-4/pbk). Lecture Notes in Computer Science 5011, 180-195 (2008).
8
Trading inversions for multiplications in elliptic curve cryptography. (English)
Des. Codes Cryptography 39, No. 2, 189-206 (2006).
9
Five, six, and seven-term Karatsuba-like formulae. (English)
IEEE Trans. Comput. 54, No. 3, 362-369 (2005).
10
Teager-kaiser energy and higher-order operators in white-light interference microscopy for surface shape measurement. (English)
EURASIP J. Appl. Signal Process. 2005, No. 17, 2804-2815 (2005).
11
Improved Weil and Tate pairings for elliptic and hyperelliptic curves. (English)
Buell, Duncan (ed.), Algorithmic number theory. 6th international symposium, ANTS-VI, Burlington, VT, USA, June 13‒18, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22156-5/pbk). Lecture Notes in Computer Science 3076, 169-183 (2004).
12
Fast elliptic curve arithmetic and improved Weil pairing evaluation. (English)
Joye, Marc (ed.), Topics in cryptology ‒ CT-RSA 2003. The cryptographers’ track at the RSA conference 2003, San Francisco, CA, USA, April 13‒17, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00847-0/pbk). Lect. Notes Comput. Sci. 2612, 343-354 (2003).
13
Factorization of a 512-bit RSA modulus. (English)
Preneel, Bart (ed.), Advances in cryptology - EUROCRYPT 2000. 19th international conference on the theory and application of cryptographic techniques, Bruges, Belgium, May 14‒18, 2000. Proceedings. Berlin: Springer (ISBN 3-540-67517-5). Lect. Notes Comput. Sci. 1807, 1-18 (2000).
14
Factorization of RSA-140 using the number field sieve. (English)
Lam, Kwok Yan (ed.) et al., Advances in cryptology - ASIACRYPT ’99. International conference on the theory and application of cryptology and information security, Singapore, November 14-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1716, 195-207 (1999).
15
The number field sieve on many computers. (English)
Gupta, Rajiv (ed.) et al., Number theory. Fifth conference of the Canadian Number Theory Association, Ottawa, Ontario, Canada, August 17-22, 1996. Providence, RI: American Mathematical Society. CRM Proc. Lect. Notes. 19, 81-85 (1999).
16
A new world record for the special number field sieve factoring method. (English)
CWI Q. 10, No. 2, 105-107 (1997).
17
A world wide number field sieve factoring record: On to 512 bits. (English)
Kim, Kwangjo (ed.) et al., Advances in cryptology - ASIACRYPT ’96. International conference on the theory and applications of cryptology and information security, Kyongju, Korea, November 3-7, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1163, 382-394 (1996).
Classification: E.4
18
A block Lanczos algorithm for finding dependencies over GF(2). (English)
Guillou, Louis C. (ed.) et al., Advances in cryptology - EUROCRYPT ’95. International conference on the theory and application of cryptographic techniques, Saint-Malo, France, May 21-25, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 921, 106-120 (1995).
19
A survey of modern integer factorization algorithms. (English)
CWI Q. 7, No.4, 337-366 (1994).
Reviewer: H.Cohn (New York)
20
first | previous | 1 21 | next | last

Result 1 to 20 of 31 total