A Kilobit Hidden SNFS Discrete Logarithm Computation

@article{Fried2017AKH,
  title={A Kilobit Hidden SNFS Discrete Logarithm Computation},
  author={Joshua Fried and P. Gaudry and N. Heninger and Emmanuel Thom{\'e}},
  journal={ArXiv},
  year={2017},
  volume={abs/1610.02874}
}
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. 
Analysis and Improvements to the Special Number Field Sieve for Discrete Logarithm Problems
TLDR
This work proposes a new method to find the special number field sieve(SNFS) polynomial pair of a given prime, and recommends a simple ad-hoc detection of the trapdoor before doing the general numberField sieve (GNFS) to a prime $p$. Expand
Computing Discrete Logarithms in 𝔽p6
TLDR
This work addresses the question of degree 6 and aims at providing real-life timings for discrete logarithms in small degree extensions of finite fields of large characteristic, and shows how to improve many parts of the NFS-DL algorithm to reach this target. Expand
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
TLDR
Two new records are reported: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 7 95-bit prime field, and it is shown that computing a discreteLogarithms is not much harder than a factorized number of the same size. Expand
On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation
  • Fabrice Boudot
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
  • 2017
TLDR
The pre-computation phase for a 768-bit discrete logarithm problem, that allows for example to build a massive decryption tool of IPsec traffic protected by the Oakley group 1, was feasible in reasonable time using technologies available before the year 2000. Expand
Refined analysis to the extended tower number field sieve
TLDR
A uniform formula is given for the total complexity of the extended tower number field sieve and a method is proposed to improve the computation in the smoothing phase by exploring subfield structures when the extension degree is composite. Expand
Faster individual discrete logarithms in finite fields of composite extension degree
TLDR
This work improves the initial splitting phase and applies to any nonprime finite field, and is very efficient when the extension degree is composite. Expand
Threshold Kleptographic Attacks on Discrete Logarithm Based Signatures
  • G. Teseleanu
  • Mathematics, Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2017
TLDR
This work combines the notions of threshold scheme and kleptographic attack to construct the first \(\ell \) out of n threshold klePTographic attack on discrete logarithm based digital signatures and prove its security in the standard and random oracle models. Expand
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
TLDR
This work presents succinct two-party protocols for securely computing branching programs and \({\mathsf{NC}^1}\) circuits under the DDH assumption, providing the first alternative to fully homomorphic encryption. Expand
Updating key size estimations for pairings Razvan Barbulescu
Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings and propose new key sizes using anExpand
Sieve algorithms for the discrete logarithm in medium characteristic finite fields. (Algorithmes de crible pour le logarithme discret dans les corps finis de moyenne caractéristique)
TLDR
This thesis proposes and study two new sieve algorithms allowing us to treat any dimensions, with an emphasis on the three-dimensional case, and provides a complete implementation of the relation collection for some variants of the NFS in three dimensions. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 65 REFERENCES
A Kilobit Special Number Field Sieve Factorization
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 21039 - 1.Expand
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
TLDR
It is shown that the number field sieve outperforms the gaussian integer method in the hundred digit range by successfully computing discrete logarithms with GNFS in a large prime field. Expand
On asymptotic complexity of computing discrete logarithms over GF(p)
We analyse the modification of an algorithm for finding discrete logarithms over the field GF(p) (p is a prime number) which has been described by the author previously. It is shown that thisExpand
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
  • D. Gordon
  • Mathematics, Computer Science
  • CRYPTO
  • 1992
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cryptosystems, suchExpand
Generating Eecient Primes for Discrete Log Cryptosystems
This paper presents a method for generating prime moduli with a special form which can simplify the modular reduction process and reduce the storage requirement. Such moduli will be particularlyExpand
Factorization of a 768-Bit RSA Modulus
This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
Modifications to the Number Field Sieve
TLDR
The fact that certain smoothness computations can be reused, and thereby reduce the asymptotic running time of the Number Field Sieve, is used to give a way to precompute tables which will be useful for factoring any integers in a large range. Expand
Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm
In this thesis we outline new research in integer factorisation with applications to public-key cryptography. In particular, we consider the number field sieve, the newest and fastest knownmethod forExpand
Discrete logarithms and local units
  • Oliver Schirokauer
  • Mathematics
  • Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences
  • 1993
Let K be a number field and (9K its ring of integers. Let l be a prime number and e a positive integer. We give a method to construct leth powers in (9K using smooth algebraic integers. This methodExpand
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
TLDR
An algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera using heuristics similar to the ones used in the number field sieves or the function field sieve is presented. Expand
...
1
2
3
4
5
...