Publication | Closed Access
PARALLEL FPGA IMPLEMENTATION OF RSA WITH RESIDUE NUMBER SYSTEMS
17
Citations
15
References
2003
Year
Unknown Venue
EngineeringHardware AlgorithmComputer ArchitectureSide-channel AttackFormal VerificationHardware SecurityHardware Security SolutionParallel ComputingComputational Number TheoryComputer EngineeringTiming AttackComputer ScienceFault Induction AttackFpga DesignData SecurityCryptographyHardware EmulationParallel ProgrammingResidue SystemMontgomery Multiplication
In this paper, we present a new parallel architecture to avoid side-channel analyses such as: timing attack, simple/differential power analysis, fault induction attack and simple/differential electromagnetic analysis. We use a Montgomery Multiplication based on Residue Number Systems. Thanks to RNS, we develop a design able to perform an RSA signature in parallel on a set of identical and independent coprocessors. Of independent interest, we propose a new DPA countermeasure in the framework of RNS. It is only (slightly) memory consuming (1.5 KBytes). Finally, we synthesized our new architecture on FPGA and it presents promising performance results. Even if our aim is to sketch a secure architecture, the RSA signature is performed in less than 160 ms, with competitive hardware resources. To our knowledge, this is the first proposal of an architecture counteracting electromagnetic analysis apart from hardware countermeasures reducing electromagnetic radiations.
| Year | Citations | |
|---|---|---|
Page 1
Page 1