From c0f2b2d8b6363ec9c8f7bb57e530d0f60e732f07 Mon Sep 17 00:00:00 2001 From: Daira Hopwood Date: Sat, 2 Jan 2021 00:20:36 +0000 Subject: [PATCH] Correct a comment. Signed-off-by: Daira Hopwood --- hashtocurve.sage | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/hashtocurve.sage b/hashtocurve.sage index 0ddb8bf..ab29077 100755 --- a/hashtocurve.sage +++ b/hashtocurve.sage @@ -156,8 +156,7 @@ def map_to_curve_simple_swu(F, E, Z, us, c): # This magic also comes from a generalization of [WB2019, section 4.2]. # # The Sarkar square root algorithm with input s gives us a square root of - # h * s for free when s is not square, provided we choose h to be a generator - # of the order 2^n multiplicative subgroup (where n = 32 for Pallas and Vesta). + # h * s for free when s is not square, where h is a fixed nonsquare. # We know that Z/h is a square since both Z and h are nonsquares. # Precompute \theta as a square root of Z/h, or choose Z = h so that \theta = 1. #