Cryptosystems based on permutation polynomials
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- A public key cryptosystem using a group of permutation polynomials
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- Some permutation polynomials over finite fields and a security key exchange protocol
- Cryptological Applications of Permutation Polynomials
- On Cryptosystems Based on Polynomials and Finite Fields
- scientific article; zbMATH DE number 733882 (Why is no real title available?)
- scientific article; zbMATH DE number 1024040 (Why is no real title available?)
- scientific article; zbMATH DE number 1952885 (Why is no real title available?)
- scientific article; zbMATH DE number 2031132 (Why is no real title available?)
- Public key cryptosystems based on boolean permutations and their applications
- Permutation polynomials in RSA-cryptosystems
- Dictionary coding via perfect polynomials
- A type of public cryptosystem using polynomials and pell sequences
- scientific article; zbMATH DE number 7310223 (Why is no real title available?)
- Permutation polynomials and a new public-key encryption
- On the detection of permutation polynomials
- scientific article; zbMATH DE number 5252113 (Why is no real title available?)
- SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k
This page was built for publication: Cryptosystems based on permutation polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733825)