IACR Cryptology ePrint Archive · 2011 · 15 citations · 22 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureParallel ComputingSystem-on-chip DesignHardware AccelerationParallel ArchitecturesReconfigurable AcceleratorsTiming AnalysisArithmetic Logic Unit ArchitectureEfficient Pairing ComputationFast Arithmetic CircuitsParallel Computing ArchitecturesParallel Processing ArchitecturesResidue Number System AlgorithmsResidue Number Systems
In this paper, we present a high speed pairing coprocessor using Residue Number System (RNS) and lazy reduction. We show that combining RNS, which are naturally suitable for parallel architectures, and lazy reduction, which performs one reduction for more than one multiplication, the computational complexity of pairings can be largely reduced. The design is prototyped on a Xilinx Virtex-6 FPGA, which utilizes 7023 slices and 32 DSPs, and finishes one 254-bit optimal ate pairing computation in 0.664 ms.
22
Identity-Based Encryption from the Weil Pairing
Dan Boneh, Matthew Franklin · SIAM Journal on Computing · 2003 · 3.6K citations
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Multiplication of Multidigit Numbers on Automata
Anatolij A. Karatsuba, Yu. Ofman · Soviet physics. Doklady · 1963 · 794 citations
The Weil Pairing, and Its Efficient Calculation
Victor S. Miller · Journal of Cryptology · 2004 · 585 citations · Full text