Using the greatest common divisor (GCD) to factorize the public modulo into the secret primes, so we can forge a RSA signature.
Source for the rhme2 challenges: https://github.com/Riscure/Rhme-2016
=[ 🔴 Stuff I use ]=
→ Microphone:* https://geni.us/ntg3b
→ Graphics tablet:* https://geni.us/wacom-intuos
→ Camera#1 for streaming:* https://geni.us/sony-camera
→ Lens for streaming:* https://geni.us/sony-lense
→ Connect Camera#1 to PC:* https://geni.us/cam-link
→ Keyboard:* https://geni.us/mech-keyboard
→ Old Microphone:* https://geni.us/mic-at2020usb
US Store Front:* https://www.amazon.com/shop/liveoverflow
=[ ❤️ Support ]=
→ per Video: / liveoverflow
→ per Month: / @liveoverflow
=[ 🐕 Social ]=
→ Twitter: / liveoverflow
→ Website: https://liveoverflow.com/
→ Subreddit: / liveoverflow
→ Facebook: / liveoverflow
=[ 📄 P.S. ]=
All links with "*" are affiliate links.
LiveOverflow / Security Flag GmbH is part of the Amazon Affiliate Partner Programm.
#CTF #Cryptography
Watch video Recover RSA private key from public keys - rhme2 Key Server (crypto 200) online without registration, duration hours minute second in high quality. This video was added by user LiveOverflow 21 April 2017, don't forget to share it with your friends and acquaintances, it has been viewed on our site 115,383 once and liked it 2.9 thousand people.