# could it be a trapdoor

*From*: "laicko" <yichun.zhang@xxxxxxxxx>*Date*: 29 Mar 2006 06:48:24 -0800

if E(K) is a elliptic curve over a finite field K, then we could

construct a subgroup with order N.

Let N=p*q, p and q are both big prime.

Then here comes my question:

if we make N in public , let p and q in secret,

let the points in this subgroup is the plaintext space,

then could we can conclude that: if we let e<N, then to compute eM from

M is easy and compute M from eM is hard?

.

**Follow-Ups**:**Re: could it be a trapdoor***From:*Kristian Gjøsteen

**Re: could it be a trapdoor***From:*tomstdenis

- Prev by Date:
**Re: Automate GPG or PGP to make an .exe** - Next by Date:
**Re: could it be a trapdoor** - Previous by thread:
**Can we use these to construct a signature?** - Next by thread:
**Re: could it be a trapdoor** - Index(es):