Cryptological Applications of Permutation Polynomials

DOI10.1016/S1571-0653(04)00541-4MaRDI QIDQ3439042zbMATH OpenOpenAlexFDO

Authors Indivar Gupta, Laxmi Narain, C. E. Veni Madhavan

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00541-4

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• scientific article; zbMATH DE number 426128
• Tests for Permutation Polynomials
• Cryptosystems based on permutation polynomials
• Permutation polynomials of \(\mathbb F_{p^m}\)
• Permutation polynomials and a new public-key encryption

Cited in

(8)

• scientific article; zbMATH DE number 5252113 (Why is no real title available?)
• Permutation polynomials and a new public-key encryption
• scientific article; zbMATH DE number 426128 (Why is no real title available?)
• The action of a few random permutations on r-tuples and an application to cryptography
• On the detection of permutation polynomials
• Permutation polynomials over finite rings
• A public key cryptosystem using a group of permutation polynomials
• Cryptosystems based on permutation polynomials

This page was built for publication: Cryptological Applications of Permutation Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439042)