ECC2K-130 on NVIDIA GPUs

DOI10.1007/978-3-642-17401-8_23zbMath1248.94054OpenAlexW1602086557MaRDI QIDQ3058737

Daniel J. Bernstein, Ruben Niederhagen, Tanja Lange, Chen-Mou Cheng, Peter Schwabe, Bo-Yin Yang, Hsieh-Chung Chen

Publication date: 7 December 2010

Published in: Progress in Cryptology - INDOCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/6c84a356-e072-45ae-b370-90fac0b2e37c

zbMATH Keywords

graphics processing unit (GPU)elliptic-curve cryptographyPollard rhocomputation of elliptic-curve discrete logarithm on Koblitz curveqhasm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

Solving the examination timetabling problem in GPUs ⋮ Computational hardness of IFP and ECDLP

Uses Software

• CUDA
• qhasm
• Cubin Utilities

This page was built for publication: ECC2K-130 on NVIDIA GPUs