Chargement de la vue.
Matthieu Lequesne – Recovering short secret keys of RLCE in polynomial time
The security of most modern public key encryption algorithms (such as RSA) relies on arithmetic problems. Today, the hardness of these problems is threatened by the potential emergence of large … Continue reading Matthieu Lequesne – Recovering short secret keys of RLCE in polynomial time