Sarà possibile seguire l'evento anche in diretta streaming al seguente Link identifier #identifier__35819-1link.
Abstract
We present a new method to inject backdoors in RSA and other cryptographic primitives based on the Integer Factorization problem for balanced semi-primes. The method relies on mathematical congruences among the factors of the semi-primes modulo a large prime number, which acts as a "designer key" or "escrow key". In particular, two different backdoors are proposed, one targeting a single semi-prime and the other one a pair of vulnerable semi-primes.
This post is also available in:
Link identifier #identifier__44156-5
Eng