Advances in Cryptology - CRYPTO 2003

DOI10.1007/b11817zbMath1122.68456OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428129

Qi Cheng

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11817

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Primality (11Y11)

Related Items (3)

On the construction of finite field elements of large order ⋮ Proving primality in essentially quartic random time ⋮ Implementing the asymptotically fast version of the elliptic curve primality proving algorithm

This page was built for publication: Advances in Cryptology - CRYPTO 2003