共模攻击
已知n,e1,e2,c1,c2 求m
c 1 ≡ m e 1 ( m o d n ) c 2 ≡ m e 2 ( m o d n ) c_1 \equiv m^{e_1} \pmod n \newline c_2 \equiv m^{e_2} \pmod n c1≡me1(modn)c2≡me2(modn)
若
g
c
d
(
e
1
,
e
2
)
=
1
gcd(e_1,e_2) = 1
gcd(e1,e2)=1
(裴蜀定理)则必有a,b满足
a
e
1
+
b
e
2
=
1
ae_1 + be_2 = 1
ae1+be2=1
并可以通过exgcd(扩展欧几里得算法) 得到a,b.
则
m
≡
m
a
e
1
+
b
e
2
≡
(
m
e
1
)
a
(
m
e
2
)
b
≡
c
1
a
c
2
b
(
m
o
d
n
)
m \equiv m^{ae_1 + be_2} \equiv (m^{e1})^a(m^{e2})^b \equiv c_1^ac_2^b \pmod n
m≡mae1+be2≡(me1)a(me2)b≡c1ac2b(modn)