public_key_cryptography course - challenges 4 - private key computation

This commit is contained in:
boyreau 2026-11-05 12:12:37 +01:00
commit ac83990bc9
2 changed files with 7 additions and 0 deletions

View file

@ -12,6 +12,7 @@ from public_key_cryptography import (
modular_exponentiation, modular_exponentiation,
basic_encryption, basic_encryption,
Euler_totient, Euler_totient,
private_key,
) )
if __name__ == "__main__": if __name__ == "__main__":
@ -35,4 +36,5 @@ if __name__ == "__main__":
print(modular_exponentiation()) print(modular_exponentiation())
print(basic_encryption(12, 17, 23)) print(basic_encryption(12, 17, 23))
print(Euler_totient(857504083339712752489993810777, 1029224947942998075080348647219)) print(Euler_totient(857504083339712752489993810777, 1029224947942998075080348647219))
print(private_key(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001))
# fmt: on # fmt: on

View file

@ -11,3 +11,8 @@ def basic_encryption(message: int, p: int, q: int) -> int:
# Challenge PK-crypto-3 # Challenge PK-crypto-3
def Euler_totient(p: int, q: int) -> int: def Euler_totient(p: int, q: int) -> int:
return (p - 1) * (q - 1) return (p - 1) * (q - 1)
# Challenge PK-crypto-4
def private_key(p: int, q: int, exp: int) -> int:
return pow(exp, -1, (p - 1) * (q - 1))