Jose\Component\Core\Util\Ecc\Point

Complexity

Total Complexity

12

Size/Duplication

Total Lines	142
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes

0

10 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	7	2
A	create()	0	4	2
A	infinity()	0	6	1
A	isInfinity()	0	4	1
A	getOrder()	0	4	1
A	getX()	0	4	1
A	getY()	0	4	1
A	cswap()	0	7	1
A	cswapBoolean()	0	10	1
A	cswapGMP()	0	12	1

<?php

/*
 * The MIT License (MIT)
 *
 * Copyright (c) 2014-2017 Spomky-Labs
 *
 * This software may be modified and distributed under the terms
 * of the MIT license.  See the LICENSE file for details.
 */

namespace Jose\Component\Core\Util\Ecc;

/**
 * *********************************************************************
 * Copyright (C) 2012 Matyas Danter.
 *
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES
 * OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
 * OTHER DEALINGS IN THE SOFTWARE.
 * ***********************************************************************
 */

/**
 * This class is where the elliptic curve arithmetic takes place.
 * The important methods are:
 * - add: adds two points according to ec arithmetic
 * - double: doubles a point on the ec field mod p
 * - mul: uses double and add to achieve multiplication The rest of the methods are there for supporting the ones above.
 */
final class Point
{
    /**
     * @var \GMP
     */
    private $x;

    /**
     * @var \GMP
     */
    private $y;

    /**
     * @var \GMP
     */
    private $order;

    /**
     * @var bool
     */
    private $infinity = false;

    /**
     * Initialize a new instance.
     *
     * @param \GMP    $x
     * @param \GMP    $y
     * @param \GMP    $order
     * @param bool    $infinity
     *
     * @throws \RuntimeException when either the curve does not contain the given coordinates or
     *                           when order is not null and P(x, y) * order is not equal to infinity
     */
    private function __construct(\GMP $x, \GMP $y, \GMP $order, bool $infinity = false)
    {
        $this->x = $x;
        $this->y = $y;
        $this->order = null === $order ? gmp_init(0, 10) : $order;
        $this->infinity = $infinity;
    }

    /**
     * @param \GMP $x
     * @param \GMP $y
     * @param \GMP|null $order
     *
     * @return Point
     */
    public static function create(\GMP $x, \GMP $y, ?\GMP $order = null): Point
    {
        return new self($x, $y, null === $order ? gmp_init(0, 10) : $order);
    }

    /**
     * @return Point
     */
    public static function infinity(): Point
    {
        $zero = gmp_init(0, 10);

        return new self($zero, $zero, $zero, true);
    }

    /**
     * @return bool
     */
    public function isInfinity(): bool
    {
        return $this->infinity;
    }

    /**
     * @return \GMP
     */
    public function getOrder(): \GMP
    {
        return $this->order;
    }

    /**
     * @return \GMP
     */
    public function getX(): \GMP
    {
        return $this->x;
    }

    /**
     * @return \GMP
     */
    public function getY(): \GMP
    {
        return $this->y;
    }

    /**
     * @param Point $a
     * @param Point $b
     * @param int   $cond
     */
    public static function cswap(Point $a, Point $b, int $cond)
    {
        self::cswapGMP($a->x, $b->x, $cond);
        self::cswapGMP($a->y, $b->y, $cond);
        self::cswapGMP($a->order, $b->order, $cond);
        self::cswapBoolean($a->infinity, $b->infinity, $cond);
    }

    /**
     * @param $a
     * @param $b
     * @param $cond
     */
    private static function cswapBoolean(bool &$a, bool &$b, int $cond)
    {
        $sa = gmp_init(intval($a), 10);
        $sb = gmp_init(intval($b), 10);

        self::cswapGMP($sa, $sb, $cond);

        $a = (bool) gmp_strval($sa, 10);
        $b = (bool) gmp_strval($sb, 10);
    }

    /**
     * @param \GMP $sa
     * @param \GMP $sb
     * @param int $cond
     */
    private static function cswapGMP(\GMP &$sa, \GMP &$sb, int $cond)
    {
        $size = max(mb_strlen(gmp_strval($sa, 2), '8bit'), mb_strlen(gmp_strval($sb, 2), '8bit'));
        $mask = 1 - intval($cond);
        $mask = str_pad('', $size, $mask, STR_PAD_LEFT);
        $mask = gmp_init($mask, 2);
        $taA = GmpMath::bitwiseAnd($sa, $mask);
        $taB = GmpMath::bitwiseAnd($sb, $mask);
        $sa = GmpMath::bitwiseXor(GmpMath::bitwiseXor($sa, $sb), $taB);
        $sb = GmpMath::bitwiseXor(GmpMath::bitwiseXor($sa, $sb), $taA);
        $sa = GmpMath::bitwiseXor(GmpMath::bitwiseXor($sa, $sb), $taB);
    }
}