Implemenation of same basic algorithms used in cryptography.
-
Updated
Jul 22, 2024 - Python
Implemenation of same basic algorithms used in cryptography.
Minimal elements for the base b representations of the prime numbers > b for the subsequence ordering, for 2 ≤ b ≤ 36
Computational algebraic number theory
Competitive Programming Training
零知识证明入门教程。Comprehensive Zero-Knowledge Proofs Tutorial. #zk #WIP
All problems solutions From Codeforces.com Website
A COLLECTION OF ALGORITHMS RELATED TO NUMBER THEORY
FLINT (Fast Library for Number Theory)
Lenstra's Elliptic Curve Factorization Implementation in Rust
Fast discrete logarithm solver in Rust
FigurateNum is a generator of infinite sequences of figurate numbers for Python.
2️⃣ 3️⃣ 5️⃣ 7️⃣ Prime numbers for JavaScript
Object-oriented continued fractions with Python.
Finding Sets of Positive Integers from which you can not Construct an Arithmetic Expression that Evaluates to Zero
Figurate Numbers generates 239 infinite sequences of plane, space, and multidimensional figurate numbers based on the book ‘Figurate Numbers’ (2012) by Elena Deza and Michel Deza. The methods are implemented using the Enumerator class and are designed for use in your math projects or in Sonic Pi.
Cryptanalysis 🔒 assignment to find keys 🔑 of FEAL4 encryption for module: CA642
A computational service and API for exploring and understanding the Collatz Conjecture. Continuously calculates Collatz sequences from any given number and stores results in a SQLite database for querying and analysis.
Gaussian Integers and Gaussian Rational Numbers
🚀 Fast prime counting function implementations
Add a description, image, and links to the number-theory topic page so that developers can more easily learn about it.
To associate your repository with the number-theory topic, visit your repo's landing page and select "manage topics."