-
CryptoHack - Public Exponent | Crypto
Salty Smallest exponent should be fastest, right? Solution This felt like a review questions since I was able to get the flag without making new changes. n, c, e were given where n is not known to have prime factors. \\Python from Crypto.Util.number import long_to_bytes #p = #prime number 1...
-
CryptoHack - Primes Part 1 | Crypto
Factoring Factorise the 150-bit number 510143758735509025530880200653196460532653147 into its two constituent primes. Give the smaller one as your answer. Solution http://factordb.com/index.php?query=510143758735509025530880200653196460532653147+ Inferius Prime Here is my super-strong RSA implementation, because it’s 1600 bits strong it should be unbreakable… at least I think so! Solution Opening the output.txt file will give us...
-
CryptoHack - RSA Starter | Crypto
RSA Starter 1 Find the solution to 10117 mod 22663 Solution \\Python answer = pow(101, 17, 22663) RSA Starter 2 “Encrypt” the number 12 using the exponent e = 65537 and the primes p = 17 and q = 23. What number do you get as the ciphertext? Solution \\Python...