Hi, I was wondering what can be the simplest asymmetric algorithm
around, for "educational purposes", not meant to protect important data
but more on understanding all the steps involved. I would like then to
implement all of this in a FPGA-style hardware implementation, where the
resources are limited.

Thank you

Hi JSH,

JSH wrote :

Your solution seems powerful. Personally I am not interested in the
practice, the running time, or whatsoever. Only the theory.
All your algebra is easy to understand. That's great. Thanks !

However I can not figure out how your equations could work for T = 1081

In that case, the variable z would not be a multiple of 3, so what
should I do ?

Regards,
Jean-Maetso

Hello All

I am fairly new to ECC. Currently I am trying to code a non-efficient
binary polynomial implementation as a learning exercise. I do not have
a maths background, so some of the (probably quite basic) concepts are
not totally clicking with me.

I would appreciate it if someone could take the time to try to help me
with my questions below.

Thanks in advance, and apologies if what I am asking is silly.

1. Why does the base point need to be a generator? If I chose to use a
non-generator as my base point, what would happen?

2. I understand what the order of a curve is (i.e. the number of
points on the curve), but what is the order of the base point?

3. Is the order of the base point the same as the order of a point?

4. Does the order of the curve need to be prime? Or does it simply
need to be divisible by a large prime?

5. Let's say the order of my curve is 68 (I know this is a silly
example.) This is 17 * 4. Does this mean 17 and 4 are cofactors of the
curve? So, #E = curve order = r*p = cofactor * large prime = 4 * 17?

C12-GAMMA; a free/open-source E-mail security and file encryption
tool for BSD/Linux:

http://www.leopard.uk.com/cion

[ probably the most important cryptography software ever written;
because it contains the CipherPacket source-code/algorithm ]