Abstract
We give a review of some works on the complexity of implementation of arithmetic operations in finite fields by Boolean circuits. © 2013 Springer Science+Business Media New York.
Cite
CITATION STYLE
APA
Gashkov, S. B., & Sergeev, I. S. (2013). Complexity of computation in finite fields. Journal of Mathematical Sciences (United States), 191(5), 661–685. https://doi.org/10.1007/s10958-013-1350-5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free