Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2118995
- A new fast modular arithmetic method in public key cryptography
- scientific article; zbMATH DE number 3954815
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Security analysis of fast public key cryptosystem on a matrix ring
- Fast RSA-type cryptosystem modulo p^k q
- Efficient hardware implementation of modular multiplication and exponentiation for public-key cryptography
- The cryptanalysis of a new public-key cryptosystem based on modular knapsacks
- Multi-precision squaring for public-key cryptography on embedded microprocessors
- An implementation for a fast public-key cryptosystem
This page was built for publication: Design and analysis of fast provably secure public-key cryptosystems based on a modular squaring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536642)