A Novel Architecture for Fast RSA Key Generation Based on RNS

Hu, Jingwei; Guo, Wei; Jiang, Wei; Chang, Yisong; Sun, Da‐Zhi

doi:10.1109/paap.2011.75

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They apply the algorithms of the digital signature constructed on RSA [1], Diffie-Hellman [2] cryptosystems to ensuring integrity of information transferred by a communication channel. The effective realization of cryptosystems with public key on the base of Residue Number System is proposed in papers [3][4][5][6][7][8][9][10][11][12][13]: on points of an elliptic curve [3][4][5][6][7][8], RSA cryptosystem [9][10][11][12][13]. The application of Residue Number System for constructing information security systems in cloud technologies is being researched in papers [14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

Realization problems of cryptographic transformations by transfer of modular data in security systems

Chervyakov

Григорьевич

Nazarov

et al. 2015

2015 International Siberian Conference on Control and Communications (SIBCON)

View full text Add to dashboard Cite

This paper shows the results of the research aimed to find most efficient method of computation residue of dividing multi digit numbers by numbers of standard digit capacity. It is shown that application of the distributed arithmetic allows processing multi digit numbers (more than 64-bit long) of any length by using only hardware resources of field-programmable gate array. It appears that there is a relation between value of partition parameter B and time for finding residue of division.Keywords -multi digit numbers; the residue number system; field-programmable gate array.

show abstract

Section: Introductionmentioning

confidence: 99%

Realization problems of cryptographic transformations by transfer of modular data in security systems

Chervyakov

Григорьевич

Nazarov

et al. 2015

2015 International Siberian Conference on Control and Communications (SIBCON)

View full text Add to dashboard Cite

show abstract

“…To generate secure RSA keys, the two prime numbers p and q should be very large and have at least 512 digits, and they should have approximately the same bit length. Finding two large random prime numbers p and q determines the approximate total key generation time; an efficient algorithm for generating such large prime numbers is given in detail in Chapter 4 [16].…”

Section: Algorithm 1: Key Generationmentioning

confidence: 99%