Add a seperate invsqrt function.

This code isn't constant-time, but maybe should be.  However that would
prevent a bunch of nice things (e.g., Option types).  Probably good to
think about this.
This commit is contained in:
Henry de Valence 2017-02-19 20:00:19 -05:00
parent ee5958c407
commit a415caa9fb
2 changed files with 57 additions and 0 deletions

View file

@ -1621,6 +1621,19 @@ mod test {
assert_eq!(minus_one, msqrt_m1_sq); assert_eq!(minus_one, msqrt_m1_sq);
} }
#[test]
fn test_sqrt_constants_sign() {
let one = FieldElement([ 1,0,0,0,0,0,0,0,0,0]);
let minus_one = FieldElement([-1,0,0,0,0,0,0,0,0,0]);
let invsqrt_m1 = minus_one.invsqrt().unwrap();
let sign_test_sqrt = &invsqrt_m1 * &constants::SQRT_M1;
let sign_test_msqrt = &invsqrt_m1 * &constants::MSQRT_M1;
// XXX it seems we have flipped the sign relative to
// the invsqrt function?
assert_eq!(sign_test_sqrt, minus_one);
assert_eq!(sign_test_msqrt, one);
}
#[test] #[test]
/// Test that d = -121665/121666 /// Test that d = -121665/121666
fn test_d_vs_ratio() { fn test_d_vs_ratio() {

View file

@ -31,6 +31,8 @@ use subtle::CTEq;
use utils::{load3, load4}; use utils::{load3, load4};
use constants;
/// FieldElements are represented as an array of ten "Limbs", which are radix /// FieldElements are represented as an array of ten "Limbs", which are radix
/// 25.5, that is, each Limb of a FieldElement alternates between being /// 25.5, that is, each Limb of a FieldElement alternates between being
/// represented as a factor of 2^25 or 2^26 more than the last corresponding /// represented as a factor of 2^25 or 2^26 more than the last corresponding
@ -815,6 +817,48 @@ impl FieldElement {
t21 t21
} }
/// Try to compute 1/sqrt(self).
///
/// # Return
///
/// * If `self` is zero, returns zero.
/// * If `self` is square, returns 1/sqrt(self).
/// * If `self` is nonsquare, returns `None`.
pub fn invsqrt(&self) -> Option<FieldElement> {
// We are to compute v as:
// / 1/sqrt(self) if self is square, nonzero;
// v = | 0 if self is zero;
// \ [reject] if self is nonsquare.
//
// Using the same trick as in ed25519 decoding, we merge the
// inversion, the square root, and the square test as follows.
//
// To compute sqrt(α), we can compute β = α^((p+3)/8).
// Then β^2 = ±α, so multiplying β by sqrt(-1) if necessary
// gives sqrt(α).
//
// To compute 1/sqrt(α), we observe that
// 1/β = α^(p-1 - (p+3)/8) = α^((7p-11)/8)
// = α^3 * (α^7)^((p-5)/8).
//
// If α is square, then (1/β)^2 = ±(1/α), so that (1/β)^2 α = ±1.
let a3 = &self.square() * self; // α^3
let a7 = &a3.square() * self; // α^7
let mut v = &a3 * &a7.pow_p58(); // α^(p-1-(p+3)/8)
let check = self * &v.square(); // ±1 if α is square
if v.is_zero() == 1u8 {
return Some(v); // α was zero all along
} else if check == FieldElement::one() {
return Some(v); // computed the correct sqrt
} else if check == -&FieldElement::one() {
// wrong sign, multiply by sqrt(-1)
return Some(&v * &constants::SQRT_M1);
} else {
return None; // input was nonsquare
}
}
/// chi calculates `self^((p-1)/2)`. /// chi calculates `self^((p-1)/2)`.
/// ///
/// # Return /// # Return