Options
All
  • Public
  • Public/Protected
  • All
Menu

Class MathUtils

This class contains all the math shit for my stupid rewrite of RSA.

Hierarchy

  • MathUtils

Index

Constructors

Methods

Constructors

constructor

Methods

Static extendedEuclideanAlgorithm

  • extendedEuclideanAlgorithm(a: number, b: number): [number, number, number]

  • So this math I don't fully know how to explain nor whether it is right.

    Parameters

    • a: number

      Number to find the Euclidean greatest common denominator against b

    • b: number

      Number to find the Euclidean greatest common denominator against a

    Returns [number, number, number]

Static gcd

  • gcd(a: number, b: number): number

  • Finds greatest common denominator between two numbers a and b

    Parameters

    • a: number

      Number to find the greatest common denominator against b

    • b: number

      Number to find the greatest common denominator against a

    Returns number

Static lcm

  • lcm(a: number, b: number): number

  • Finds lowest common multiple between two numbers a and b

    Parameters

    • a: number

      Number to find the lowest common multiple against b

    • b: number

      Number to find the lowest common multiple against a

    Returns number

Static randomPrime

  • randomPrime(): number

  • Generates a random-ish prime number between 1 and 65536

    Returns number

Generated using TypeDoc