Paul Kirchner

According to our database1, Paul Kirchner authored at least 24 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
We Are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve.
IACR Cryptol. ePrint Arch., 2023

2022
BAT: Small and Fast KEM over NTRU Lattices.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

2021
Towards Faster Polynomial-Time Lattice Reduction.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Getting Rid of Linear Algebra in Number Theory Problems.
IACR Cryptol. ePrint Arch., 2020

The nearest-colattice algorithm.
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).
IACR Cryptol. ePrint Arch., 2020

Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Fast Reduction of Algebraic Lattices over Cyclotomic Fields.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k<sup>1/(2k)</sup> Time k<sup>k/8+o(k)</sup>.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond.
IACR Cryptol. ePrint Arch., 2019

Uprooting the Falcon Tree?
IACR Cryptol. ePrint Arch., 2019

2018
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes.
IACR Cryptol. ePrint Arch., 2018

2017
Computing generator in cyclotomic integer rings, A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme.
IACR Cryptol. ePrint Arch., 2017

Fast Lattice-Based Encryption: Stretching Spring.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

Revisiting Lattice Attacks on Overstretched NTRU Parameters.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L<sub>|Δ𝕂|</sub>(½) and Application to the Cryptanalysis of a FHE Scheme.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Comparison between Subfield and Straightforward Attacks on NTRU.
IACR Cryptol. ePrint Arch., 2016

Time-Memory Trade-Off for Lattice Enumeration in a Ball.
IACR Cryptol. ePrint Arch., 2016

Algorithms on Ideal over Complex Multiplication order.
IACR Cryptol. ePrint Arch., 2016

Efficient and Provable White-Box Primitives.
IACR Cryptol. ePrint Arch., 2016

Computing generator in cyclotomic integer rings.
IACR Cryptol. ePrint Arch., 2016

2015
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices.
IACR Cryptol. ePrint Arch., 2015

2011
Improved Generalized Birthday Attack.
IACR Cryptol. ePrint Arch., 2011

2005
Arguing to learn.
Br. J. Educ. Technol., 2005


  Loading...