Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • $\begingroup$ I agree with everything, my confusion lay in the fact that if you view matrix multiplication relative to the size of the matrix measured in bits (meaning you write $n=2^{b}$ where $b$ is the bitlength of n) you arrive per your calculation at $O(b^j2^{kb})$ operations - more costly than the DLP, which I thought weird. $\endgroup$ Commented Aug 11, 2014 at 16:32
  • $\begingroup$ @polarbear : $\:$ That's why we "view matrix multiplication relative to the size of the" $\hspace{1.2 in}$ matrices (since those are the inputs). $\;\;\;\;$ $\endgroup$ Commented Aug 11, 2014 at 19:26