Professional Documents
Culture Documents
Presentation
National Institute of Science & Technology
On DUAL RSA
Under the guidance of Mr. Purnendu Mishra
By
Roll # ECE200713453
INTRODUCTION
National Institute of Science & Technology
Dual RSA is essentially two distinct instances of RSA that share the same public and private exponents.
Goal : Reduce the storage space of 2 RSA keys. In particular, focus on the situation of using two RSA systems simultaneously, such as blind signature and authentication/secrecy.
Three Schemes Dual RSA-Small-e Dual RSA-Small-d Dual Generalized Rebalanced-RSA
Dual RSA key equations : There exists two positive integer K1 and K2 such that ed = 1 + k1( N1 ) ed = 1 + k2( N2 ) Basic Idea:
FLOW CHART
National Institute of Science & Technology Start
randomly select ne - bit x1 and (n/ 2 - ne ) - bit x2 p1 = x1 x2 + 1
no
no
yes
randomlyselectne - bit e
no
Checkgcd( x1 y2 y1 y2 , e) = 1?
yes
Is p1 prime?
yes
no
yes yes
End
OPTIONS
National Institute of Science & Technology
Output : ( e, N1, N2) ( d, p1, q1, p2, q2) e is ne-bit. d is n-bit. p1 = (x1x2 + 1) is n/2-bit. q1 = (x1y2 + 1) is n/2-bit. p2 = (y1y2 + 1) is n/2-bit.
q2 = (k1x2 + 1) is n/2-bit.
N1 = p1q1 is n-bit. N2 = p2q2 is n-bit.
Presented by:- Tapan Kumar Mahanty(200713453)
The experiment takes 1000 key pairs for each public key size.
CALCULATION
National Institute of Science & Technology
= 1 + k1(x1x2 )( y1y2 )
= 1 + y1 (x1y2)(k1x2 )
= 1 + k2(p2 1)(q2 1)
= 1 + k2( N2 )
Use the same algorithm of Dual RSA-Small-e. Change ( ne, n) to ( nd, n), and e to d. d < N0.333 are considered unsafe.
CONCLUSIONS
National Institute of Science & Technology
10
CONCLUSIONS
National Institute of Science & Technology
The memory requirement is reduced in the situations that require two instances of RSA. The computational complexity of the key generation algorithms is also increased when reducing space complexity of Dual RSA. The methods can control the bit-length of key parameters. ( such as ne, nk, nd).
11
12