Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms.
Aurore GuillevicPublished in: IACR Cryptol. ePrint Arch. (2016)
Keyphrases
- orders of magnitude
- computational complexity
- computational cost
- times faster
- learning algorithm
- machine learning
- memory efficient
- data structure
- finite number
- optimization problems
- graph theory
- theoretical analysis
- computationally expensive
- computational geometry
- data mining algorithms
- data mining techniques
- significant improvement
- feature selection
- artificial intelligence