A fast and secure RSA public key cryptosystem
From MaRDI portal
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- An algebraic framework for Diffie-Hellman assumptions
- Breaking RSA may be as difficult as factoring
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Cryptography. Theory and practice
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Introduction to algorithms.
- Short signatures from Diffie-Hellman: realizing almost compact public key
Cited in
(18)- An RSA based public-key cryptosystem for secure communication
- Batch RSA
- A systolic, high speed architecture for an RSA cryptosystem
- RSA cryptosystem with fuzzy set theory for encryption and decryption
- New authentication encryption scheme based on AES and Three-Prime RPrime RSA
- scientific article; zbMATH DE number 65248 (Why is no real title available?)
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1304287 (Why is no real title available?)
- scientific article; zbMATH DE number 503247 (Why is no real title available?)
- scientific article; zbMATH DE number 503341 (Why is no real title available?)
- scientific article; zbMATH DE number 1088247 (Why is no real title available?)
- Applying evolutionary algorithm to public key cryptosystems
- scientific article; zbMATH DE number 1504800 (Why is no real title available?)
- A new method for generating keys in the RSA cryptosystem
- Fast parallel exponentiation algorithm for RSA public-key cryptosystem
- Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic
- On the use of RSA as a secret key cryptosystem
- Implications of the arithmetic ratio of prime numbers for RSA security
This page was built for publication: A fast and secure RSA public key cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5163746)
