SIGN IN
SIGN UP
Multi-segment
GF
(2
m
) multiplication and its application to elliptic curve cryptography
Full Text:
PDF
Buy this Article
Authors:
Dong-Ho Lee
Kyungpook National University, Daegu, South Korea
Jong-Soo Oh
Kyungpook National University, Daegu, South Korea
Published in:
· Proceeding
GLSVLSI '07
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Pages 546-551
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-605-9
doi>
10.1145/1228784.1228913
2007 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 38
· Downloads (cumulative): 382
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
arithmetic and logic units
coprocessor
data-path design
design
elliptic curve cryptography
elliptic curve scalar multiplication
finite field multiplication
fpga
security
styles
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder