Re: ECC Result Verification

From: Tom St Denis (tomstdenis_at_gmail.com)
Date: 11/02/04 

Date: Mon, 01 Nov 2004 21:51:40 -0500

flip wrote:
> Hi All,
>
> can someone please verify these results?
>
> E: y^2 = x^3 + 1 x + 1 (mod 23)
>
> The set of points that satisfy E are given by:

While not "general purpose" LibTomCrypt has ECC "mulmod", "addmod" and
"dblmod" functions you can use. Just plug in your own curve into the
system and add some hackerage [e.g. rip the ECC code from LTC].

Tom

Relevant Pages

  • Re: ECC Result Verification
    ... flip wrote: ... > can someone please verify these results? ... > The set of points that satisfy E are given by: ... "dblmod" functions you can use. ...
    (sci.crypt)
  • Re: ECC Result Verification
    ... flip wrote: ... > can someone please verify these results? ... > The set of points that satisfy E are given by: ... infinity), ...
    (sci.math)
  • Re: ECC Result Verification
    ... flip wrote: ... > can someone please verify these results? ... > The set of points that satisfy E are given by: ... infinity), ...
    (sci.crypt)
  • Re: Q: SAC
    ... (by necessity nonlinear, see (1) ... above) which satisfy the condition ... If we flip any input bit, then two output bits will flip; this implies that the parity of the output will remain the same. ... We can move to any input setting by successively flipping input bits, this means that the output parity will still be fixed, and so half the possible outputs will be impossible. ...
    (sci.crypt)
  • question about ocx control
    ... I think I am correct on this but need to verify just to satisfy my ... I can only access ocx controls in a windows environment or an ...
    (microsoft.public.win32.programmer.ole)