2010 International Conference on Challenges in Environmental Science and Computer Engineering 2010
DOI: 10.1109/cesce.2010.257
|View full text |Cite
|
Sign up to set email alerts
|

An Improved RSA Signature Algorithm Based on Complex Numeric Operation Function

Abstract: Digital signature can be realized by using RSA algorithm.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 complex numeric operation function. This paper expounds the fundamental principles of RSA algorithm. The realization of RSA algorithm includes the generation of RSA cryptographic key and the encryption and decrypti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…where where ID AP j 2 is the ID of the AP in the current room, and Sign AP j 2 (•) is the signature algorithm [46] with it is private key.…”
Section: Position Reportmentioning
confidence: 99%
“…where where ID AP j 2 is the ID of the AP in the current room, and Sign AP j 2 (•) is the signature algorithm [46] with it is private key.…”
Section: Position Reportmentioning
confidence: 99%
“…The RSA scheme is modified in this paper. In 2010, Si et al [91] suggested an efficient RSA signature variant which is more complex in mathematical terms, and its objective is to handle it on low-end storage and devices and also improve the signature process. Conclusively, they have stated that their proposal can generate a 1024-bit RSA Key on any normal PC within 120 seconds, while encryption or decryption can be done in less than 2 seconds.…”
Section: G Digital Signaturesmentioning
confidence: 99%
“…In this work, we are mainly concerned with three variants: RSA-Small-e, RSA-Small-d, and Generalized Rebalanced-RSA.The memory needed to store both keys in Dual RSA is thus reduced since there is no need to store the same public/private exponent twice. Another variant of RSA that can be used to reduce the (key) storage requirement when two RSA systems are used is Twin RSA [22], proposed by Lenstra and deWeger.…”
Section: Rsa Security Analysismentioning
confidence: 99%