Is it a hard problem to solve
- From: "laicko" <yichun.zhang@xxxxxxxxx>
- Date: 26 Dec 2005 23:44:04 -0800
We all know given P,aP,bP, to compute abP is a hard problem in elliptic
curve
my question is: Given abP,aP, to compute bP is a hard problem or not?
another question is like that:
there is a black-box, input xP, output xyP. The multiplication
parameter y is kept from any outsider. Is it possible for someone to
simulate the function of the black-box after some trainings?
The behavior can be depicted like that:
First, the attacker input a point sequence x_1P,x_2P,...,x_iP to the
black-box, and get corresponding output point x_1yP,x_2yP,...,x_iyP.
Then, after thoroughly analyzing the input-output pair, the attacker
tires to compute x_kyP without the help of black-box while x_k did not
occur in training phase.
regards!
.
- Follow-Ups:
- Re: Is it a hard problem to solve
- From: David Wagner
- Re: Is it a hard problem to solve
- Prev by Date: Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
- Next by Date: Re: Is it a hard problem to solve
- Previous by thread: DES doubts. why we use 56 bit key when ony 48 bits are used?
- Next by thread: Re: Is it a hard problem to solve
- Index(es):