Cryptanalysis of the Dickson-Scheme
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4081459
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Cryptanalysis of public-key distribution systems based on Dickson polynomials
- scientific article; zbMATH DE number 3972789
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
Cited in
(21)- Generalizations of the Fibonacci pseudoprimes test
- More classes of permutation trinomials with Niho exponents
- Algebraic generalization of Diffie-Hellman key exchange
- Cryptanalysis of ISO/IEC 9796-1
- Polynomial representations of the Lucas logarithm
- An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Cryptanalysis of public-key distribution systems based on Dickson polynomials
- scientific article; zbMATH DE number 3972789 (Why is no real title available?)
- scientific article; zbMATH DE number 4081459 (Why is no real title available?)
- New permutation trinomials constructed from fractional polynomials
- scientific article; zbMATH DE number 1839603 (Why is no real title available?)
- Dictionary based codes involving power product expansions
- Cryptanalysis of an Extension of the Hill Cipher
- Fast Software Encryption
- Cryptanalysis of the Chor-Rivest cryptosystem
- SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k
- Two new classes of (almost) perfect c-nonlinear permutations
- On the security of the Lucas function
- Some permutation pentanomials over finite fields of even characteristic
- A construction of permutation polynomials using Rédei function in even characteristic
This page was built for publication: Cryptanalysis of the Dickson-Scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720458)
