2006 · 37 citations · 7 references
Cryptographic PrimitiveEngineeringComputer ArchitectureParallel ImplementationHardware SystemsParallel AlgorithmsPublic Key AlgorithmComputing SystemsParallel Processing Crypto-processorParallel ComputingElliptic Curve CryptographyInstruction-level ParallelismComputer EngineeringElliptic Curve CryptosystemsComputer ScienceCryptosystemEc Point MultiplicationCryptographyCo-processorsParallel ProcessingParallel Programming
We propose a parallel processing crypto-processor for elliptic curve cryptography (ECC) to speed up EC point multiplication. The processor consists of a controller that dynamically checks instruction-level parallelism (ILP) and multiple sets of modular arithmetic logic units accelerating modular operations. A case study of HW design with the proposed architecture shows that EC point multiplication over GF(p) and GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> ) can be improved by a factor of 1.6 compared to the case of using single processing element
7
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.3K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text