crashedmind

2009-10-17 04:10:12 UTC

I have a general purpose 32-bit CPU that has an onboard hardware

crypto block that supports low level crypto primitives like:

=95 Modulo exponentiation

=95 Montgomery Multiplication

=95 Montgomery modulo exponentiation

The onboard hardware crypto block supports maximum 2048 bit operations

only e.g. it can support an RSA public key operation (signature

verification) with 2048 bit public modulus =91n=92 and exponent =91e=92 of

value 65537.

I want to know if it is possible to use the crypto h/w (with

associated 2048 bit limit) to do a 4096 bit public key operations (=91n=92

=3D 4096 bit, =91e=92 =3D 65537) and how.

I know all the input parameters in advance (n, e, signature) and can

do whatever pre-computations are required.

I don't have the specification for the crypto block e.g. what model #

is etc... but this is a general question as to what if any techniques

can be used to solve this problem.

Apologies if this is a dumb question...

crypto block that supports low level crypto primitives like:

=95 Modulo exponentiation

=95 Montgomery Multiplication

=95 Montgomery modulo exponentiation

The onboard hardware crypto block supports maximum 2048 bit operations

only e.g. it can support an RSA public key operation (signature

verification) with 2048 bit public modulus =91n=92 and exponent =91e=92 of

value 65537.

I want to know if it is possible to use the crypto h/w (with

associated 2048 bit limit) to do a 4096 bit public key operations (=91n=92

=3D 4096 bit, =91e=92 =3D 65537) and how.

I know all the input parameters in advance (n, e, signature) and can

do whatever pre-computations are required.

I don't have the specification for the crypto block e.g. what model #

is etc... but this is a general question as to what if any techniques

can be used to solve this problem.

Apologies if this is a dumb question...