Computation of a 768-Bit Prime Field Discrete Logarithm
نویسندگان
چکیده
This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly discusses the cryptologic relevance of the result.
منابع مشابه
On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation
The number field sieve is the best-known algorithm for factoring integers and solving the discrete logarithm problem in prime fields. In this paper, we present some new improvements to various steps of the number field sieve. We apply these improvements on the current 768bit discrete logarithm record and show that we are able to perform the overall computing time in about 1260 core·years using ...
متن کاملA Kilobit Hidden SNFS Discrete Logarithm Computation
We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a little over two months of calendar time on an academic cluster using the open-source CADO-NFS software. Our chosen prime p looks random, and p−1 has a 160-bit pri...
متن کاملComments on the Transition Paper
Meeting the requirements of NIST’s new cryptographic standards means phasingout usage of 1024-bit RSA and 160-bit elliptic curve cryptography (ECC) by the end of theyear 2010. This write-up comments on the vulnerability of these systems to an open communityattack effort and aims to assess the risk of their continued usage beyond 2010. We conclude thatfor 1024-bit RSA the risk is...
متن کاملAn Efficient Anonymous Group Identification Scheme with Short Secret Keys
We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu [7] and prove that this scheme is secure under the discrete logarithm with short exponents assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number. We show that the communication and the computation costs ar...
متن کاملDiscrete logarithm in GF(2) with FFS
We give details on solving the discrete logarithm problem in the 202-bit prime order subgroup of F2809 using the Function Field Sieve algorithm (FFS). To our knowledge, this computation is the largest discrete logarithm computation so far in a binary field extension of prime degree. The Function Field Sieve is the traditional approach for solving these problems, and has been used in previous re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017