Arbitrary-depth k-stage masked NTT pipelines with fresh inter-stage masking and PF-PINI(≤2) gadgets satisfy a universal 2/q per-observation leakage bound, machine-checked in Lean 4.
2019.FIPS PUB 140-3: Secu- rity Requirements for Cryptographic Modules
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.CR 3years
2026 3representative citing papers
The paper fixes two bugs in Go's extendedGCD for RSA key generation, proves the corrected version correct and terminating via Gobra with Lean lemmata, and reports a 24% speedup.
A Merkle tree pipeline with adaptive chunking provides tamper-evident log verification for IoT edge devices, achieving over 130,000 logs/s throughput, 22 ms verification latency, and perfect tampering detection on synthetic data without blockchain.
citing papers explorer
-
The 1-Bit Barrier is Universal: k-Stage Pipeline Composition and Unified Leakage Bounds for Standard Modular Reductions in PQC Hardware
Arbitrary-depth k-stage masked NTT pipelines with fresh inter-stage masking and PF-PINI(≤2) gadgets satisfy a universal 2/q per-observation leakage bound, machine-checked in Lean 4.
-
GCD: Garbled, Corrected, Demonstrandum -- Fixing and Proving Go's Extended GCD Implementation
The paper fixes two bugs in Go's extendedGCD for RSA key generation, proves the corrected version correct and terminating via Gobra with Lean lemmata, and reports a 24% speedup.
-
Lightweight Tamper-Evident Log Integrity Verification for IoT Edge Environments: A Merkle Tree Pipeline with Adaptive Chunking
A Merkle tree pipeline with adaptive chunking provides tamper-evident log verification for IoT edge devices, achieving over 130,000 logs/s throughput, 22 ms verification latency, and perfect tampering detection on synthetic data without blockchain.