Recent progress on the elliptic curve discrete logarithm problem | SpringerLink Skip to main
content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart …

We propose an efficient commutative group action suitable for non-interactive key exchange
in a post-quantum setting. Our construction follows the layout of the Couveignes–Rostovtsev …

The Internet of Things (IoT) represents a growing aspect of how entities, including humans
and organizations, are likely to connect with others in their public and private interactions …

Cryptography is an indispensable tool used to protect information in computing systems. It is
used everywhere and by billions of people worldwide on a daily basis. It is used to protect …

We give a new signature scheme for isogenies that combines the class group actions of
CSIDH with the notion of Fiat-Shamir with aborts. Our techniques allow to have signatures of …

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 …

We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic
curve cryptography. We discuss both the advantages and drawbacks of our constructions …

Sensitive personal data are created in many application domains, and there is now an
increasing demand to share, integrate, and link such data within and across organisations in …

We derive a new formula for computing arbitrary odd-degree isogenies between elliptic
curves in Montgomery form. The formula lends itself to a simple and compact algorithm that …