Frederik Vercauteren

IACR Cryptol. ePrint Arch., 2017

Homomorphic SIM2D Operations: Single Instruction Much More Data.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Privacy-Preserving Genome-Wide Association Study is Practical.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Faster Homomorphic Function Evaluation using Non-Integral Base Encoding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

On error distributions in ring-based LWE.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2016

Masking ring-LWE.

[BibT_eX]

[DOI]

J. Cryptogr. Eng., 2016

Efficient Finite field multiplication for isogeny based post quantum cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On the tightness of the error bound in Ring-LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Provably Weak Instances of Ring-LWE Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Privacy-friendly Forecasting for the Smart Grid using Homomorphic Encryption and the Group Method of Data Handling.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Additively Homomorphic Ring-LWE Masking.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

2015

Modular Hardware Architecture for Somewhat Homomorphic Function Evaluation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

A masked ring-LWE implementation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Compact and Side Channel Secure Discrete Gaussian Sampling.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Efficient Software Implementation of Ring-LWE Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

High-speed Polynomial Multiplication Architecture for Ring-LWE and SHE Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Fully homomorphic SIMD operations.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Compact Ring-LWE Cryptoprocessor.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

2013

Compact Hardware Implementation of Ring-LWE Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

High Precision Discrete Gaussian Sampling on FPGAs.

[BibT_eX]

[DOI]

Sujoy Sinha Roy

Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

2012

Fault Attacks on Pairing-Based Cryptography.

[BibT_eX]

[DOI]

Nadia El Mrabet

Proceedings of the Fault Analysis in Cryptography, 2012

Efficient Hardware Implementation of Fp-Arithmetic for Pairing-Friendly Curves.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

Somewhat Practical Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A cross-protocol attack on the TLS protocol.

[BibT_eX]

[DOI]

Nikos Mavrogiannopoulos

Vesselin Velichkov

Bart Preneel

Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011

Toric forms of elliptic curves and their arithmetic.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Practical realisation and elimination of an ECC-related software bug attack.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

On CCA-Secure Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - 18th International Workshop, 2011

A New RFID Privacy Model.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2011, 2011

To Infinity and Beyond: Combined Attack on ECC Using Points of Low Order.

[BibT_eX]

[DOI]

Benedikt Gierlichs

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28, 2011

2010

Optimal pairings.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods.

[BibT_eX]

[DOI]

Miroslav Knezevic

IEEE Trans. Computers, 2010

On CCA-Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

On the claimed privacy of EC-RAC III.

[BibT_eX]

[DOI]

Jens Hermans

IACR Cryptol. ePrint Arch., 2010

Speeding Up Bipartite Modular Multiplication.

[BibT_eX]

[DOI]

Miroslav Knezevic

Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Speed Records for NTRU.

[BibT_eX]

[DOI]

Jens Hermans

Bart Preneel

Proceedings of the Topics in Cryptology, 2010

2009

Implementation Attacks & Countermeasures.

[BibT_eX]

[DOI]

Proceedings of the Identity-Based Cryptography, 2009

Pairings on Elliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Identity-Based Cryptography, 2009

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Parallel Shortest Lattice Vector Enumeration on Graphics Cards.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers.

[BibT_eX]

[DOI]

Computing, 2009

Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems, 2009

2008

Aspects of Pairing Inversion.

[BibT_eX]

[DOI]

Steven D. Galbraith

Florian Hess

IEEE Trans. Inf. Theory, 2008

The Hidden Root Problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Computing Zeta Functions in Families of Ca, b.

[BibT_eX]

[DOI]

Hendrik Hubrechts

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007

On computable isomorphisms in efficient asymmetric pairing-based systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Hyperelliptic Pairings.

[BibT_eX]

[DOI]

Steven D. Galbraith

Florian Hess

Proceedings of the Pairing-Based Cryptography, 2007

Ate Pairing on Hyperelliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

The Eta Pairing Revisited.

[BibT_eX]

[DOI]

Florian Hess

IEEE Trans. Inf. Theory, 2006

A Fault Attack on Pairing-Based Cryptography.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2.

[BibT_eX]

[DOI]

J. Cryptol., 2006

Computing Zeta Functions of Nondegenerate Curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Counting points on Cab curves using Monsky-Washnitzer cohomology.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2006

The Number Field Sieve in the Medium Prime Case.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

Arithmetic of p-adic Numbers.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Cohomological Background on Point Counting.

[BibT_eX]

[DOI]

David Lubicz

Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

Point Counting on Elliptic and Hyperelliptic Curves.

[BibT_eX]

[DOI]

Reynald Lercier

David Lubicz

Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

On the Discrete Logarithm Problem on Algebraic Tori.

[BibT_eX]

[DOI]

Robert Granger

Proceedings of the Advances in Cryptology, 2005

2004

The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications.

[BibT_eX]

[DOI]

A. Muzereau

LMS J. Comput. Math., 2004

Fault and Side-Channel Attacks on Pairing Based Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

A comparison of MNT curves and supersingular curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations.

[BibT_eX]

[DOI]

Joseph H. Silverman

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Function Field Sieve in Characteristic Three.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2002

Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2002

An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001

A Memory Efficient Version of Satoh's Algorithm.

[BibT_eX]

[DOI]