default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Kirchner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Charles Bouillaguet
, Ambroise Fleury, Pierre-Alain Fouque, Paul Kirchner:
We are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve. ASIACRYPT (4) 2023: 138-166- [i20]Charles Bouillaguet, Ambroise Fleury, Pierre-Alain Fouque, Paul Kirchner:
We Are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve. IACR Cryptol. ePrint Arch. 2023: 801 (2023) - 2022
- [j2]Pierre-Alain Fouque, Paul Kirchner, Thomas Pornin, Yang Yu:
BAT: Small and Fast KEM over NTRU Lattices. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(2): 240-265 (2022) - [i19]Pierre-Alain Fouque, Paul Kirchner, Thomas Pornin, Yang Yu:
BAT: Small and Fast KEM over NTRU Lattices. IACR Cryptol. ePrint Arch. 2022: 31 (2022) - 2021
- [c10]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Towards Faster Polynomial-Time Lattice Reduction. CRYPTO (2) 2021: 760-790 - 2020
- [c9]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Fast Reduction of Algebraic Lattices over Cyclotomic Fields. CRYPTO (2) 2020: 155-185 - [c8]Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k). CRYPTO (2) 2020: 186-212 - [c7]Pierre-Alain Fouque, Paul Kirchner, Mehdi Tibouchi, Alexandre Wallet, Yang Yu:
Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices. EUROCRYPT (3) 2020: 34-63 - [i18]Thomas Espitau, Paul Kirchner:
The nearest-colattice algorithm. CoRR abs/2006.05660 (2020) - [i17]Thomas Espitau, Paul Kirchner:
The nearest-colattice algorithm. IACR Cryptol. ePrint Arch. 2020: 694 (2020) - [i16]Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen:
Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)). IACR Cryptol. ePrint Arch. 2020: 707 (2020) - [i15]Paul Kirchner, Pierre-Alain Fouque:
Getting Rid of Linear Algebra in Number Theory Problems. IACR Cryptol. ePrint Arch. 2020: 1619 (2020)
2010 – 2019
- 2019
- [i14]Thomas Espitau, Paul Kirchner, Pierre-Alain Fouque:
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. CoRR abs/1912.04586 (2019) - [i13]Pierre-Alain Fouque, Paul Kirchner, Mehdi Tibouchi, Alexandre Wallet, Yang Yu:
Uprooting the Falcon Tree? IACR Cryptol. ePrint Arch. 2019: 1180 (2019) - [i12]Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. IACR Cryptol. ePrint Arch. 2019: 1436 (2019) - 2018
- [i11]Pierre-Alain Fouque, Benjamin Hadjibeyli, Paul Kirchner:
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes. IACR Cryptol. ePrint Arch. 2018: 653 (2018) - 2017
- [c6]Paul Kirchner, Pierre-Alain Fouque:
Revisiting Lattice Attacks on Overstretched NTRU Parameters. EUROCRYPT (1) 2017: 3-26 - [c5]Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. EUROCRYPT (1) 2017: 60-88 - [c4]Charles Bouillaguet, Claire Delaplace, Pierre-Alain Fouque, Paul Kirchner:
Fast Lattice-Based Encryption: Stretching Spring. PQCrypto 2017: 125-142 - [i10]Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
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: 142 (2017) - 2016
- [c3]Pierre-Alain Fouque, Pierre Karpman, Paul Kirchner, Brice Minaud:
Efficient and Provable White-Box Primitives. ASIACRYPT (1) 2016: 159-188 - [c2]Pierre-Alain Fouque, Benjamin Hadjibeyli, Paul Kirchner:
Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes. COCOON 2016: 269-280 - [i9]Paul Kirchner:
Algorithms on Ideal over Complex Multiplication order. CoRR abs/1602.09037 (2016) - [i8]Paul Kirchner:
Algorithms on Ideal over Complex Multiplication order. IACR Cryptol. ePrint Arch. 2016: 220 (2016) - [i7]Paul Kirchner, Pierre-Alain Fouque:
Time-Memory Trade-Off for Lattice Enumeration in a Ball. IACR Cryptol. ePrint Arch. 2016: 222 (2016) - [i6]Pierre-Alain Fouque, Pierre Karpman, Paul Kirchner, Brice Minaud:
Efficient and Provable White-Box Primitives. IACR Cryptol. ePrint Arch. 2016: 642 (2016) - [i5]Paul Kirchner, Pierre-Alain Fouque:
Comparison between Subfield and Straightforward Attacks on NTRU. IACR Cryptol. ePrint Arch. 2016: 717 (2016) - [i4]Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner:
Computing generator in cyclotomic integer rings. IACR Cryptol. ePrint Arch. 2016: 957 (2016) - 2015
- [c1]Paul Kirchner, Pierre-Alain Fouque:
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices. CRYPTO (1) 2015: 43-62 - [i3]Paul Kirchner, Pierre-Alain Fouque:
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices. CoRR abs/1506.02717 (2015) - [i2]Paul Kirchner, Pierre-Alain Fouque:
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices. IACR Cryptol. ePrint Arch. 2015: 552 (2015) - 2011
- [i1]Paul Kirchner:
Improved Generalized Birthday Attack. IACR Cryptol. ePrint Arch. 2011: 377 (2011)
2000 – 2009
- 2005
- [j1]Paul Kirchner:
Arguing to learn. Br. J. Educ. Technol. 36(3): 575-576 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
