Compare commits
No commits in common. "c62223d98c934e78f96f55bbbbb21287f72474ad" and "965057128df56aa760517f8aea7e56b95ef53f63" have entirely different histories.
c62223d98c
...
965057128d
2 changed files with 2 additions and 16 deletions
|
|
@ -16,7 +16,6 @@ from public_key_cryptography import (
|
||||||
decode,
|
decode,
|
||||||
hash_and_encrypt,
|
hash_and_encrypt,
|
||||||
prime_factorization,
|
prime_factorization,
|
||||||
reverse_single_prime_RSA_cipher,
|
|
||||||
)
|
)
|
||||||
|
|
||||||
if __name__ == "__main__":
|
if __name__ == "__main__":
|
||||||
|
|
@ -43,10 +42,5 @@ if __name__ == "__main__":
|
||||||
print(private_key(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001))
|
print(private_key(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001))
|
||||||
print(decode(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001, 77578995801157823671636298847186723593814843845525223303932))
|
print(decode(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001, 77578995801157823671636298847186723593814843845525223303932))
|
||||||
print(hash_and_encrypt("crypto{Immut4ble_m3ssag1ng}"))
|
print(hash_and_encrypt("crypto{Immut4ble_m3ssag1ng}"))
|
||||||
# print(prime_factorization(510143758735509025530880200653196460532653147)) # too slow
|
print(prime_factorization(510143758735509025530880200653196460532653147))
|
||||||
print(reverse_single_prime_RSA_cipher(
|
|
||||||
161367550346730604451454756189028938964941280347662098798775466019463375610700074840105776873791605070092554650190486030367121011578171525759600774739890458414593857709994072516290998135846956596662071379067305011746842247628316996977338024343628757374524136260758515864509435302781735938531030576289086798942,
|
|
||||||
171731371218065444125482536302245915415603318380280392385291836472299752747934607246477508507827284075763910264995326010251268493630501989810855418416643352631102434317900028697993224868629935657273062472544675693365930943308086634291936846505861203914449338007760990051788980485462592823446469606824421932591,
|
|
||||||
65537
|
|
||||||
))
|
|
||||||
# fmt: on
|
# fmt: on
|
||||||
|
|
|
||||||
|
|
@ -1,5 +1,5 @@
|
||||||
from hashlib import sha256
|
from hashlib import sha256
|
||||||
from Crypto.Util.number import bytes_to_long, long_to_bytes
|
from Crypto.Util.number import bytes_to_long
|
||||||
from math import ceil, sqrt
|
from math import ceil, sqrt
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -61,11 +61,3 @@ def Fermat(N: int) -> (int, int):
|
||||||
# Challenge PK-crypto-7
|
# Challenge PK-crypto-7
|
||||||
def prime_factorization(N: int):
|
def prime_factorization(N: int):
|
||||||
return Fermat(N)
|
return Fermat(N)
|
||||||
|
|
||||||
|
|
||||||
# Challenge PK-crypto-8
|
|
||||||
def reverse_single_prime_RSA_cipher(c: int, N: int, d: int):
|
|
||||||
# On calcule la clé privée puis on applique la formule de déchiffrement
|
|
||||||
# N est premier donc phi(N) = N - 1 donc on peut facilement calculer la clé privée.
|
|
||||||
e = pow(d, -1, (N - 1))
|
|
||||||
return long_to_bytes(pow(c, e, N))
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue