Antoine Joux

According to our database1, Antoine Joux authored at least 127 papers between 1991 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms.
Math. Comput., 2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms.
IACR Cryptology ePrint Archive, 2019

Fully homomorphic encryption modulo Fermat numbers.
IACR Cryptology ePrint Archive, 2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms.
CoRR, 2019

Certified lattice reduction.
CoRR, 2019

2018
A Simplified Approach to Rigorous Degree 2 Elimination in Discrete Logarithm Algorithms.
IACR Cryptology ePrint Archive, 2018

A New Public-Key Cryptosystem via Mersenne Numbers.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

How to Securely Compute with Noisy Leakage in Quasilinear Complexity.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
A crossbred algorithm for solving Boolean polynomial systems.
IACR Cryptology ePrint Archive, 2017

How to Securely Compute with Noisy Leakage in Quasilinear Complexity.
IACR Cryptology ePrint Archive, 2017

A New Public-Key Cryptosystem via Mersenne Numbers.
IACR Cryptology ePrint Archive, 2017

Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk).
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

A Crossbred Algorithm for Solving Boolean Polynomial Systems.
Proceedings of the Number-Theoretic Methods in Cryptology - First International Conference, 2017

2016
Reducing number field defining polynomials: An application to class group computations.
IACR Cryptology ePrint Archive, 2016

Adaptive precision LLL and Potential-LLL reductions with Interval arithmetic.
IACR Cryptology ePrint Archive, 2016

Technical history of discrete logarithms in small characteristic finite fields - The road from subexponential to quasi-polynomial complexity.
Des. Codes Cryptogr., 2016

2015
Cryptanalysis of SHA-0 and Reduced SHA-1.
J. Cryptology, 2015

Nearly Sparse Linear Algebra.
IACR Cryptology ePrint Archive, 2015

Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search.
IACR Cryptology ePrint Archive, 2015

2014
Recovering a sum of two squares decomposition.
J. Symb. Comput., 2014

Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields.
IACR Cryptology ePrint Archive, 2014

Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

The Past, Evolving Present, and Future of the Discrete Logarithm.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

2013
Pairing the volcano.
Math. Comput., 2013

Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields - Application to the Static Diffie-Hellman Problem on $E(\mathbb{F}_{q^{5}})$.
J. Cryptology, 2013

On Diffie-Hellman - like Security Assumptions.
IACR Cryptology ePrint Archive, 2013

The Special Number Field Sieve in Fpn, Application to Pairing-Friendly Constructions.
IACR Cryptology ePrint Archive, 2013

A new index calculus algorithm with complexity L(1/4+o(1)) in very small characteristic.
IACR Cryptology ePrint Archive, 2013

Injective Encoding to Elliptic Curves.
IACR Cryptology ePrint Archive, 2013

Multi-user collisions: Applications to Discrete Logs, Even-Mansour and Prince.
IACR Cryptology ePrint Archive, 2013

Solving shortest and closest vector problems: The decomposition approach.
IACR Cryptology ePrint Archive, 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
IACR Cryptology ePrint Archive, 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
CoRR, 2013

A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic.
Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

The Special Number Field Sieve in 𝔽pn - Application to Pairing-Friendly Constructions.
Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

Security Ranking Among Assumptions Within the Uber Assumption Framework.
Proceedings of the Information Security, 16th International Conference, 2013

Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields.
Proceedings of the Advances in Cryptology, 2013

Injective Encodings to Elliptic Curves.
Proceedings of the Information Security and Privacy - 18th Australasian Conference, 2013

2012
A family of weak keys in HFE and the corresponding practical key-recovery.
J. Mathematical Cryptology, 2012

Faster index calculus for the medium prime case. Application to 1175-bit and 1425-bit finite fields.
IACR Cryptology ePrint Archive, 2012

Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding.
IACR Cryptology ePrint Archive, 2012

Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $\mathbb{F}_{p^6}$.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract).
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Towards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

2011
Number Field Sieve for the DLP.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a seemingly secure curve over Fp6.
IACR Cryptology ePrint Archive, 2011

Improved Generic Algorithms for Hard Knapsacks.
IACR Cryptology ePrint Archive, 2011

Cryptanalysis of the RSA Subgroup Assumption from TCC 2005.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Improved Generic Algorithms for Hard Knapsacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

A Variant of the F4 Algorithm.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
On the security of blockwise secure modes of operation beyond the birthday bound.
IEEE Trans. Information Theory, 2010

A variant of the F4 algorithm.
IACR Cryptology ePrint Archive, 2010

Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields. Application to the static Diffie-Hellman problem on E(Fq5).
IACR Cryptology ePrint Archive, 2010

Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree.
IACR Cryptology ePrint Archive, 2010

New generic algorithms for hard knapsacks.
IACR Cryptology ePrint Archive, 2010

Cryptanalysis of the RSA Subgroup Assumption from TCC 2005.
IACR Cryptology ePrint Archive, 2010

Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Cryptanalysis of the Hidden Matrix Cryptosystem.
Proceedings of the Progress in Cryptology, 2010

New Generic Algorithms for Hard Knapsacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Pairing the Volcano.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009
Introduction to Identity-Based Cryptography.
Proceedings of the Identity-Based Cryptography, 2009

Improved generic algorithms for 3-collisions.
IACR Cryptology ePrint Archive, 2009

Fault Attacks on RSA Signatures with Partially Unknown Messages.
IACR Cryptology ePrint Archive, 2009

A Family of Weak Keys in HFE (and the Corresponding Practical Key-Recovery).
IACR Cryptology ePrint Archive, 2009

On the Security of Iterated Hashing based on Forgery-resistant Compression Functions.
IACR Cryptology ePrint Archive, 2009

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.
Proceedings of the Cryptography and Coding, 2009

Fault Attacks on RSA Signatures with Partially Unknown Messages.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2009

Improved Generic Algorithms for 3-Collisions.
Proceedings of the Advances in Cryptology, 2009

Factoring pq2 with Quadratic Forms: Nice Cryptanalyses.
Proceedings of the Advances in Cryptology, 2009

2008
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.
IACR Cryptology ePrint Archive, 2008

Another approach to pairing computation in Edwards coordinates.
IACR Cryptology ePrint Archive, 2008

Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers.
Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

Another Approach to Pairing Computation in Edwards Coordinates.
Proceedings of the Progress in Cryptology, 2008

Yet Another Attack on Vest.
Proceedings of the Progress in Cryptology, 2008

2007
When e-th Roots Become Easier Than Factoring.
IACR Cryptology ePrint Archive, 2007

Overtaking VEST.
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

Toward a Rigorous Variation of Coppersmith's Algorithm on Three Variables.
Proceedings of the Advances in Cryptology, 2007

Hash Functions and the (Amplified) Boomerang Attack.
Proceedings of the Advances in Cryptology, 2007

When e-th Roots Become Easier Than Factoring.
Proceedings of the Advances in Cryptology, 2007

2006
Counting points on elliptic curves in medium characteristic.
IACR Cryptology ePrint Archive, 2006

Galois LFSR, Embedded Devices and Side Channel Weaknesses.
Proceedings of the Progress in Cryptology, 2006

Chosen-Ciphertext Attacks Against MOSQUITO.
Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

The Function Field Sieve in the Medium Prime Case.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

The Number Field Sieve in the Medium Prime Case.
Proceedings of the Advances in Cryptology, 2006

Inverting HFE Is Quasipolynomial.
Proceedings of the Advances in Cryptology, 2006

2005
Cryptanalysis of the Tractable Rational Map Cryptosystem.
Proceedings of the Public Key Cryptography, 2005

Two Attacks Against the HBB Stream Cipher.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

Collisions of SHA-0 and Reduced SHA-1.
Proceedings of the Advances in Cryptology, 2005

2004
A One Round Protocol for Tripartite Diffie-Hellman.
J. Cryptology, 2004

Cryptanalysis of a Provably Secure Cryptographic Hash Function.
IACR Cryptology ePrint Archive, 2004

Blockwise Adversarial Model for On-line Ciphers and Symmetric Encryption Schemes.
Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions.
Proceedings of the Advances in Cryptology, 2004

2003
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method.
Math. Comput., 2003

Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups.
J. Cryptology, 2003

A Chosen IV Attack Against Turing.
Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

Authenticated On-Line Encryption.
Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

New Attacks against Standardized MACs.
Proceedings of the Fast Software Encryption, 10th International Workshop, 2003

Loosening the KNOT.
Proceedings of the Fast Software Encryption, 10th International Workshop, 2003

Cryptanalysis of the EMD Mode of Operation.
Proceedings of the Advances in Cryptology, 2003

Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases.
Proceedings of the Advances in Cryptology, 2003

2002
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit: A New Construction.
Proceedings of the Fast Software Encryption, 9th International Workshop, 2002

Fast Correlation Attacks: An Algorithmic Point of View.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBC.
Proceedings of the Advances in Cryptology, 2002

The Function Field Sieve Is Quite Special.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
"Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm.
Math. Comput., 2001

Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
IACR Cryptology ePrint Archive, 2001

On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction.
IACR Cryptology ePrint Archive, 2001

Cryptanalysis of PKP: A New Approach.
Proceedings of the Public Key Cryptography, 2001

2000
A Statistical Attack on RC6.
Proceedings of the Fast Software Encryption, 7th International Workshop, 2000

A NICE Cryptanalysis.
Proceedings of the Advances in Cryptology, 2000

A Chosen-Ciphertext Attack against NTRU.
Proceedings of the Advances in Cryptology, 2000

Why Textbook ElGamal and RSA Encryption Are Insecure.
Proceedings of the Advances in Cryptology, 2000

A One Round Protocol for Tripartite Diffie-Hellman.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1998
The action of a few permutations on r-tuples is quickly transitive.
Random Struct. Algorithms, 1998

Lattice Reduction: A Toolbox for the Cryptanalyst.
J. Cryptology, 1998

Differential Collisions in SHA-0.
Proceedings of the Advances in Cryptology, 1998

1996
The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography.
Proceedings of the STACS 96, 1996

1994
A Practical Attack against Knapsack based Hash Functions (Extended Abstract).
Proceedings of the Advances in Cryptology, 1994

1992
Improved Low-Density Subset Sum Algorithms.
Computational Complexity, 1992

1991
Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks.
Proceedings of the Advances in Cryptology, 1991

Cryptanalysis of Another Knapsack Cryptosystem.
Proceedings of the Advances in Cryptology, 1991


  Loading...