Sujet : Re: Exploration of Diffie-Hellman Multiplication versus Exponentiation
De : pc+usenet (at) *nospam* asdf.org (Phil Carmody)
Groupes : sci.cryptDate : 16. Apr 2024, 13:09:13
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <87wmox5x1y.fsf@fatphil.org>
References : 1
User-Agent : Gnus/5.13 (Gnus v5.13) Emacs/26.1 (gnu/linux)
SugarBug <
3883@sugar.bug> writes:
Question 1
----------
>
How difficult is it to find the two hidden prime factors, as opposed
to finding the secret exponent of a known factor as in the first
example?
>
Question 2
----------
>
What modern methods of attack are used to discover the hidden factors
of example 3 and where can I read about them with examples?
>
Question 3
----------
>
Do any cryptosystems actually use any variation of example 3 with
multiplication rather than exponentiation, and if so, which?
>
Question 4
----------
>
Per examples 1 through 3, if x, y are GREATER than modulus M, what are
the implications for security or attack domain parameters and how? Or
in other words, why are x and y usually chosen to be less than M, from
a security perspective?
Just post your tutor's email address, and we can send the answers
directly to him, that'll save you all effort.
Phil
-- We are no longer hunters and nomads. No longer awed and frightened, as we havegained some understanding of the world in which we live. As such, we can castaside childish remnants from the dawn of our civilization.-- NotSanguine on SoylentNews, after Eugen Weber in /The Western Tradition/
Exploration of Diffie-Hellman Multiplication versus Exponentiation
Re: Exploration of Diffie-Hellman Multiplication versus Exponentiation