Re: Naive Square root algorithm for GNFS ?
From: Jean-Luc Cooke (jlcooke_at_engsoc.org)
Date: 03/30/05
- Next message: Tom St Denis: "Re: Bruce Schneier's Applied Cryptography"
- Previous message: Jean-Luc Cooke: "Re: Bruce Schneier's Applied Cryptography"
- In reply to: Michael Amling: "Re: Naive Square root algorithm for GNFS ?"
- Next in thread: Unruh: "Re: Naive Square root algorithm for GNFS ?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 30 Mar 2005 16:53:06 GMT
Michael Amling <nospam@nospam.com> wrote:
> What is this an example of? Your sqrtmod(4,5) returns 2 and
> sqrtmod(1, 5) returns 1.
> I think you mean "doh!" and "doh!". If x has no square root modulo m
> in 1..(m-1)/2 then x has no square root in (m+1)/2..m-1 modulo m.
http://www.pusboil.com/dohecho.wav
JLC
--
- Next message: Tom St Denis: "Re: Bruce Schneier's Applied Cryptography"
- Previous message: Jean-Luc Cooke: "Re: Bruce Schneier's Applied Cryptography"
- In reply to: Michael Amling: "Re: Naive Square root algorithm for GNFS ?"
- Next in thread: Unruh: "Re: Naive Square root algorithm for GNFS ?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
