Erik Norgaard wrote:
pair (n,e) and the private key can be respresented either as a pair
(n,d) or in its Chinese Remainder Theorem form (CRT). The latter should
be faster, but only applies for keys with more than two primefactors.
Oh, I see, you use CRT to designate the key with the added speedup
Charles B Cranston wrote:
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operation
takes about 1500 (as
Erik Norgaard wrote:
Charles B Cranston wrote:
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operatio
Charles B Cranston wrote:
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operation
takes about 1500 (as
Doing it the hard way requires roughly 1.5 times key length
number of modular multiplies (assuming about half the bits are
ones and half zeroes) so if the shortcutted public key operation
takes 17 units of time the non-shortcutted private key operation
takes about 1500 (assuming a 1000 bit key). E
Charles B Cranston wrote:
You should factor in the RSA speedups in your space estimates.
Typically a public exponent of 2^16+1 is used so you need not
pass this separately for a public key. However, the speedup
for the private key operation involves all those other fields
in a private key, which e
Here's a crazy idea:
The computer talking to the Java card rolls a random session key.
In the first operation transfer a private key into the device,
encrypted by the session key.
In the second operation transfer the data to be encrypted and
the session key. The Java card can decrypt the private k
You should factor in the RSA speedups in your space estimates.
Typically a public exponent of 2^16+1 is used so you need not
pass this separately for a public key. However, the speedup
for the private key operation involves all those other fields
in a private key, which expands the space requireme
Hi,
Sorry, I haven't written to the list before, if you know of sources of
information that will answer my question, please just give me a link.
I am programming a JavaCard v2.1, to provide encryption and decryption
using either stored private/public keys or keys passed to the input data
buffer
