but what 'bout B-For Math ?
-
Updated
May 5, 2021 - Java
but what 'bout B-For Math ?
A simple java implementation of elliptic curves for educational purposes
Repo contains code samples for practical learning of cryptography.
Finds the greatest common divisor of two integers using a recursive function based on the Euclidean Algorithm. Simple netbeans-generated GUI.
Implementing RSA Algorithm using MR Test, FME Test, EA and EEA
Estudos de desempenho e funcionamento de algoritmos e estruturas
Algoritms & data structures implementation library. Plus math problems and solutions of puzzle from CodingBat and Advent of Code. Keywords: Shell sort, Knuth sequence, insertion, quick, merge, selection, queues, stack, list.
The Euclidean algorithm is a way to find the greatest common divisor of two positive integers. It is a recursive algorithm.
Programs I wrote that helped me understand encryption, decryption and signing functions along with security protocols. Programs written in Java using BigIntegers.
Euclid's algorithm for finding the greatest common divisor for 2 numbers.
Small Java program to find GCD using Euclids algorithm.
Implementation of Euclid's Algorithm in Python and Java to calculate the Greatest Common Divisor of two integers
Implementation of the extended "Euclidean" algorithm in java.
Add a description, image, and links to the euclidean-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the euclidean-algorithm topic, visit your repo's landing page and select "manage topics."