default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEamonn W. Postlethwaite
Person information
- affiliation: King's College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Léo Ducas
, Thomas Espitau, Eamonn W. Postlethwaite:
Finding Short Integer Solutions When the Modulus Is Small. CRYPTO (3) 2023: 150-176- [i10]Léo Ducas, Thomas Espitau, Eamonn W. Postlethwaite:
Finding short integer solutions when the modulus is small. IACR Cryptol. ePrint Arch. 2023: 1125 (2023) - [i9]Charanjit S. Jutla, Eamonn W. Postlethwaite, Arnab Roy:
A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs. IACR Cryptol. ePrint Arch. 2023: 1858 (2023) - 2022
- [c8]Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel P. J. van Woerden:
Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple. ASIACRYPT (4) 2022: 65-94 - [i8]Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel P. J. van Woerden:
Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple. IACR Cryptol. ePrint Arch. 2022: 1155 (2022) - 2021
- [c7]Keitaro Hashimoto, Shuichi Katsumata, Eamonn W. Postlethwaite, Thomas Prest, Bas Westerbaan:
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs. CCS 2021: 1441-1462 - [c6]Rouzbeh Behnia, Eamonn W. Postlethwaite, Muslum Ozgur Ozmen, Attila Altay Yavuz:
Lattice-Based Proof-of-Work for Post-Quantum Blockchains. DPM/CBT@ESORICS 2021: 310-318 - [c5]Eamonn W. Postlethwaite, Fernando Virdia:
On the Success Probability of Solving Unique SVP via BKZ. Public Key Cryptography (1) 2021: 68-98 - [i7]Keitaro Hashimoto, Shuichi Katsumata, Eamonn W. Postlethwaite, Thomas Prest, Bas Westerbaan:
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs. IACR Cryptol. ePrint Arch. 2021: 1407 (2021) - 2020
- [c4]Martin R. Albrecht, Vlad Gheorghiu, Eamonn W. Postlethwaite, John M. Schanck:
Estimating Quantum Speedups for Lattice Sieves. ASIACRYPT (2) 2020: 583-613 - [i6]Eamonn W. Postlethwaite, Fernando Virdia:
On the Success Probability of Solving Unique SVP via BKZ. IACR Cryptol. ePrint Arch. 2020: 1308 (2020) - [i5]Rouzbeh Behnia, Eamonn W. Postlethwaite, Muslum Ozgur Ozmen, Attila Altay Yavuz:
Lattice-Based Proof-of-Work for Post-Quantum Blockchains. IACR Cryptol. ePrint Arch. 2020: 1362 (2020)
2010 – 2019
- 2019
- [c3]Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik:
Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving. ASIACRYPT (1) 2019: 521-551 - [c2]Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens:
The General Sieve Kernel and New Records in Lattice Reduction. EUROCRYPT (2) 2019: 717-746 - [i4]Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens:
The General Sieve Kernel and New Records in Lattice Reduction. IACR Cryptol. ePrint Arch. 2019: 89 (2019) - [i3]Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite, Subhayan Roy Moulik:
Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving. IACR Cryptol. ePrint Arch. 2019: 1016 (2019) - [i2]Martin R. Albrecht, Vlad Gheorghiu, Eamonn W. Postlethwaite, John M. Schanck:
Quantum speedups for lattice sieves are tenuous at best. IACR Cryptol. ePrint Arch. 2019: 1161 (2019) - 2018
- [c1]Martin R. Albrecht, Benjamin R. Curtis, Amit Deo, Alex Davidson, Rachel Player, Eamonn W. Postlethwaite, Fernando Virdia, Thomas Wunderer:
Estimate All the {LWE, NTRU} Schemes! SCN 2018: 351-367 - [i1]Martin R. Albrecht, Benjamin R. Curtis, Amit Deo, Alex Davidson, Rachel Player, Eamonn W. Postlethwaite, Fernando Virdia, Thomas Wunderer:
Estimate all the {LWE, NTRU} schemes! IACR Cryptol. ePrint Arch. 2018: 331 (2018)
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-10-09 20:32 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:
