You are on page 1of 12

TECHNICAL SEMINAR PRESENTATION-2011

Presentation
National Institute of Science & Technology

On DUAL RSA
Under the guidance of Mr. Purnendu Mishra
By

Tapan Kumar Mahanty

Roll # ECE200713453

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

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

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

BASIC IDEA AND KEY EQUATION


National Institute of Science & Technology

Dual RSA key equations : There exists two positive integer K1 and K2 such that ed = 1 + k1( N1 ) ed = 1 + k2( N2 ) Basic Idea:

Find three integer K1,K2,and K3 such that

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

FLOW CHART
National Institute of Science & Technology Start
randomly select ne - bit x1 and (n/ 2 - ne ) - bit x2 p1 = x1 x2 + 1
no

randomlyselectne - bit y1 q1 = y1 y2 +1 Is q1 prime?

no

yes

randomlyselectne - bit e

no

Checkgcd( x1 y2 y1 y2 , e) = 1?
yes

Is p1 prime?

yes

randomly select (n/ 2 - ne ) - bit y2 p2 = x1 y2 + 1 Is p2 prime?


no

Compute d and k 1 satisfying ed = 1 + k1 (p1 - 1)(q1 - 1) randomlyselectne - bit y1 q2 = k1 x2 +1 Is q2 prime?

no

yes yes

End

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

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)

TECHNICAL SEMINAR PRESENTATION-2011

KEY PAIRS AND KEY SIZE


National Institute of Science & Technology

The experiment takes 1000 key pairs for each public key size.

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

CALCULATION
National Institute of Science & Technology

ed = 1 + k1( N1 ) = 1 + k1(p1 1)(q1 1)

= 1 + k1(x1x2 )( y1y2 )
= 1 + y1 (x1y2)(k1x2 )

= 1 + k2(p2 1)(q2 1)
= 1 + k2( N2 )

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

DUAL RSA small D


National Institute of Science & Technology

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.

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

SAFE DUAL RSA PARAMETER


National Institute of Science & Technology

Presented by:- Tapan Kumar Mahanty(200713453)

TECHNICAL SEMINAR PRESENTATION-2011

CONCLUSIONS
National Institute of Science & Technology

Presented by:- Tapan Kumar Mahanty(200713453)

10

TECHNICAL SEMINAR PRESENTATION-2011

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).

Presented by:- Tapan Kumar Mahanty(200713453)

11

TECHNICAL SEMINAR PRESENTATION-2011

National Institute of Science & Technology

Presented by:- Tapan Kumar Mahanty(200713453)

12

You might also like