Re: About discrete logrithm
- From: Kristian Gjøsteen <kristiag+news@xxxxxxxxxxxx>
- Date: Mon, 27 Feb 2006 09:32:56 +0100
bobic <fbloveu@xxxxxxxxxxx> wrote:
As we know, the discrete logrithm problem (DLP) is a hard problem. But
with the development of math, DLP's difficulty denpends on the
bit-length of p and q, where p is the modular, and q is the generator
g's order. Can you give me the concrete number of them? Thanks in
advance!
You find the bit length of p by studying the performance of the
number field sieve, and you find the bit length of q by studying
the performance of algorithms that work in the subgroup. I'm not
going to give you the standard numbers, you'll find them easily
enough on the web.
--
Kristian Gjøsteen
.
- References:
- About discrete logrithm
- From: bobic
- About discrete logrithm
- Prev by Date: Pre-encrypt IV in CBC mode
- Next by Date: Re: Pre-encrypt IV in CBC mode
- Previous by thread: About discrete logrithm
- Next by thread: Re: About discrete logrithm
- Index(es):
Relevant Pages
|
|