Powered by the CrypTool project

© 2009-2024 MysteryTwister

Contact | Legal Notice | Privacy

We redesigned MysteryTwister, enjoy! Feedback
 Explore Challenges

Unusual encryption using a diophantine equation Level 2

by Viktor Veselovsky, published on 2011-09-02

In order to calculate the private keys of the RSA algorithm, it is necessary to factorize large numbers. How difficult is it if we replace x*y by some diophantine equation?