ACM Home Page
Please provide us with feedback. Feedback
A GF(p) elliptic curve group operator resistant against side channel attacks
Full text PdfPdf (225 KB)
Source
Great Lakes Symposium on VLSI archive
Proceedings of the 18th ACM Great Lakes symposium on VLSI table of contents
Orlando, Florida, USA
SESSION: Session 2A: Cryptography and Architecture table of contents
Pages 53-58  
Year of Publication: 2008
ISBN:978-1-59593-999-9
Authors
Santosh Ghosh  Indian Institute of Technology Kharagpur, Kharagpur, India
Monjur Alam  Indian Institute of Technology Kharagpur, Kharagpur, India
Dipanwita RoyChowdhury  Indian Institute of Technology Kharagpur, Kharagpur, India
Indranil SenGupta  Indian Institute of Technology Kharagpur, Kharagpur, India
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 65,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1366110.1366126
What is a DOI?

ABSTRACT

This paper deals with FPGA and ASIC implementations of side-channel attack resistant elliptic curve cryptosystems defined over GF(p). The elegance of the design lies in the fact that all operations are performed in binary number system, thus reducing conversion overheads of existing architectures. In our implementation, point addition and point doubling operations are performed in affine coordinates. They are performed using same amount of computation, which provides a secure design against timing and power analysis attacks. Implementation and side-channel analysis results are compared with related existing designs.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
N. Koblitz, "Elliptic curve cryptosystems", Mathematics of Computation, Vol. 48, No. 177, pages 203--209, January 1987.
 
3
 
4
 
5
F.R. Henriquez, N.A. Saqib, A.D. Perez and C.K. Koc, "Cryptographic Algorithms on Reconfigurable Hardware", Springer, US, 2006.
 
6
S.B. Ors, L. Batina, B. Preneel and J. Vandewalle, "Hardware implementation of elliptic curve processor over GF(p)", ASAP 2003, pages 433--443.
 
7
A. Daly, W. Marnane, T. Kerins and E. Popovici, "An FPGA implementation of a GF(p) ALU for encryption processors", Microprocessors and Microsystems, Vol. 28, pages 253--260, 2004.
 
8
 
9
 
10
NIST, "Recommended elliptic curves for federal government use", July 1999.
 
11
 
12
 
13
S.B. Ors, E. Oswald and B. Preneel, "Power-Analysis Attacks on an FPGA (First Experimental Results)", CHES 2003, Cologne, Germany, LNCS 2775, pages 37--50, September 2003.
 
14
E. Ozturk, B. Sunar and E. Savas, "Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic", CHES 2004, Cambridge, MA, USA, LNCS 3156, pages 92--106, August 2004.
 
15
W. Shusua and Z. Yuefei, "A Timing and Area Tradeoff GF(p) Elliptic Curve Processor Architecture for FPGA", ICCCAS 2005, pages 1308--1312, June 2005.
 
16
L. Batina, N. Mentens, B. Preneel and I. Verbauwhede, "Balanced Point Operations for Side-channel Protection of Elliptic Curve Cryptography", IEE Proceedings on Information
 
17
Security: Special Issue on Cryptographic Algo. & Archi. for SoC, pages 57--65, 2005.
 
18
 
19

Collaborative Colleagues:
Santosh Ghosh: colleagues
Monjur Alam: colleagues
Dipanwita RoyChowdhury: colleagues
Indranil SenGupta: colleagues