Guénaël Renault

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Aurélien Greuet

> Home > Persons > Guénaël Renault

Publications

2021
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/cosade/GreuetMR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cosade/GreuetMR21
Aurélien Greuet, Simon Montoya, Guénaël Renault:
On Using RSA/ECC Coprocessor for Ideal Lattice-Based Key Exchange. COSADE 2021: 205-227
2020
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/cans/GreuetMR20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cans/GreuetMR20
Aurélien Greuet, Simon Montoya, Guénaël Renault:
Attack on LAC Key Exchange in Misuse Situation. CANS 2020: 549-569
[i13]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/GreuetMR20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/GreuetMR20
Aurélien Greuet, Simon Montoya, Guénaël Renault:
Attack on LAC Key Exchange in Misuse Situation. IACR Cryptol. ePrint Arch. 2020: 63 (2020)
[i12]
- view
  - electronic edition @ iacr.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/iacr/GreuetMR20a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iacr/GreuetMR20a
Aurélien Greuet, Simon Montoya, Guénaël Renault:
Speeding-up Ideal Lattice-Based Key Exchange Using a RSA/ECC Coprocessor. IACR Cryptol. ePrint Arch. 2020: 1602 (2020)

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.