golden hour

/home/doctorbruno/.trash/google-site-kit/third-party/phpseclib/phpseclib/phpseclib/Crypt/EC/Curves

File/Folder	Size	Actions
Curve25519.php	2.75 KB
Curve448.php	2.98 KB
Ed25519.php	10.71 KB
Ed448.php	8.11 KB
brainpoolP160r1.php	1.37 KB
brainpoolP160t1.php	2.12 KB
brainpoolP192r1.php	1.42 KB
brainpoolP192t1.php	1.47 KB
brainpoolP224r1.php	1.46 KB
brainpoolP224t1.php	1.52 KB
brainpoolP256r1.php	1.51 KB
brainpoolP256t1.php	1.56 KB
brainpoolP320r1.php	1.63 KB
brainpoolP320t1.php	1.69 KB
brainpoolP384r1.php	1.72 KB
brainpoolP384t1.php	1.78 KB
brainpoolP512r1.php	1.91 KB
brainpoolP512t1.php	1.97 KB
nistb233.php	443 B
nistb409.php	443 B
nistk163.php	443 B
nistk233.php	443 B
nistk283.php	444 B
nistk409.php	443 B
nistp192.php	443 B
nistp224.php	443 B
nistp256.php	443 B
nistp384.php	443 B
nistp521.php	443 B
nistt571.php	443 B
prime192v1.php	447 B
prime192v2.php	1.41 KB
prime192v3.php	1.41 KB
prime239v1.php	1.48 KB
prime239v2.php	1.48 KB
prime239v3.php	1.48 KB
prime256v1.php	447 B
secp112r1.php	1.29 KB
secp112r2.php	1.32 KB
secp128r1.php	1.31 KB
secp128r2.php	1.34 KB
secp160k1.php	2.03 KB
secp160r1.php	1.36 KB
secp160r2.php	1.39 KB
secp192k1.php	2.06 KB
secp192r1.php	3.37 KB
secp224k1.php	2.14 KB
secp224r1.php	1.45 KB
secp256k1.php	2.32 KB
secp256r1.php	1.5 KB
secp384r1.php	1.68 KB
secp521r1.php	1.95 KB
sect113r1.php	978 B
sect113r2.php	978 B
sect131r1.php	1004 B
sect131r2.php	1004 B
sect163k1.php	1.02 KB
sect163r1.php	1.02 KB
sect163r2.php	1.02 KB
sect193r1.php	1.05 KB
sect193r2.php	1.05 KB
sect233k1.php	1.1 KB
sect233r1.php	1.1 KB
sect239k1.php	1.11 KB
sect283k1.php	1.17 KB
sect283r1.php	1.17 KB
sect409k1.php	1.32 KB
sect409r1.php	1.32 KB
sect571k1.php	1.54 KB
sect571r1.php	1.54 KB

Edit: secp192r1.php

<?php

/**
 * secp192r1
 *
 * This is the NIST P-192 curve
 *
 * PHP version 5 and 7
 *
 * @author    Jim Wigginton <terrafrost@php.net>
 * @copyright 2017 Jim Wigginton
 * @license   http://www.opensource.org/licenses/mit-license.html  MIT License
 * @link      http://pear.php.net/package/Math_BigInteger
 */
namespace Google\Site_Kit_Dependencies\phpseclib3\Crypt\EC\Curves;

use Google\Site_Kit_Dependencies\phpseclib3\Crypt\EC\BaseCurves\Prime;
use Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger;
class secp192r1 extends \Google\Site_Kit_Dependencies\phpseclib3\Crypt\EC\BaseCurves\Prime
{
    public function __construct()
    {
        $modulo = new \Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger('FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFF', 16);
        $this->setModulo($modulo);
        // algorithm 2.27 from http://diamond.boisestate.edu/~liljanab/MATH308/GuideToECC.pdf#page=66
        /* in theory this should be faster than regular modular reductions save for one small issue.
              to convert to / from base-2**8 with BCMath you have to call bcmul() and bcdiv() a lot.
              to convert to / from base-2**8 with PHP64 you have to call base256_rshift() a lot.
              in short, converting to / from base-2**8 is pretty expensive and that expense is
              enough to offset whatever else might be gained by a simplified reduction algorithm.
              now, if PHP supported unsigned integers things might be different. no bit-shifting
              would be required for the PHP engine and it'd be a lot faster. but as is, BigInteger
              uses base-2**31 or base-2**26 depending on whether or not the system is has a 32-bit
              or a 64-bit OS.
           */
        /*
        $m_length = $this->getLengthInBytes();
        $this->setReduction(function($c) use ($m_length) {
            $cBytes = $c->toBytes();
            $className = $this->className;
        
            if (strlen($cBytes) > 2 * $m_length) {
                list(, $r) = $c->divide($className::$modulo);
                return $r;
            }
        
            $c = str_pad($cBytes, 48, "\0", STR_PAD_LEFT);
            $c = array_reverse(str_split($c, 8));
        
            $null = "\0\0\0\0\0\0\0\0";
            $s1 = new BigInteger($c[2] . $c[1] . $c[0], 256);
            $s2 = new BigInteger($null . $c[3] . $c[3], 256);
            $s3 = new BigInteger($c[4] . $c[4] . $null, 256);
            $s4 = new BigInteger($c[5] . $c[5] . $c[5], 256);
        
            $r = $s1->add($s2)->add($s3)->add($s4);
            while ($r->compare($className::$modulo) >= 0) {
                $r = $r->subtract($className::$modulo);
            }
        
            return $r;
        });
        */
        $this->setCoefficients(new \Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger('FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFFFFFFFFFFFC', 16), new \Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger('64210519E59C80E70FA7E9AB72243049FEB8DEECC146B9B1', 16));
        $this->setBasePoint(new \Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger('188DA80EB03090F67CBF20EB43A18800F4FF0AFD82FF1012', 16), new \Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger('07192B95FFC8DA78631011ED6B24CDD573F977A11E794811', 16));
        $this->setOrder(new \Google\Site_Kit_Dependencies\phpseclib3\Math\BigInteger('FFFFFFFFFFFFFFFFFFFFFFFF99DEF836146BC9B1B4D22831', 16));
    }
}