Abstract
XTR cryptosystem makes use of an irreducible polynomial F(c, x) = x3 - cx2 + cpx - 1 over a finite field IFp2. In this paper, we develop a new method to generate such an irreducible polynomial. Our method requires only computations of Jacobi symbols and thus improves those given [1], [2] and [3].
Cite
CITATION STYLE
APA
Kim, J. M., Yie, I., Oh, S. I., Kim, H. D., & Ryu, J. (2001). Fast generation of cubic irreducible polynomials for XTR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 73–78). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_7
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