Efficient Optimal Ate Pairing at 128-Bit Security Level


Following the emergence of Kim and Barbulescu’s new number field sieve (exTNFS) algorithm at CRYPTO’16 [21] for solving discrete logarithm problem (DLP) over the finite field; pairing-based cryptography researchers are intrigued to find new parameters that confirm standard security levels against exTNFS. Recently, Barbulescu and Duquesne have suggested new… (More)
DOI: 10.1007/978-3-319-71667-1_10


10 Figures and Tables