tree 02e2dac59d2928f439d5e86409d6cefc68315a46
parent d224d52aba4b73fce82f8b703d6d6f0202da4391
author Brian Smith <brian@briansmith.org> 1471487562 -1000
committer Adam Langley <agl@google.com> 1471544561 +0000

Clarify origin of optimized computation of Montgomery n0.

I found an earlier reference for an algorithm for the optimized
computation of n0 that is very similar to the one in the "Montgomery
Multiplication" paper cited in the comments. Add a reference to it.

Henry S. Warren, Jr. pointed out that his "Montgomery Multiplication"
paper is not a chapter of his book, but a supplement to the book.
Correct the reference to it.

Change-Id: Iadeb148c61ce646d1262ccba0207a31ebdad63e9
Reviewed-on: https://boringssl-review.googlesource.com/10480
Reviewed-by: Adam Langley <agl@google.com>