Fast Generation of Cubic Irreducible Polynomials for XTR

Fast Generation of Cubic Irreducible Polynomials for XTR

Tác giả: Jae Moon Kim, Ikkwon Yie, Seung Ik Oh, Hyung Don Kim, and Jado Ryu

Nguồn trích: Progress in cryptology-INDOCRYPT 2001-LNCS 22418.7

Năm xuất bản: 1905

Số trang: 78

Tóm tắt: Abstract. XTR cryptosystem makes use of an irreducible polynomial F(c, x)=x 3 − cx 2 + c p x − 1 over a finite field IF 2 . 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]. p 

Từ khóa:

Tải về