Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2023.3244631
Abstract: The hardness of discrete logarithm problem (DLP) over finite fields is the security foundation of many cryptographic protocols. When the characteristic is not small, the state-of-the-art algorithms for solving DLP are the number field sieve… read more here.
Keywords: number field; tex math; finite fields; inline formula ... See more keywords