![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Olivier Bernard 0002
Person information
- affiliation: THALES Communications and Security, Gennevilliers, France
- affiliation: University Rennes, CNRS, IRISA, France
Other persons with the same name
- Olivier Bernard — disambiguation page
- Olivier Bernard 0001
— University of Lyon, INSA, CREATIS, Lyon, France
- Olivier Bernard 0003
— Université Nice Côte d'Azur, INRIA, BIOCORE, Sophia-Antipolis, France (and 1 more)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Olivier Bernard
, Pierre-Alain Fouque
, Andrea Lesavourey
:
Computing e-th roots in number fields. ALENEX 2024: 207-219 - 2023
- [j1]Olivier Bernard
, Radan Kucera:
A short basis of the Stickelberger ideal of a cyclotomic field. Math. Comput. 93(346): 887-909 (2023) - 2022
- [b1]Olivier Bernard:
Algebraic cryptanalysis of the shortest vector problem in ideal lattices. (Cryptanalyse algébrique du problème du plus court vecteur dans les réseaux idéaux). University of Rennes 1, France, 2022 - [c4]Olivier Bernard
, Andrea Lesavourey
, Tuong-Huy Nguyen, Adeline Roux-Langlois
:
Log-S-unit Lattices Using Explicit Stickelberger Generators to Solve Approx Ideal-SVP. ASIACRYPT (3) 2022: 677-708 - 2021
- [i4]Olivier Bernard, Andrea Lesavourey
, Tuong-Huy Nguyen, Adeline Roux-Langlois:
Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP. IACR Cryptol. ePrint Arch. 2021: 1384 (2021) - 2020
- [c3]Olivier Bernard
, Adeline Roux-Langlois
:
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. ASIACRYPT (2) 2020: 349-380 - [i3]Olivier Bernard, Adeline Roux-Langlois:
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. IACR Cryptol. ePrint Arch. 2020: 1081 (2020)
2010 – 2019
- 2018
- [i2]Olivier Bernard, Renaud Dubois, Simon Masson:
Efficient four-dimensional GLV curve with high security. IACR Cryptol. ePrint Arch. 2018: 305 (2018) - 2017
- [c2]Alexandre Anzala-Yamajako, Olivier Bernard
, Matthieu Giraud, Pascal Lafourcade
:
No Such Thing as a Small Leak: Leakage-Abuse Attacks Against Symmetric Searchable Encryption. ICETE (Selected Papers) 2017: 253-277 - [c1]Matthieu Giraud, Alexandre Anzala-Yamajako, Olivier Bernard
, Pascal Lafourcade
:
Practical Passive Leakage-abuse Attacks Against Symmetric Searchable Encryption. SECRYPT 2017: 200-211 - [i1]Matthieu Giraud, Alexandre Anzala-Yamajako, Olivier Bernard, Pascal Lafourcade:
Practical Passive Leakage-Abuse Attacks Against Symmetric Searchable Encryption. IACR Cryptol. ePrint Arch. 2017: 46 (2017)
Coauthor Index
![](https://dblp.uni-trier.de/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-11 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint