ECC project on Cryptography - University of Piraeus
-
Updated
Feb 25, 2017 - Python
ECC project on Cryptography - University of Piraeus
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.
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.
A catkin workspace in ROS which uses DBSCAN to identify which points in a point cloud belong to the same object.
Python package that aims to make Euclidean Constructions easy.
Linkage Methods for Hierarchical Clustering
Implementation of Various Asymmetric Crypto systems in pure python.
Python Maze Solver using A* Algorithm with Movement Constraints
Compute the least common multiple (lcm) of two single-precision floating-point numbers.
[Neurocomputing] Official PyTorch implementation for Co-Manifold Learning for Semi-supervised Medical Image Segmentation
Compute the least common multiple (lcm).
Compute the hypotenuse avoiding overflow and underflow.
Compute the hypotenuse avoiding overflow and underflow (single-precision).
Compute the hypotenuse.
Compute the hypotenuse of a single-precision floating-point number.
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."