![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Alice Pellet-Mary
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Guilhem Mureau, Alice Pellet-Mary, Georgii Pliatsok, Alexandre Wallet:
Cryptanalysis of Rank-2 Module-LIP in Totally Real Number Fields. EUROCRYPT (6) 2024: 226-255 - [i15]Guilhem Mureau, Alice Pellet-Mary, Heorhii Pliatsok, Alexandre Wallet:
Cryptanalysis of rank-2 module-LIP in Totally Real Number Fields. IACR Cryptol. ePrint Arch. 2024: 441 (2024) - [i14]Clémence Chevignard, Pierre-Alain Fouque, Guilhem Mureau, Alice Pellet-Mary, Alexandre Wallet:
A reduction from Hawk to the principal ideal problem in a quaternion algebra. IACR Cryptol. ePrint Arch. 2024: 1147 (2024) - 2023
- [c11]Gabrielle De Micheli, Daniele Micciancio
, Alice Pellet-Mary, Nam Tran:
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL. CRYPTO (5) 2023: 836-865 - [c10]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski:
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. TCC (4) 2023: 63-92 - [i13]Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran:
Reductions from module lattices to free module lattices, and application to dequantizing module-LLL. IACR Cryptol. ePrint Arch. 2023: 886 (2023) - [i12]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski:
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. IACR Cryptol. ePrint Arch. 2023: 1370 (2023) - 2022
- [c9]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé:
On Module Unique-SVP and NTRU. ASIACRYPT (3) 2022: 709-740 - [c8]Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary:
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. CRYPTO (2) 2022: 480-509 - [i11]Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary:
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. IACR Cryptol. ePrint Arch. 2022: 709 (2022) - [i10]Joël Felderhoff, Alice Pellet-Mary, Damien Stehlé:
On Module Unique-SVP and NTRU. IACR Cryptol. ePrint Arch. 2022: 1203 (2022) - 2021
- [c7]Alice Pellet-Mary, Damien Stehlé:
On the Hardness of the NTRU Problem. ASIACRYPT (1) 2021: 3-35 - [i9]Alice Pellet-Mary, Damien Stehlé:
On the hardness of the NTRU problem. IACR Cryptol. ePrint Arch. 2021: 821 (2021) - 2020
- [c6]Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski:
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. CRYPTO (2) 2020: 243-273 - [c5]Shweta Agrawal, Alice Pellet-Mary:
Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE. EUROCRYPT (1) 2020: 110-140 - [i8]Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski:
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. IACR Cryptol. ePrint Arch. 2020: 297 (2020) - [i7]Shweta Agrawal, Alice Pellet-Mary:
Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE. IACR Cryptol. ePrint Arch. 2020: 415 (2020)
2010 – 2019
- 2019
- [b1]Alice Pellet-Mary:
On ideal lattices and the GGH13 multilinear map. (Réseaux idéaux et fonction multilinéaire GGH13). University of Lyon, France, 2019 - [c4]Changmin Lee, Alice Pellet-Mary, Damien Stehlé, Alexandre Wallet
:
An LLL Algorithm for Module Lattices. ASIACRYPT (2) 2019: 59-90 - [c3]Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé:
Approx-SVP in Ideal Lattices with Pre-processing. EUROCRYPT (2) 2019: 685-716 - [i6]Alice Pellet-Mary, Guillaume Hanrot, Damien Stehlé:
Approx-SVP in Ideal Lattices with Pre-processing. IACR Cryptol. ePrint Arch. 2019: 215 (2019) - [i5]Changmin Lee, Alice Pellet-Mary, Damien Stehlé, Alexandre Wallet:
An LLL Algorithm for Module Lattices. IACR Cryptol. ePrint Arch. 2019: 1035 (2019) - 2018
- [c2]Léo Ducas, Alice Pellet-Mary:
On the Statistical Leak of the GGH13 Multilinear Map and Some Variants. ASIACRYPT (1) 2018: 465-493 - [c1]Alice Pellet-Mary:
Quantum Attacks Against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model. CRYPTO (3) 2018: 153-183 - [i4]Alice Pellet-Mary:
Quantum Attacks against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model. IACR Cryptol. ePrint Arch. 2018: 533 (2018) - 2017
- [i3]Léo Ducas, Alice Pellet-Mary:
On the Statistical Leak of the GGH13 Multilinear Map and some Variants. IACR Cryptol. ePrint Arch. 2017: 482 (2017) - [i2]Martin R. Albrecht, Alex Davidson, Enrique Larraia, Alice Pellet-Mary:
Notes On GGH13 Without The Presence Of Ideals. IACR Cryptol. ePrint Arch. 2017: 906 (2017) - 2015
- [i1]Alice Pellet-Mary, Damien Stehlé:
Cryptanalysis of Gu's ideal multilinear map. IACR Cryptol. ePrint Arch. 2015: 759 (2015)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-03 20:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint