The goal of this repository is to find twin smooth integers of around 256 bits with prime sum, which can be used as public parameters in variants of the B_SIDH protocol.
-
Updated
Jul 2, 2022 - C
#
pell-equation
Here are 5 public repositories matching this topic...
Solve linear and quadratic diophantine equations in two variables: Ax^2 + Bxy + Cy^2 + Dx + Ey + F = 0
-
Updated
Dec 21, 2022 - Java
Generate the fundamental solution (minimal x) to Pell's equation for any parameter. x^2 - n*y^2 = 1
python euler solution solver equation minimum fundamentals fractions pell-equation pell continued-fractions continued
-
Updated
Jul 24, 2018 - Python
🔢 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.
rust performance cryptography algorithms mathematics arbitrary-precision streaming-api bigint memory-efficient number-theory pell-equation continued-fractions mathematical-computing diophantine-equations
-
Updated
Aug 27, 2025 - Rust
Improve this page
Add a description, image, and links to the pell-equation topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the pell-equation topic, visit your repo's landing page and select "manage topics."