Publications associées à Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2016

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Inhomogeneous minima of mixed signature lattices

Eva Bayer Fluckiger, Martino Borello, Peter Simon Jossen

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([ ...

Academic Press Inc Elsevier Science2016

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

Alexandre Raphaël Duc

Modern cryptography pushed forward the need of having provable security. Whereas ancient cryptography was only relying on heuristic assumptions and the secrecy of the designs, nowadays researchers try to make the security of schemes to rely on mathematical ...

EPFL2015

On the Analysis of Public-Key Cryptologic Algorithms

Andrea Miele

The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...

EPFL2015

Fragmentation in Time-of-Flight Spectrometry-Based Calculations of Ionic Electrospray Thruster Performance

Herbert Shea, Daniel George Courtney

A method has been presented for accounting for ion fragmentation that occurs within the nonzero field of an ionic electrospray thruster. Given the complexities associated with direct thrust measurements, indirect means (and time-of-flight (TOF) in particul ...

American Institute of Aeronautics and Astronautics2015

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Arjen Lenstra, Andrea Miele

We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on cons ...

Springer-Verlag Berlin2015

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Graph Chatbot

Chattez avec Graph Search

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Efficient Public-Key Distance Bounding Protocol

Inhomogeneous minima of mixed signature lattices

On the discrete logarithm problem in finite fields of fixed characteristic

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

On the Analysis of Public-Key Cryptologic Algorithms

Fragmentation in Time-of-Flight Spectrometry-Based Calculations of Ionic Electrospray Thruster Performance

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Inhomogeneous minima of mixed signature lattices

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

On the Analysis of Public-Key Cryptologic Algorithms

Efficient Public-Key Distance Bounding Protocol

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

On the discrete logarithm problem in finite fields of fixed characteristic

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Fragmentation in Time-of-Flight Spectrometry-Based Calculations of Ionic Electrospray Thruster Performance