IEEE Transactions on Very Large Scale Integration (VLSI) Systems · 2012 · 22 citations · 21 references
ComputingComputer EngineeringComputer ScienceCryptographyField-programmable Gate ArraysHardware SecurityCryptographic ArchitectureCryptographic ImplementationCryptographic VulnerabilitiesHardware AccelerationLow-power Fpga DesignSecurity For Reconfigurable HardwareCountermeasure DesignCryptographic AccelerationCryptographic Accelerator DesignCryptographic AcceleratorsEfficient Pairing ComputationHardware Acceleration For CryptographyPhysical Security DesignSecure Pairing
This paper is devoted to the design and the physical security of a parallel dual-core flexible cryptoprocessor for computing pairings over Barreto-Naehrig (BN) curves. The proposed design is specifically optimized for field-programmable gate-array (FPGA) platforms. The design explores the in-built features of an FPGA device for achieving an efficient cryptoprocessor for computing 128-bit secure pairings. The work further pinpoints the vulnerability of those pairing computations against side-channel attacks and demonstrates experimentally that power consumptions of such devices can be used to attack these ciphers. Finally, we suggest a suitable countermeasure to overcome the respective weaknesses. The proposed secure cryptoprocessor needs 1 730 000, 1 206 000, and 821 000 cycles for the computation of Tate, ate, and optimal-ate pairings, respectively. The implementation results on a Virtex-6 FPGA device shows that it consumes 23 k Slices and computes the respective pairings in 11.93, 8.32, and 5.66 ms.
21
Cryptosystems based on pairing
M. Kasahara · Medical Entomology and Zoology · 2000 · 749 citations
The Weil Pairing, and Its Efficient Calculation
Victor S. Miller · Journal of Cryptology · 2004 · 585 citations · Full text
Nigel P. Smart, Fréderik Vercauteren · IEEE Transactions on Information Theory · 2006 · 446 citations
Fréderik Vercauteren · IEEE Transactions on Information Theory · 2010 · 332 citations · Full text