coperlm's Blog

欧拉定理：https://oi-wiki.org/math/number-theory/fermat/ 123456789101112131415#[LitCTF 2023]Eulerfrom Crypto.Util.number import *from secret import flagm = bytes_to_long(flag)p = getPrime(512)q = getPrime(512)n = p*qc = pow(m,n-p-q+3,n)print(f'n = {n}')print(f'c = {c}')"""n = c = """ $phi = n-p-q+1$，故 $c=m^{phi+2} mod \ n$ ，由欧拉定理可得 $c^{phi}\equiv 1 \ mod n $ 则 $c\equiv m^{2} mod \ n $ 直接开根即可 1234import gmpy2from...

...