• DocumentCode
    2171491
  • Title

    Orthomorphic Permutation Polynomials of Degree 2d+1 over Finite Field F2n

  • Author

    Guo, Jiangjiang ; Zheng, Haoran

  • Author_Institution
    Inf. Sci. & Technol. Inst., Zhengzhou, China
  • fYear
    2009
  • fDate
    17-19 Oct. 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Orthomorphic permutations have important application in the design of cryptosystems. Based on the one-to-one corresponding relationship between orthomorphic permutations and orthomorphic permutation polynomials, this paper studies orthomorphic permutation polynomials of degree 2d+1 over finite field F2n. By the congruence theory and the distributive law of degrees for multiplying polynomials, the necessary condition that the polynomials of degree 2d+1 are orthomorphism is obtained exactly. Meanwhile, this paper proves that there does not exist orthomorphic permutation polynomials of degree 5 over finite field F2n. The above results not only provide a method to judge orthomorphic permutation polynomials, but also make a contribution to the enumeration of the kind of polynomials.
  • Keywords
    cryptography; polynomials; congruence theory; cryptosystem; distributive degrees law; finite field; orthomorphic permutation polynomial; Cryptography; Galois fields; Information science; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Biomedical Engineering and Informatics, 2009. BMEI '09. 2nd International Conference on
  • Conference_Location
    Tianjin
  • Print_ISBN
    978-1-4244-4132-7
  • Electronic_ISBN
    978-1-4244-4134-1
  • Type

    conf

  • DOI
    10.1109/BMEI.2009.5304689
  • Filename
    5304689