ECC project on Cryptography - University of Piraeus
-
Updated
Feb 25, 2017 - Python
ECC project on Cryptography - University of Piraeus
Euclidean geometry primitives w/ a type-level twist.
My python3 implementation of the Euclidean Division for Binary Polynomials over GF(2).
Script which creates clusters using K-Means Clustering Algorithm with different similarity metrics.
Simple working example of public private key encryption
Simple RSA implementation in Java.
Machine learning functions written in goLang:
A simple program that calculates the Greatest Common Divisor through a user input
Java library for Newtonian Mechanics Modeling with a focus on Immutable Fluency
Software to resample Diffusion Tensor Images (DTI) in the log-euclidean framework.
Get distance between two coordinates using euclidean distance formula
Coding searchable notes for data science and machine learning
Sviluppo dell'algoritmo esteso di euclide. Permette all'utente di calcolare l'MCD tra due numeri interi e restituisce i coefficenti dell'identità di Bezout.
Add a description, image, and links to the euclidean topic page so that developers can more easily learn about it.
To associate your repository with the euclidean topic, visit your repo's landing page and select "manage topics."