由SK去算PK.pptVIP

A New Product-Sum Public Key Cryptosystem Using Message Extension Source: IEICE Transactions on Fundamentals Vol. E84-A No. 10 pp.2482-2487 Oct. 2001 Author: Kiyoko Katayanagi, Yasuyuki Murakami ,and Masao Kasahara Speaker: Lai, Yi-Peng Date: 01/07/2002 Background Diophantine Equation: C = a1x1+ a2x2+ …+ anxn Chinese Remainder Theorem Public Key Cryptosystem Secret Key : dPi, dQi, vPi, vQi, P, Q, N, w, where i=1~u gcd(dPi,dPj)=1, gcd(dQi,dQj)=1, gcd(dPi,dQi)=1 ,and dPidQi=2e+?i ,1 ?i2e Public key : a=(a1, a2, …, au), e Key Generation 由SK去算PK VPi=vPi(dP1dP2…dPu)/dPi ,gcd(dPi,vPi)=1 VQi=vQi(dQ1dQ2…dQu)/dQi ,gcd(dPi,vPi)=1 Vi= VPi mod P= VQi mod Q (with CRT) ai= wVi mod N, i= 1 ~ u Encryption and Decryption Encryption : m? m1, m2, …, mu ; mi 為 e-bits C = a1m1+ a2m2+ …+ aumu Decryption : Message Extension m: m1, m2, …, mu (e-bits); r: r1, r2, …, rh (e’-bits); (random numbers) t: t1, t2, …, tk ,where k=?(u+h)/e? m’: m1’, m2’, …, m’u+h+k Im=index(s), Ir=index(s’), It=index{u+h+1,u+h+2,…,u+h+k} Example s=(1,0,1,0,0) index(s)={1,3} s’=(0,1,0,1,1) index(s’)={2,4,5} (1) m’=m1, r1, m2, r2, r3, t1 (if e=5 and t1=20) (2) m’=m1, r1, m2, r2, r3, t1 ,t2 (if e=3 and t1=5, t2=0) Public Key and Secret Key for extended message Secret key : dPi, dQi, vPi, vQi, P, Q, N, w, where i=1~n, n=u+h+k Public key : a=(a1, a2, …, an), e, e’, It Encryption and Decryption for extended message Encryption : 1.Sender randomly generates the locator s 2.Sender generates r: r1, r2, …, rh 3.C=am’=a1m1’+a2m2’+…+anmn’ Decryption : 1.同前解出 m’: m1’, m2’, …, mn’, 2.取m’u+h+1~m’n? t 前面 u+h 個 bits 為s , 3.依此locator s找出 m Conclusion The sender can freely select the positions of the dummy messages. My View : 真正的secret values : vPi, vQi 其他的secret values : 將vPi, vQi 封存為ai所需用到的輔助值 解密時Receiver 以計算時的multiplicative inverse與CRT來算出m Decryption (step by step) Decryption (Cw-1)N = (V1m1+ V2m2+ …+ Vum