Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks

@article{Ghosh2009ParallelCF,
  title={Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks},
  author={Santosh Ghosh and Monjur Alam and Dipanwita Roy Chowdhury and Indranil Sengupta},
  journal={Computers & Electrical Engineering},
  year={2009},
  volume={35},
  pages={329-338}
}
All elliptic curve cryptographic schemes are based on scalar multiplication of points, and hence its faster computation signifies faster operation. This paper proposes two different parallelization techniques to speedup the GF(p) elliptic curve multiplication in affine coordinates and the corresponding architectures. The proposed implementations are capable of resisting different side channel attacks based on time and power analysis. The 160, 192, 224 and 256 bits implementations of both the… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

Comparative analysis of flexible cryptographic implementations

2016 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) • 2016
View 5 Excerpts
Highly Influenced

A Generic Approach to the Development of Coprocessors for Elliptic Curve Cryptosystems

2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) • 2017
View 1 Excerpt

A scalable ECC processor implementation for high-speed and lightweight with side-channel countermeasures

2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig) • 2017
View 1 Excerpt

Area-optimized montgomery multiplication on IGLOO 2 FPGAs

2017 27th International Conference on Field Programmable Logic and Applications (FPL) • 2017
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Similar Papers

Loading similar papers…