Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for smaller (0.07 seconds)

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

    following hold: // // u = A*a - B*m // v = D*m - C*a // 0 < u <= a // 0 <= v <= m // 0 <= A < m // 0 <= B <= a // 0 <= C < m // 0 <= D <= a // // After each loop iteration, u and v only get smaller, and at least one of // them shrinks by at least a factor of two. for { // If both u and v are odd, subtract the smaller from the larger. // If u = v, we need to subtract from v to hit the modified exit condition. if u.IsOdd() == yes && v.IsOdd() == yes { if v.cmpGeq(u) == no { u.sub(v) A.Add(C, &Modulus{nat:...
    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

    following hold: // // u = A*a - B*m // v = D*m - C*a // 0 < u <= a // 0 <= v <= m // 0 <= A < m // 0 <= B <= a // 0 <= C < m // 0 <= D <= a // // After each loop iteration, u and v only get smaller, and at least one of // them shrinks by at least a factor of two. for { // If both u and v are odd, subtract the smaller from the larger. // If u = v, we need to subtract from v to hit the modified exit condition. if u.IsOdd() == yes && v.IsOdd() == yes { if v.cmpGeq(u) == no { u.sub(v) A.Add(C, &Modulus{nat:...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  3. RELEASE.md

    Aaron Schumacher, Aidan Dang, Akihiko ITOH, Aki Sukegawa, Arbit Chen, Aziz Alto,
    Danijar Hafner, Erik Erwitt, Fabrizio Milo, Felix Maximilian Möller, Henry
    Saputra, Sung Kim, Igor Babuschkin, Jan Zikes, Jeremy Barnes, Jesper Steen
    Møller, Johannes Mayer, Justin Harris, Kashif Rasul, Kevin Robinson, Loo Rong
    Jie, Lucas Moura, Łukasz Bieniasz-Krzywiec, Mario Cho, Maxim Grechkin, Michael
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
Back to Top