| 2008 |
|---|
| 8 | EE | Olivier Billet,
Matthew J. B. Robshaw,
Yannick Seurin,
Yiqun Lisa Yin:
Looking Back at a New Hash Function.
ACISP 2008: 239-253 |
| 7 | EE | Andrey Bogdanov,
Gregor Leander,
Christof Paar,
Axel Poschmann,
Matthew J. B. Robshaw,
Yannick Seurin:
Hash Functions and RFID Tags: Mind the Gap.
CHES 2008: 283-299 |
| 6 | EE | Jean-Sébastien Coron,
Jacques Patarin,
Yannick Seurin:
The Random Oracle Model and the Ideal Cipher Model Are Equivalent.
CRYPTO 2008: 1-20 |
| 5 | EE | Henri Gilbert,
Matthew J. B. Robshaw,
Yannick Seurin:
HB#: Increasing the Security and Efficiency of HB+.
EUROCRYPT 2008: 361-378 |
| 4 | EE | Henri Gilbert,
Matthew J. B. Robshaw,
Yannick Seurin:
Good Variants of HB+ Are Hard to Find.
Financial Cryptography 2008: 156-170 |
| 3 | EE | Henri Gilbert,
Matthew J. B. Robshaw,
Yannick Seurin:
How to Encrypt with the LPN Problem.
ICALP (2) 2008: 679-690 |
| 2007 |
|---|
| 2 | EE | Andrey Bogdanov,
Lars R. Knudsen,
Gregor Leander,
Christof Paar,
Axel Poschmann,
Matthew J. B. Robshaw,
Yannick Seurin,
C. Vikkelsoe:
PRESENT: An Ultra-Lightweight Block Cipher.
CHES 2007: 450-466 |
| 1 | EE | Yannick Seurin,
Thomas Peyrin:
Security Analysis of Constructions Combining FIL Random Oracles.
FSE 2007: 119-136 |
