Special-Purpose Hardware for Solving the Elliptic Curve Discrete Logarithm Problem

ACM Transactions on Reconfigurable Technology and Systems

Volumn 1, Issue 2, 2008, Pages 1-21

  Güneysu, Tim ^a   Paar, Christof ^a   Pelzl, Jan ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Algorithms; cryptanalysis; Discrete logarithm; elliptic curve cryptosystem; Performance; Pollard's rho; Security

Indexed keywords

EID: 84859465967     PISSN: 19367406     EISSN: 19367414     Source Type: Journal    
DOI: 10.1145/1371579.1371580     Document Type: Article

References (20)

1. Blake, I., Seroussi, G., Smart, N., 1999.Elliptic Curves in Cryptography. Cambridge University Press.
2. Daly, A., Marnane, W., Kerins, T., Popovici, E., 2004. An FPGA implementation of a GF(p) ALU for encryption processors.Elsevier Microproces. Microsyst. 28, 5-6, 253-260.
3. Daly, A., Marnaney, L., Popovici, E., 2004. Fast modular inversion in the Montgomery Domain on reconfigurable logic. Tech. rep., University College Cork, Cork, Ireland.
4. Dormale De., G., Bulens, P., and Quisquater, J. 2007. Collision search for elliptic curve discrete logarithm over GF (2m) with FPGA. In Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES'07). LNCS Vol. 4727. Springer, 378.
5. Diffie, W., Hellman, M., 1976. New directions in cryptography.IEEE Trans. Inform. Theory 22, 644-654.
6. Elgamal, T., 1985. A public key cryptosystem and a signature scheme based on discrete logarithms.IEEE Trans. Inform. Theory 31, 469-472.
7. Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Stahlke, C., 2005. SHARK-A realizable special hardware sieving device for factoring 1024-bit integers. In Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES'05). Lecture Notes in Computer Science, vol. 3659. Springer, 119-130.
8. Guneysu, T., Paar, C., Pelzl, J., 2007. Attacking elliptic curve cryptosystems with special-purpose hardware. In Proceedings of the ACM/SIGDA 15th International Symposium on Field Programmable Gate Arrays (FPGA'07), ACM Press, New York, NY, USA, 207-215.
9. Hankerson, D., Menezes, A., Vanstone, S., 2004.Guide to Elliptic Curve Cryptography. Springer Verlag, Berlin, Germany.
10. Koblitz, N., 1987. Elliptic curve cryptosystems.Math. Comput. 48, 203-209.
11. Kumar, S., Paar, C., Pelzl, J., Pfeiffer, G., Schimmler, M., 2006. Breaking ciphers with COPACOBANA - A cost-optimized parallel code breaker. In Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES'06). Springer-Verlag.
12. Lenstra, A., Verheul, E., 2001. Selecting Cryptographic key sizes.J. Cryptol. 14, 4, 255-293.
13. Menezes, A. J., Oorschot Van., P. C., and Vanstone, S. A. 1996.Handbook of Applied Cryptography. CRC Press, New York, NY.
14. Miller, V., 1986. Uses of elliptic curves in cryptography. In Advances in Cryptology- (CRYPTO'85), H. C. Williams, Ed. Vol. Lecture Notes in Computer Science, 218. Springer, 417-426.
15. Orlando, G., Paar, C., 2001. A scalable GF(p) elliptic curve processor architecture for programmable hardware. In Proceedings of Workshop on Cryptograpic Hardware and Embedded Systems (CHES'01). 356-371.
16. Ors, S., Batina, L., Preneel, B., Vandewalle, J., 2003. Hardware implementation of elliptic curve processor over GF(p). In Proceedings of the Application-Specific Systems, Architectures, and Processors (ASAP), 433-443.
17. Pollard, J., 1978. Monte Carlo methods for index computation mod p.Math. Comput. 32, 143, 918-924.
18. Shamir, A., Tromer, E., 2003. Factoring large numbers with the TWIRL device. In Advances in Cryptology-(Crypto'03). Lecture Notes in Computer Science, vol. 2729. Springer, 1-26.
19. Teske, E., 1998. Speeding up Pollard's rho method for computing discrete logarithms.Algorithmic Number Theory Seminar (ANTS-III), 541-554.
20. Oorschot Van, P., Wiener, M., 1999. Parallel collision search with cryptanalytic applications.J. Cryptol. 12, 1-28.