Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity
Date
2012-03-01
Author
AKLEYLEK, SEDAT
Özbudak, Ferruh
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
13
views
0
downloads
Cite This
We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography.
Subject Keywords
Theoretical Computer Science
,
Hardware and Architecture
,
Computational Theory and Mathematics
,
Software
URI
https://hdl.handle.net/11511/40398
Journal
IEEE TRANSACTIONS ON COMPUTERS
DOI
https://doi.org/10.1109/tc.2011.29
Collections
Department of Mathematics, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. AKLEYLEK and F. Özbudak, “Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity,”
IEEE TRANSACTIONS ON COMPUTERS
, vol. 61, no. 3, pp. 427–432, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40398.