Abstract
Explicit formulae and complexities of bit-parallel GF(2n) squarers for a new class of irreducible pentanomials xn + xn?1 + xk + x + 1, where n is odd and 1 < k
Cite
CITATION STYLE
APA
Xiong, X., & Fan, H. (2014). GF(2n) bit-parallel squarer using generalized polynomial basis for new class of irreducible pentanomials. Electronics Letters, 50(9), 655–657. https://doi.org/10.1049/el.2014.0006
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