crates.io / crypto-bigint / 0.7.6
crypto-bigint 0.7.6
- Source
- https://github.com/RustCrypto/crypto-bigint
- Artifact scanned
crypto-bigint-0.7.6.crate- Compared with
crypto-bigint-0.7.5.crate(0 signals introduced since)- Files
- 215 scanned, 9 skipped (binary, oversized, or unrecognised)
- Signals
- 0 critical · 0 warn · 5 info
- Scan time
- 0.4 s
- LLM review
- LLM review by claude-haiku-5-5 (Anthropic): nothing at warn or critical to review.
- Disclude version
- 4.3.0
- Scanned (UTC)
- 2026-10-25 06:27
Signals
Ordered by severity, then signals introduced in this release. Hidden characters are shown as ⟨U+…⟩.
-
// Constant-time versions of modular square root algorithms based on: // Koo, N., Cho, G.H. and Kwon, S. (2013), "Square root algorithm in 𝔽q for q ≡ 2s + 1 (mod 2s+1)". // Electron. Lett., 49: 467-469. https://doi.org/10.1049/el.2012.4239 -
// the reciprocal must be equal to v = floor((β^3 − 1)/d) − β // (β^3 − βd - 1)/d - 1 < v <= (β^3 − βd - 1)/d // β^3 − βd - 1 - d < v*d <= β^3 − βd - 1 // β^3-1 - d < (v+β)d <= β^3-1 -
// the reciprocal must be equal to v = floor((β^3 − 1)/d) − β // (β^3 − βd - 1)/d - 1 < v <= (β^3 − βd - 1)/d // β^3 − βd - 1 - d < v*d <= β^3 − βd - 1 // β^3-1 - d < (v+β)d <= β^3-1 -
// (β^3 − βd - 1)/d - 1 < v <= (β^3 − βd - 1)/d // β^3 − βd - 1 - d < v*d <= β^3 − βd - 1 // β^3-1 - d < (v+β)d <= β^3-1 let actual = -
// (β^3 − βd - 1)/d - 1 < v <= (β^3 − βd - 1)/d // β^3 − βd - 1 - d < v*d <= β^3 − βd - 1 // β^3-1 - d < (v+β)d <= β^3-1 let actual =
Reproduce This Scan
Run disclude locally to verify. These commands scan the published file; the "new in this release" marks come from comparing it with the previous release's file, which they don't repeat. Add --format sarif for SARIF output. Add --llm (with an API key in the environment) to include the LLM review.
|
&&