Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for Bonnin (0.05 seconds)

  1. fess-crawler/src/test/resources/extractor/eml/sample4.eml

    Das Schmiedehandwerk war in den vergangenen Jahrhunderten eine der kräftezehrendsten Arbeiten, die es zu verrichten
    gab. Unter enormen Kraftaufwand musste ein heißes Eisen mit einem Hammer geformt werden. Beim Glashütter
    Dorfschmied können Sie ein Messer schmieden und so einen Einblick in diese schwere Arbeit erhalten. Das Messer wird
    anschließend geschliffen und kann mitgenommen werden.
    Workshop Nr. 2:
    Created: Sat Dec 20 11:21:39 GMT 2025
    - Last Modified: Sun Jan 07 09:15:11 GMT 2018
    - 681K bytes
    - Click Count (0)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    Since p = 1 mod 4, we can't use the exponentiation by (p + 1) / 4 like // for the other primes. Instead, implement a variation of Tonelli–Shanks. // The constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([...
    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)
  3. lib/fips140/v1.1.0-rc1.zip

    Since p = 1 mod 4, we can't use the exponentiation by (p + 1) / 4 like // for the other primes. Instead, implement a variation of Tonelli–Shanks. // The constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([...
    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