Junfeng Fan
Katholieke Universiteit Leuven
53 Papers
735 Citations
Junfeng Fan is an academic researcher from Katholieke Universiteit Leuven. The author has contributed to research in topics: Elliptic curve cryptography & Cryptography. The author has an hindex of 21, co-authored 51 publications.
Chat about Author
Papers
•Posted Content
Somewhat Practical Fully Homomorphic Encryption.
Junfeng Fan,Frederik Vercauteren +1 more
TL;DR: This paper port Brakerski’s fully homomorphic scheme based on the Learning With Errors (LWE) problem to the ring-LWE setting, and provides a detailed, but simple analysis of the various homomorphic operations, such as multiplication, relinearisation and bootstrapping.
An updated survey on secure ECC implementations: attacks, countermeasures and cost
Junfeng Fan,Ingrid Verbauwhede +1 more
TL;DR: This paper summarises known physical attacks and countermeasures on Elliptic Curve Cryptosystems and can be used as a road map for countermeasure selection in the early design stages.
FPGA implementation of pairings using residue number system and lazy reduction
Ray C. C. Cheung,Sylvain Duquesne,Junfeng Fan,Nicolas Guillermin,Ingrid Verbauwhede,Gavin Xiaoxu Yao +5 more
- 28 Sep 2011
TL;DR: In this article, the authors present two FPGA-based high speed pairing designs using the Residue Number System and lazy reduction, which is naturally suitable for parallel architectures and performs one reduction for multiple multiplications.
•Proceedings Article
Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves.
Junfeng Fan,Frederik Vercauteren,Ingrid Verbauwhede +2 more
- 01 Jan 2009
TL;DR: In this paper, the authors proposed a new method to speed up BN arithmetic by using Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number.
57
•Posted Content
Breaking ECC2K-130
Daniel V. Bailey,Lejla Batina,Daniel J. Bernstein,Peter Birkner,Joppe W. Bos,H-C Chen,Chen-Mou Cheng,van G Damme,G. De Meulenaer,LJ Dominguez Perez,Junfeng Fan,Tim Güneysu,Frank K. Gurkaynak,Tanja Lange,Nele Mentens,Ruben Niederhagen,Christof Paar,Francesco Regazzoni,Peter Schwabe,Leif Uhsadel,A Van Herrewege,Bo-Yin Yang +21 more
TL;DR: This paper describes breaking the ECC2K-130 challenge using a parallelized version of Pollard's rho method, a major computation bringing together the contributions of several clusters of conventional computers, PlayStation 3 clusters, computers with powerful graphics cards and FPGAs.