Cryptology ePrint Archive: Report 2014/119

Available versions in chronological order


Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\F_{2^{4 \cdot 1223}}$ and $\F_{2^{12 \cdot 367}}$)
Robert Granger and Thorsten Kleinjung and Jens Zumbr\"agel

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in ${\mathbb F}_{2^{4 \cdot 1223}}$ and ${\mathbb F}_{2^{12 \cdot 367}}$)
Robert Granger and Thorsten Kleinjung and Jens Zumbr\"agel

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in ${\mathbb F}_{2^{4 \cdot 1223}}$ and ${\mathbb F}_{2^{12 \cdot 367}}$)
Robert Granger and Thorsten Kleinjung and Jens Zumbr\"agel


[ Cryptology ePrint archive ]