SIGN IN
SIGN UP
Towards fault-tolerant cryptographic computations over finite fields
Full Text:
Pdf
Buy this Article
Authors:
Arash Reyhani-Masoleh
University of Waterloo, Waterloo, Ontario, Canada
M. Anwar Hasan
University of Waterloo, Waterloo, Ontario, Canada
Published in:
· Journal
ACM Transactions on Embedded Computing Systems (TECS)
TECS Homepage
archive
Volume 3 Issue 3, August 2004
Pages 593 - 613
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1015047.1015054
2004 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 15
· Downloads (cumulative): 491
· Citation Count: 6
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
error correction
fault-tolerant computing
finite fields
high-speed arithmetic
polynomial basis multiplier
reliability, testing, and fault-tolerance
security
security
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