default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRodolphe Lampe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j1]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. J. Cryptol. 31(4): 1064-1119 (2018)- 2015
- [c8]Benoit Cogliati, Rodolphe Lampe, Yannick Seurin:
Tweaking Even-Mansour Ciphers. CRYPTO (1) 2015: 189-208 - [i7]Rodolphe Lampe, Yannick Seurin:
Tweakable Blockciphers with Asymptotically Optimal Security. IACR Cryptol. ePrint Arch. 2015: 182 (2015) - [i6]Benoit Cogliati, Rodolphe Lampe, Yannick Seurin:
Tweaking Even-Mansour Ciphers. IACR Cryptol. ePrint Arch. 2015: 539 (2015) - 2014
- [b1]Rodolphe Lampe:
Preuves de sécurité en cryptographie symétrique à l'aide de la technique du coupling. (Security proofs in symmetric cryptography using the coupling technique). Versailles Saint-Quentin-en-Yvelines University, France, 2014 - [c7]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. CRYPTO (1) 2014: 39-56 - [c6]Rodolphe Lampe, Yannick Seurin:
Security Analysis of Key-Alternating Feistel Ciphers. FSE 2014: 243-264 - [c5]Benoit Cogliati, Rodolphe Lampe, Jacques Patarin:
The Indistinguishability of the XOR of k Permutations. FSE 2014: 285-302 - [i5]Rodolphe Lampe, Yannick Seurin:
Security Analysis of Key-Alternating Feistel Ciphers. IACR Cryptol. ePrint Arch. 2014: 151 (2014) - [i4]Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. IACR Cryptol. ePrint Arch. 2014: 443 (2014) - 2013
- [c4]Rodolphe Lampe, Yannick Seurin:
How to Construct an Ideal Cipher from a Small Set of Public Permutations. ASIACRYPT (1) 2013: 444-463 - [c3]Rodolphe Lampe, Yannick Seurin:
Tweakable Blockciphers with Asymptotically Optimal Security. FSE 2013: 133-151 - [i3]Rodolphe Lampe, Yannick Seurin:
How to Construct an Ideal Cipher from a Small Set of Public Permutations. IACR Cryptol. ePrint Arch. 2013: 255 (2013) - 2012
- [c2]Rodolphe Lampe, Jacques Patarin, Yannick Seurin:
An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. ASIACRYPT 2012: 278-295 - [c1]Rodolphe Lampe, Jacques Patarin:
Analysis of Some Natural Variants of the PKP Algorithm. SECRYPT 2012: 209-214 - [i2]Rodolphe Lampe, Jacques Patarin:
Security of Feistel Schemes with New and Various Tools. IACR Cryptol. ePrint Arch. 2012: 131 (2012) - 2011
- [i1]Rodolphe Lampe, Jacques Patarin:
Analysis of some natural variants of the PKP Algorithm. IACR Cryptol. ePrint Arch. 2011: 686 (2011)
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 2025-01-09 12:55 CET 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:
