2008 |
16 | EE | Wouter Castryck,
Hendrik Hubrechts,
Frederik Vercauteren:
Computing Zeta Functions in Families of Ca, b.
ANTS 2008: 296-311 |
15 | EE | Frederik Vercauteren:
The Hidden Root Problem.
Pairing 2008: 89-99 |
14 | EE | Steven D. Galbraith,
Florian Hess,
Frederik Vercauteren:
Aspects of Pairing Inversion.
IEEE Transactions on Information Theory 54(12): 5719-5728 (2008) |
2007 |
13 | EE | Robert Granger,
Florian Hess,
Roger Oyono,
Nicolas Thériault,
Frederik Vercauteren:
Ate Pairing on Hyperelliptic Curves.
EUROCRYPT 2007: 430-447 |
12 | EE | Steven D. Galbraith,
Florian Hess,
Frederik Vercauteren:
Hyperelliptic Pairings.
Pairing 2007: 108-131 |
11 | EE | Nigel P. Smart,
Frederik Vercauteren:
On computable isomorphisms in efficient asymmetric pairing-based systems.
Discrete Applied Mathematics 155(4): 538-547 (2007) |
2006 |
10 | EE | Antoine Joux,
Reynald Lercier,
Nigel P. Smart,
Frederik Vercauteren:
The Number Field Sieve in the Medium Prime Case.
CRYPTO 2006: 326-344 |
9 | EE | Dan Page,
Frederik Vercauteren:
A Fault Attack on Pairing-Based Cryptography.
IEEE Trans. Computers 55(9): 1075-1080 (2006) |
8 | EE | Florian Hess,
Nigel P. Smart,
Frederik Vercauteren:
The Eta Pairing Revisited.
IEEE Transactions on Information Theory 52(10): 4595-4602 (2006) |
7 | EE | Jan Denef,
Frederik Vercauteren:
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2.
J. Cryptology 19(1): 1-25 (2006) |
2005 |
6 | EE | Robert Granger,
Frederik Vercauteren:
On the Discrete Logarithm Problem on Algebraic Tori.
CRYPTO 2005: 66-85 |
2004 |
5 | EE | Robert Granger,
Andrew J. Holt,
Dan Page,
Nigel P. Smart,
Frederik Vercauteren:
Function Field Sieve in Characteristic Three.
ANTS 2004: 223-234 |
4 | EE | Joseph H. Silverman,
Nigel P. Smart,
Frederik Vercauteren:
An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations.
SCN 2004: 278-293 |
2002 |
3 | EE | Jan Denef,
Frederik Vercauteren:
An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2.
ANTS 2002: 308-323 |
2 | EE | Frederik Vercauteren:
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2.
CRYPTO 2002: 369-384 |
2001 |
1 | EE | Frederik Vercauteren,
Bart Preneel,
Joos Vandewalle:
A Memory Efficient Version of Satoh's Algorithm.
EUROCRYPT 2001: 1-13 |