LucasNTT is a project that rethinks fast integer computation.
While most modern algorithms, used for example in digital signal processing, cryptography and prime number prospection, rely on floating-point arithmetic and complex numbers, LucasNTT uses pure integer math, no rounding, no approximations.
While most modern algorithms, used for example in digital signal processing, cryptography and prime number prospection, rely on floating-point arithmetic and complex numbers, LucasNTT uses pure integer math, no rounding, no approximations.
At its core:
– A primality test for large Mersenne numbers using only modular arithmetic;
– A set of clear, accessible resources explaining fast multiplication, FFT and NTT for developers and curious minds.
Whether you're into number theory, algorithm optimization, or just want to understand how big math problems get solved, LucasNTT invites you to explore. Use the top menu above to access source code, technical documents, and educational material.
– A primality test for large Mersenne numbers using only modular arithmetic;
– A set of clear, accessible resources explaining fast multiplication, FFT and NTT for developers and curious minds.
Whether you're into number theory, algorithm optimization, or just want to understand how big math problems get solved, LucasNTT invites you to explore. Use the top menu above to access source code, technical documents, and educational material.
© LucasNTT. All rights reserved. |
Design from HTML5 UP |