public_key_cryptography course - challenge 7 - prime factorization - result retrieved from factordb because a Fermat implementation in python is too slow to run it on my machine
This commit is contained in:
parent
ca77b76e7e
commit
965057128d
2 changed files with 28 additions and 0 deletions
|
|
@ -15,6 +15,7 @@ from public_key_cryptography import (
|
|||
private_key,
|
||||
decode,
|
||||
hash_and_encrypt,
|
||||
prime_factorization,
|
||||
)
|
||||
|
||||
if __name__ == "__main__":
|
||||
|
|
@ -41,4 +42,5 @@ if __name__ == "__main__":
|
|||
print(private_key(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001))
|
||||
print(decode(857504083339712752489993810777, 1029224947942998075080348647219, 0x10001, 77578995801157823671636298847186723593814843845525223303932))
|
||||
print(hash_and_encrypt("crypto{Immut4ble_m3ssag1ng}"))
|
||||
print(prime_factorization(510143758735509025530880200653196460532653147))
|
||||
# fmt: on
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue