View Single Post
Old 2021-04-01, 19:13   #4
xilman's Avatar
May 2003
Down not across

32·52·72 Posts

Trivial question to answer.

For The Codebook challenge back in 1999 I created a RSA modulus which could have been factored much more easily than the GNFS actually used to solve the problem.

My evil sense of humour led me to produce primes which were just slightly larger than I thought that anyone would use P \pm 1 to discover.

Last fiddled with by xilman on 2021-04-01 at 19:14 Reason: Italicise
xilman is online now   Reply With Quote