|
Pinoy who discovered new faster way of decoding RSA encryption explains claim |
|
|
|
Source: MB - Posted by Dave Wreski
|
Mathematics enthusiast Leo de Velez who claims to have discovered a faster way of decoding RSA encryption believes that his findings are solid since nobody is still using his formula of 2^X = 1 mod N where N is given as . . .
Mathematics enthusiast Leo de Velez who claims to have discovered a faster way of decoding RSA encryption believes that his findings are solid since nobody is still using his formula of 2^X = 1 mod N where N is given as the public key, find X. Rivest noted that any technique that can find a multiplicative inverse of e modulo lambda(n) can be used to factor n. "So if your approach finds such exponents somehow, then you also have a factoring algorithm, not just an algorithm to break RSA," Rivest said.
Read this full article at MB
Only registered users can write comments.
Please login or register. Powered by AkoComment! |
