Permutation Polynomials and Their Applications to Cryptography

スポンサーリンク

概要

• 論文の詳細を見る

• Polynomials are called permutation polynomials if they induce bijective functions. A permutation based on a polynomial of low degree over a finite field has a simple structure but good randomness properties suitable for applications[3].The metric properties and algebraic properties have been presendted by [4].This paper introduces algebraic geometry to characterize permutation polynomials of low degree over a finite field of characteristic 2.

• 一般社団法人電子情報通信学会の論文
• 1995-03-27

著者

• Aitken W.

  Dept Of Mathematics California State University

• Okamoto E.

  School of Information Science, JAIST

• Blakley G.R.

  Dept of Mathematics, Texas A&M University

• Blakley G.r.

  Dept Of Mathematics Texas A&m University

関連論文

• Permutation Polynomials and Their Applications to Cryptography

スポンサーリンク