Shor’s algorithm is a quantum algorithm for factoring a number N in O((log N)3) time and O(log N) space,

Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations - PPSN 2020 repository

Structure from Motion using Factorization Method (KLT feature tracker)

Homework for the Numerical Methods course @ ACS, UPB 2018

factorization algorithm from article, 'ternary arithmetic, factorization, and the class number one problem'

Core Fields Arithmetics Project

High-efficiency C++ divisibility-test prime factorizer

Classical Shor's Algorithm

[a.a. 23/24] E. Autore

Compute LSU factorization of a matrix in PyTorch

This repository contains the files necessary for symbolically calculating multivariate power expansions.

This program takes a number n and returns a non-trivial factorization

A pure Python implementation of Shor's quantum factorisation algorithm using classical matrix operations to simulate quantum circuits. This educational project demonstrates the core concepts of Shor's algorithm without requiring quantum computing frameworks like qiskit, making it accessible for learning how the quantum algorithm works step-by-step.

This MATLAB function efficiently computes the inverse of a square matrix using LU factorization. By decomposing the matrix into lower and upper triangular matrices, the function solves for the inverse with improved numerical stability.

Implementation of some basic algorithms relevant for cryptography.