Encryption algorithm based on system of linear diophantine equations resistant to quantum algorithms
-
Updated
Mar 29, 2021 - Java
Encryption algorithm based on system of linear diophantine equations resistant to quantum algorithms
via Collapse Theory and AK High-Dimensional Projection This repository contains Version 2.0 of a formally verifiable, obstruction-theoretic proof of the ABC Conjecture, based on:
Program finds a general formula, which gives all integer solutions to a two variable diophantine linear equation
Algorithms relating to Diophantine equations
🧮 Solve linear Diophantine equations of the form ax + by = c
onstructive proof of the Catalan Conjecture (Mihăilescu's Theorem)
🔢 High-performance Rust library for solving Pell equations (x² - D·y² = 1). Features streaming API, performance boosted, arbitrary precision arithmetic, and comprehensive mathematical analysis tools. Perfect for cryptography, number theory research, and educational applications. 58 tests, zero warnings, production-ready.
Interactive solver for linear Diophantine equations using React + TypeScript
Add a description, image, and links to the diophantine-equations topic page so that developers can more easily learn about it.
To associate your repository with the diophantine-equations topic, visit your repo's landing page and select "manage topics."