A type of public cryptosystem using polynomials and pell sequences
From MaRDI portal
Publication:5059504
Recommendations
- A public key cryptosystem using a group of permutation polynomials
- A public-key cryptosystem based on Lucas sequences
- A public key cryptosystem based on sparse polynomials
- A public-key cryptosystem utilizing cyclotomic fields
- Cryptosystems based on permutation polynomials
- A lattice based public key cryptosystem using polynomial representations
- A public key encryption scheme based on the polynomial reconstruction problem
- Public-key encryption based on Chebyshev polynomials
- scientific article; zbMATH DE number 1931026
- Coding and Cryptography
Cites work
- Fibonacci and Lucas numbers with applications. Volume I
- Generalized Fibonacci Sequences and Squared Rectangles
- Group ring based public key cryptosystems
- scientific article; zbMATH DE number 3887771 (Why is no real title available?)
- scientific article; zbMATH DE number 682387 (Why is no real title available?)
- scientific article; zbMATH DE number 1009515 (Why is no real title available?)
- scientific article; zbMATH DE number 1447249 (Why is no real title available?)
- New recurrences on Pell numbers, Pell-Lucas numbers, Jacobsthal numbers, and Jacobsthal-Lucas numbers
- On the Pell polynomials
- On the Pell, Pell-Lucas and modified Pell numbers by matrix method
This page was built for publication: A type of public cryptosystem using polynomials and pell sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059504)