rusqsieve - World's fastest browser SIQS integer factorization
We announce rusqsieve, the world's fastest integer factorization program/library using WebAssembly, for balanced semiprimes from 192 bits to 288 bits, implemented with SIQS algorithm.
Today we announce rusqsieve, the world's fastest integer factorization program/library using WebAssembly (WASM), for balanced semiprimes from 192 bits to 288 bits, implemented with a self-initializing quadratic sieve (SIQS) algorithm. It is benchmarked, to demonstrate its fastness compared to other QS implementations on the Web.
To our knowledge, rusqsieve holds the fastest publicly documented browser-based SIQS timings for balanced 192-, 224-, and 256-bit semiprimes on a consumer mobile device.
- GitHub: https://github.com/metastable-void/rusqsieve
- Demo is here: https://metastable-void.github.io/rusqsieve/
Why the fastest SIQS on the Web browser
We are implementing on-browser PoW (proof of work) scheme based on factoring RSA numbers. The user's browser is given an RSA challenge on important actions such as sign-ins, or sign-ups. The browser solves the challenge automatically in seconds, and the user continues normally. This is fine for ordinary users, but it is costly for attackers making thousands of sign-in attempts. To raise the bar for challenges without undermining UX, we need the world-record SIQS in the browser.
It is intentionally not a fastest generic integer factorization implementation. It is optimized for RSA semiprimes from 192 bits to 288 bits, on web browsers on ordinary consumer devices. So it does not utilize ECM, for example.
It solves 256-bit RSA semiprimes in ~20s on iPad Air (M3), and 240-bit RSA semiprimes in ~7s on iPad Air (M3). It also behaves well on mid-to-low Android devices, or consumer laptops.
- Crates.io: https://crates.io/crates/rusqsieve
- Rust docs: https://docs.rs/rusqsieve/0.3.0
Ask any questions to its author Yuka MORI mori <AT> menhera dot ad dot jp.
