Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428129
DOI10.1007/b11817zbMath1122.68456WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428129
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
Related Items
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