We investigate the security of Diffie-Hellman key exchange as used in popular Internet
protocols and find it to be less secure than widely believed. First, we present Logjam, a …

Cryptography plays a key role in ensuring the privacy and integrity of data and the security of
computer networks. Introduction to Modern Cryptography provides a rigorous yet accessible …

THE LEGACYFirst introduced in 1995, Cryptography: Theory and Practice garnered
enormous praise and popularity, and soon became the standard textbook for cryptography …

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 …

We introduce a new variant of the number field sieve algorithm for discrete logarithms in F _
p^ n called exTNFS. The most important modification is done in the polynomial selection …

In typical applications of homomorphic encryption, the first step consists for Alice of
encrypting some plaintext m under Bob's public key pk pk and of sending the ciphertext c …

This book is devoted to efficient pairing computations and implementations, useful tools for
cryptographers working on topics like identity-based cryptography and the simplification of …

Abstract The recent Bimodal Lattice Signature Scheme (Bliss) showed that lattice-based
constructions have evolved to practical alternatives to RSA or ECC. Besides reasonably …

We give a randomized reduction for the Rank Syndrome Decoding problem and Rank
Minimum Distance problem for rank codes over extension fields. Our results are based on …

In the past two years there have been several advances in Number Field Sieve (NFS)
algorithms for computing discrete logarithms in finite fields\mathbb F _ p^ n where p is prime …