Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 2 of 2 for BenchmarkMontgomeryR (0.12 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. lib/fips140/v1.0.0-c2097c7c.zip

    ) b.ResetTimer() for i := 0; i < b.N; i++ { x.Add(y, m) } } func BenchmarkModSub(b *testing.B) { x := makeBenchmarkValue() y := makeBenchmarkValue() m := makeBenchmarkModulus() b.ResetTimer() for i := 0; i < b.N; i++ { x.Sub(y, m) } } func BenchmarkMontgomeryR(b *testing.B) { x := makeBenchmarkValue() m := makeBenchmarkModulus() b.ResetTimer() for i := 0; i < b.N; i++ { x.montgomeryRepresenta(m) } } func BenchmarkMontgomeryM(b *testing.B) { x := makeBenchmarkValue() y := makeBenchmarkValue() out...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  2. lib/fips140/v1.1.0-rc1.zip

    ) b.ResetTimer() for i := 0; i < b.N; i++ { x.Add(y, m) } } func BenchmarkModSub(b *testing.B) { x := makeBenchmarkValue() y := makeBenchmarkValue() m := makeBenchmarkModulus() b.ResetTimer() for i := 0; i < b.N; i++ { x.Sub(y, m) } } func BenchmarkMontgomeryR(b *testing.B) { x := makeBenchmarkValue() m := makeBenchmarkModulus() b.ResetTimer() for i := 0; i < b.N; i++ { x.montgomeryRepresenta(m) } } func BenchmarkMontgomeryM(b *testing.B) { x := makeBenchmarkValue() y := makeBenchmarkValue() out...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top