auth.us-east-1.amazoncognito.com
auth.us-east-2.amazoncognito.com
auth.us-west-1.amazoncognito.com
auth.us-west-2.amazoncognito.com
authgear-staging.com
authgearapps.com
author
author.aero
auto
auto.pl
autos
av.it
av.tr
avellino.it
averoy.no
averøy.no
avocat.fr
avocat.pro
avocats.bj
avoues.fr
aw
awaji.hyogo.jp
aws
awsapps.com
awsglobalaccelerator.com
ax
axa

auth.us-east-1.amazoncognito.com
auth.us-east-2.amazoncognito.com
auth.us-west-1.amazoncognito.com
auth.us-west-2.amazoncognito.com
authgear-staging.com
authgearapps.com
author
author.aero
auto
auto.pl
autos
av.it
av.tr
avellino.it
averoy.no
averøy.no
avocat.fr
avocat.pro
avocats.bj
avoues.fr
aw
awaji.hyogo.jp
aws
awsapps.com
awsglobalaccelerator.com
ax
axa

uint { // Every iteration of this loop doubles the least-significant bits of // correct inverse in y. The first three bits are already correct (1⁻¹ = 1, // 3⁻¹ = 3, 5⁻¹ = 5, and 7⁻¹ = 7 mod 8), so doubling five times is enough // for 64 bits (and wastes only one iteration for 32 bits). // // See https://crypto.stackexchange.com/a/47496. y := x for i := 0; i < 5; i++ { y = y * (2 - x*y) } return -y } // NewModulus creates a new Modulus from a slice of big-endian bytes. The // modulus must be greater...

uint { // Every iteration of this loop doubles the least-significant bits of // correct inverse in y. The first three bits are already correct (1⁻¹ = 1, // 3⁻¹ = 3, 5⁻¹ = 5, and 7⁻¹ = 7 mod 8), so doubling five times is enough // for 64 bits (and wastes only one iteration for 32 bits). // // See https://crypto.stackexchange.com/a/47496. y := x for i := 0; i < 5; i++ { y = y * (2 - x*y) } return -y } // NewModulus creates a new Modulus from a slice of big-endian bytes. The // modulus must be greater...