Permutation polynomials and a new public-key encryption
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- Linear Recurring Sequences
- New directions in cryptography
- Permutation polynomials and applications to coding theory
Cited in
(13)- Cryptological Applications of Permutation Polynomials
- Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
- scientific article; zbMATH DE number 5252113 (Why is no real title available?)
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- A simple variant of the Merkle-Damgård scheme with a permutation
- Quadratic time algorithm for inversion of binary permutation polynomials
- A public key cryptosystem using a group of permutation polynomials
- On some properties of graph based public keys
- A method for generating permutation polynomials modulo \(p^n\)
- Cryptosystems based on permutation polynomials
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
- Permutation After RC4 Key Scheduling Reveals the Secret Key
- Permutation polynomials in RSA-cryptosystems
This page was built for publication: Permutation polynomials and a new public-key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516791)