Sujet : Re: Microarch Club
De : already5chosen (at) *nospam* yahoo.com (Michael S)
Groupes : comp.archDate : 29. Mar 2024, 16:38:58
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <20240329173858.0000091d@yahoo.com>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13
User-Agent : Claws Mail 4.1.1 (GTK 3.24.34; x86_64-w64-mingw32)
On Fri, 29 Mar 2024 13:38:55 +0100
Terje Mathisen <
terje.mathisen@tmsw.no> wrote:
Michael S wrote:
On Thu, 28 Mar 2024 09:31:11 +0100
Terje Mathisen <terje.mathisen@tmsw.no> wrote:
Are you aware of any professional crypto algorithm, including
hashes, that uses modulo operations by modulo that is neither
power-of-two nor at least 192-bit wide?
I was involved with the optimization of DFC, the AES condidate from
CERN:
It uses a fixed prime just above 2^64 as the modulus (2^64+13 afair),
and that resulted in a very simple reciprocal, i.e. no need for a DIV
opcode.
Terje
Since DFC lost, I suppose that even ignoring reciprocal optimization
the answer to my question is 'No'.
Microarch Club
Re: Microarch Club