Challenges with assessing the impact of nfs advances on the security of pairing-based cryptography

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

In the past two years there have been several advances in Number Field Sieve (NFS) algorithms for computing discrete logarithms in finite fields Fpnwhere p is prime and n>1 is a small integer. This article presents a concise overview of these algorithms and discusses some of the challenges with assessing their impact on keylengths for pairing-based cryptosystems.

First Page

83

Last Page

108

DOI

10.1007/978-3-319-61273-7_5

Publication Date

1-1-2017

This document is currently not available here.

Share

COinS