pkg syscall (freebsd-arm64), const IN_CLASSA_NSHIFT = 24
pkg syscall (freebsd-arm64), const IN_CLASSA_NSHIFT ideal-int
pkg syscall (freebsd-arm64), const IN_CLASSB_HOST = 65535
pkg syscall (freebsd-arm64), const IN_CLASSB_HOST ideal-int
pkg syscall (freebsd-arm64), const IN_CLASSB_MAX = 65536
pkg syscall (freebsd-arm64), const IN_CLASSB_MAX ideal-int
pkg syscall (freebsd-arm64), const IN_CLASSB_NET = 4294901760

Dmitri Goutnik <******@****.***> 1676652256 -0500

with different primes. continue } if err != nil { return nil, err } e := bigmod.NewNat().SetUint(65537) d, ok := bigmod.NewNat().InverseVarTime(e, λ) if !ok { // This checks that GCD(e, lcm(p-1, q-1)) = 1, which is equivalent // to checking GCD(e, p-1) = 1 and GCD(e, q-1) = 1 separately in // FIPS 186-5, Appendix A.1.3, steps 4.5 and 5.6. // // We waste a prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing...

with different primes. continue } if err != nil { return nil, err } e := bigmod.NewNat().SetUint(65537) d, ok := bigmod.NewNat().InverseVarTime(e, λ) if !ok { // This checks that GCD(e, lcm(p-1, q-1)) = 1, which is equivalent // to checking GCD(e, p-1) = 1 and GCD(e, q-1) = 1 separately in // FIPS 186-5, Appendix A.1.3, steps 4.5 and 5.6. // // We waste a prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing...