RSA Signature Algorithm with High Efficiency
Wen‐Feng Qi
Abstract
Wen‐Feng Qi
Abstract
RSA is widely used in public-key cryptosystem.But running this algorithm needs lots of time and memory.This paper proposes a RSA signature algorithm to fit for the devices with low computational power.The new signature algorithm is based on the Chinese Remainder Theorem which has a relative short private key.This paper gives the cryptoanalysis of this algorithm.Results show that the algorithm can resist the lattice attack.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
RSA is widely used in public-key cryptosystem.But running this algorithm needs lots of time and memory.This paper proposes a RSA signature algorithm to fit for the devices with low computational power.The new signature algorithm is based on the Chinese Remainder Theorem which has a relative short private key.This paper gives the cryptoanalysis of this algorithm.Results show that the algorithm can resist the lattice attack.
Key concepts: Computer science, Cryptosystem, Chinese remainder theorem, Algorithm, Public-key cryptography, Signature (topology), Key (lock), Digital Signature Algorithm