History

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

Result 1 to 20 of 54 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
Efficient SIMD arithmetic modulo a mersenne number (English)
IEEE Symposium on Computer Arithmetic, 213-221 (2011).
2
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).
3
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).
4
Factorizations of cunningham numbers with bases 13 to 99. (English)
Comput. Res. Repos. 2010, Article No. 1004.3169 (2010).
5
Factorization of a 768-bit RSA modulus (English)
IACR Cryptology ePrint Archive 2010, 6 (2010).
6
Efficient SIMD arithmetic modulo a mersenne number (English)
IACR Cryptology ePrint Archive 2010, 338 (2010).
7
An analysis of affine coordinates for pairing computation (English)
IACR Cryptology ePrint Archive 2010, 363 (2010).
8
The period of the Bell numbers modulo a prime (English)
Math. Comput. 79, No. 271, 1793-1800 (2010).
9
Factorization of a 768-bit RSA modulus (English)
CRYPTO, 333-350 (2010).
10
An analysis of affine coordinates for pairing computation (English)
Pairing, 1-20 (2010).
11
TB database: an integrated platform for tuberculosis research. (English)
Nucleic Acids Res. 37, No. Database-Issue, 499-508 (2009).
12
An observation about variations of the Diffie-Hellman assumption. (English)
Serdica J. Comput. 3, No. 3, 309-318 (2009).
13
On the security of 1024-bit RSA and 160-bit elliptic curve cryptography (English)
IACR Cryptology ePrint Archive 2009, 389 (2009).
14
Vulnerabilities in anonymous credential systems. (English)
Electron. Notes Theor. Comput. Sci. 197, No. 2, 141-148 (2008).
15
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).
16
On the diffie-hellman assumption (English)
IACR Cryptology ePrint Archive 2008, 525 (2008).
17
Assessing the properties of the world health organization’s quality of life index (English)
IMCSIT, 151-154 (2008).
18
Improved stage 2 to P$\pm 1$ factoring algorithms (English)
ANTS, 180-195 (2008).
19
Trading inversions for multiplications in elliptic curve cryptography. (English)
Des. Codes Cryptography 39, No. 2, 189-206 (2006).
20
first | previous | 1 21 41 | next | last

Result 1 to 20 of 54 total