Regarding the primes of being one bit longer the point was when you say "I have a k-bit prime" it should be a prime larger than 2^k not 2^ {k-1} as in the case...
Hi, I have been using (a derivative of) rsa_make_key to create an RSA keypair. When I attempted to use the key with another piece of software I discovered that...
Trevor Davel
TrevorD@...
Dec 3, 2003 12:36 am
28
Hmm addition... oh hi people. Just writing to say that I have added additional functions to ... oh ... anyways I updated the prime gen code in both LTC/LTM to...
... required ... fine. ... which ... Hehehe, yeah LTC as a DLL is 222KB... it works great and MSVC can see the symbols in the dll [just don't know how to make...
I made a Cygwin makefile that will make a generic [no cygwin required to use the DLL] DLL from LibTomMath. In theory you could make an import lib and then use...
Greg being the ultra-nice person he is has been plugging the LTM book around. Addison-Wesley turned the book down [too good for them I guess... ;-)] and...
... 64: 'str' is assigned a value that is never used in function mp_toradix Fixed this one. It was the *str++ = '\0'; NULL [or NIL as you may prefer :-)] byte...
Hi Tom Before you release next LTM you might want to fix these two small warnings that bcb 5.51 gave me: Warning W8004...
henrik_goldman@...
Nov 7, 2003 1:53 pm
20
I've fixed several things in both LTM/LTC. In LTC I fixed a bug in rsa_exptmod where if you threw a random "key type" at it it would always just use the "d"...
... GPG is using Karatsuba, not Montgomery. But I'm surprised, I would have thought Montgomery would be faster. Also, on my machine, it looks like GPG...
... You lie. Liar! kiddin. hmm I dunno why GPG is faster if software only is used. Chances are there are still specific tweaks in the algos. One outstanding...
... No. I wouldn't think so, because this is a signature verification, i.e a public key operation. To my understanding, you only use CRT on private key ...
... i=15 is probably because GnuPG will use CRT. Did you code your RSA via LTM to use CRT or just one straight exptmod? The rest of the nums seem about right....
Another interesting result: LTM and GnuPG WITHOUT assembly code are close in performance. Tests have been done on sample modular exponentiation. Tests #13 and...
Hi, I have worked on doing a few pre-computations for modular exponentiation: * the window size & its content, in bn_mp_exptmod_fast.c * dr in bn_mp_exptmod.c ...
Sorry, I posted this answer yesterday night but I forgot I hadn't subscribed with that email... ... ___________________________________________________________...
... Perhaps. But I never said LTM is as best as it could be [for ISO C]. Though you have to admit if it comes that close and the others are in hardcoded asm...
... Yes, I know... on one hand this is bad because the code gets awful to read + less portable... but on the other hand their performance is better... ... ...
... <axelle_apvrille@y...> wrote: [snip timings] ... but ... Part of the problem as far as LTM is, is that GNUPG and OpenSSL are hardly generic toolkits. They...
Hi Tom, We had been telling you lately that GnuPG's performances were 4 times worse than OpenSSL, and that LTM seems to be not too far from OpenSSL. Actually,...
My parents are off to NY this week.. booyah, houseparty! Anyways they took off this morning and woke me up at 4am... no fun! Having oodles of time to waste...
Well LT work has been winding down for seemingly forever... :-) There is one last bug to fix in LTM and no known bugs in LTC. So my thinking is the only things...
I've released the updated LibTomCrypt v0.91 with the following changes Sept 25th, 2003 v0.91 -- HMAC fix of 0.90 was incorrect for keys larger than the block...
... True, however, I normally ignore the MSVC warnings past /W3. ... in some cases then? ... Yes, the default for LTM is -Wall -W for GCC and /W3 for MSVC. My...
... Yes those are the ones I mean. ... No worries, I didn't say that either. But they give warnings :) ... Isn't default level /W3? Does this mean it will...
henrik_goldman@...
Sep 21, 2003 11:26 am
3
... reproduced. ... You mean the two in the montgomery code? Those aren't bugs though. MP_MASK for instance is smaller than a mp_digit so the "and" operations...
Thanks Tom for fixing the bug(s). I did a small test with 0.27 and couldn't get the problem reproduced. The 2 missing typecasts I mentioned weren't fixed...
Henrik Goldman
henrik_goldman@...
Sep 21, 2003 10:48 am
1
So if you didn't get the message from iahu.ca I've released 0.27 of LibTomMath. Thanks to Henrik for finding the buffer overflow! Tom...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
