No Subject

    On Tue, 30 Nov 1999, Thomas Kenneth Zaplachinski wrote:
    > Does anyone have any benchmarks for performing software modular
    > exponentiation for different key lengths?  What would be an acceptable
    > length of time for performing g^x mod n where x is a random k-bit integer,
    > n is a k-bit prime, and g is a random k-bit generator for the field Fn,
    > for k=512, 1024, 2048, and 4096?

    Some just generated numbers :-).

    mul  256 ^  256 % 256 ->     1.446ms
    mul  512 ^  512 % 512 ->     8.430ms
    mul 1024 ^ 1024 % 1024 ->   53.510ms
    mul 2048 ^ 2048 % 2048 ->  366.214ms
    mul 4096 ^ 4096 % 4096 -> 2519.000ms

    Pentium II 450, Visual C 6.0 + 586 
    asm.  This build is targeted at
    512^512%512

    eric
    --
    Eric Young | eay@pobox.com

---

• Prev by Date: Re: MM with signatures and dynamic IP addresses?
• Next by Date: No Subject
• Prev by thread: I-D ACTION:draft-ietf-ipsec-isakmp-hybrid-auth-03.txt
• Next by thread: No Subject
• Index(es):
  • Main
  • Thread