could it be a trapdoor
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

could it be a trapdoor

From: laicko <yichun.zhang@gmail.com>
Date: Wed Mar 29 2006 - 16:48:24 CEST

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?
Received on Mon May 1 01:53:21 2006