complex_stdnt

3 ms·

1. 1.▲
   by complex_stdnt 6y ago

   The intuition that the difficulty of factoring comes from the mysteries surround prime numbers is compelling, but it is also somewhat muddied by other known results. For example, a famous result [1] showed that testing whether a given numbe
2. 2.▲
   by complex_stdnt 6y ago

   So in integer factorization there are two different quantities that one might naturally want to denote by N: the number you want to factor and the number of bits required to specify that number (i.e, the input length). The convention is to
3. 3.▲
   by complex_stdnt 6y ago

   I'm a PhD student who studies stuff similar to this (I work in complexity theory), and one of my favorite "conversation starters" when I meet other researchers is whether they think integer factorization is actually a computa