Homomophy in Cryptography

f ( a ) = G × a f ( a ) + f ( b ) = G × a + G × b = G × ( a + b ) = f ( a + b ) f(a) = G \times a\\ f(a) + f(b) = G \times a + G \times b = G\times(a+b) = f(a+b)\\ f(a)=G×af(a)+f(b)=G×a+G×b=G×(a+b)=f(a+b)

f ( a ) = e a m o d N f ( a ) × f ( b ) = a e × b e = ( a × b ) e = f ( a × b ) f(a) = e^a mod N\\ f(a) \times f(b) = a^e \times b^e = (a\times b)^e = f(a\times b) f(a)=eamodNf(a)×f(b)=ae×be=(a×b)e=f(a×b)

你可能感兴趣的:(数字安全)