2013 13th International Conference on Control, Automation and Systems (ICCAS 2013) 2013
DOI: 10.1109/iccas.2013.6703904
|View full text |Cite
|
Sign up to set email alerts
|

Loop-based RSA key generation algorithm using string identity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…where b k is the signal intensity with a value of 1 or 0, p(•) is the binary digital pulse shape, and T is the time of one bit. The plain text x s (binary digital data) is transformed into different plain text x s10 in decimal form, and a public key set (n 10 , e 10 ) and private key set (n 10 , d 10 ) are assigned by the generation algorithm [24] of the RSA encryption key. This process is completed by considering the random prime numbers p, q and setting n 10 = pq; thereafter, φ(n) = (p − 1) × (q − 1) and a public key e 10 , which is a co-prime for φ(n), are selected such that 1 < e 10 < φ(n), and a private key d 10 is obtained from the equation e 10 d 10 = 1 mod(φ(n)) with the modulo operation in Figure 2.…”
Section: Signal Modelmentioning
confidence: 99%
“…where b k is the signal intensity with a value of 1 or 0, p(•) is the binary digital pulse shape, and T is the time of one bit. The plain text x s (binary digital data) is transformed into different plain text x s10 in decimal form, and a public key set (n 10 , e 10 ) and private key set (n 10 , d 10 ) are assigned by the generation algorithm [24] of the RSA encryption key. This process is completed by considering the random prime numbers p, q and setting n 10 = pq; thereafter, φ(n) = (p − 1) × (q − 1) and a public key e 10 , which is a co-prime for φ(n), are selected such that 1 < e 10 < φ(n), and a private key d 10 is obtained from the equation e 10 d 10 = 1 mod(φ(n)) with the modulo operation in Figure 2.…”
Section: Signal Modelmentioning
confidence: 99%
“…• Generate two large different prime numbers p and q 2) Encryption/decryption: The transmit message m t (0 = m t < n) is encrypted by the public key at the sender by applying following expression [23]- [27]:…”
Section: The Rsa Techniquementioning
confidence: 99%
“…In this secure system, the problem of keys distribution has been solved using the generation of cryptographic keys in receiver (i.e. ; at user) and sending the public key to transmitter only [22], [23], [32]- [34]. The second process in this part relates to the distribution of keys on the encrypted VLC cells.…”
Section: Secure Mimo Vlc System Descriptionmentioning
confidence: 99%
“…These are some of the proposed schemes that aim to enhance the security and efficiency of the conventional RSA. There are many other schemes like i-RSA [21], Quantum key Distribution [22], Modified RSA Cryptosystem Based on Offline Storage and Prime Number [23], Personal Information Protection Approach Based on RSA [24], etc.…”
Section: Related Workmentioning
confidence: 99%