{"slug": "moddiv-wc-unit-anchored-toeplitz-hankel-rounding-with-exact-binary-lwe-masking", "title": "MODDIV-WC: Unit-Anchored Toeplitz/Hankel Rounding with Exact Binary-LWE Masking and an IND-CCA Security Route", "summary": "A paper titled MODDIV-WC presents a public-key encryption and key-encapsulation candidate built on a widened Hankel linear map followed by deterministic integer division, with an implicit-rejection Fujisaki–Okamoto wrapper called MODDIV-WC-FO. The construction fixes the first coordinate of the secret vector to one and samples the remaining coordinates from a positive interval, an anchor that makes the Hankel map surjective for every admissible secret and underpins the proof. The authors derive IND-CCA security in the classical random-oracle model by combining an exact embedding of binary-secret LWE via a parity mask, a strong leftover-hash argument, a Renyi-divergence transfer lemma, and the modular Fujisaki–Okamoto analysis of Hofheinz, Hovelmanns, and Kiltz, while stating that no practical 128-bit parameters, QROM proof, or deployment claim is made.", "body_md": "\\begin{abstract}\nWe present MODDIV-WC, a public-key encryption and key-encapsulation candidate based on a widened Hankel linear map followed by deterministic integer division, together with an implicit-rejection Fujisaki--Okamoto wrapper, MODDIV-WC-FO. The construction uses a secret vector whose first coordinate is fixed to one and whose remaining coordinates are sampled from a positive interval. This unit anchor makes the Hankel map surjective for every admissible secret, a property that is central to the proof.\nThe security analysis has four layers. First, we give an exact embedding of binary-secret LWE into the widened Hankel map using a parity mask that reproduces the MODDIV-WC secret distribution without statistical loss. Second, in an ideal public-key hybrid, a strong leftover-hash argument hides the challenge key. Third, adapting the Renyi-divergence boundary method of prior LWR and MP-LWR work, we prove a transfer lemma for the unit-anchored MODDIV-WC secret distribution. This avoids the earlier requirement that the probability of crossing a rounding boundary be negligible and instead preserves one-way success probabilities with a multiplicative Renyi loss. Fourth, we combine one-way chosen-plaintext security with the implicit-rejection modular Fujisaki--Okamoto analysis of Hofheinz, Hovelmanns, and Kiltz to derive IND-CCA security in the classical random-oracle model.\nFor an explicit asymptotic family, the correctness, Renyi, leftover-hash, binary-secret-LWE, and random-oracle losses are simultaneously negligible, while the source LWE noise remains inverse-polynomial. Together with classical worst-case-to-LWE reductions and the binary-secret/modulus transformations of Brakerski, Langlois, Peikert, Regev, and Stehle, this yields an internally audited candidate route from polynomial-factor worst-case lattice hardness to IND-CCA security. No practical 128-bit parameters, QROM proof, or deployment claim is made.\n\\end{abstract}", "url": "https://wpnews.pro/news/moddiv-wc-unit-anchored-toeplitz-hankel-rounding-with-exact-binary-lwe-masking", "canonical_source": "https://eprint.iacr.org/2026/2747", "published_at": "2026-11-03 17:35:12+00:00", "updated_at": "2026-11-14 16:22:26.884036+00:00", "lang": "en", "topics": ["artificial-intelligence", "ai-research", "neural-networks"], "entities": ["MODDIV-WC", "MODDIV-WC-FO", "Hofheinz", "Hovelmanns", "Kiltz", "Brakerski", "Langlois", "Peikert"], "also_reported_by": [], "takeaway": "The unit-anchored MODDIV-WC construction replaces the earlier requirement that rounding-boundary crossing probability be negligible with a Renyi-divergence transfer lemma that preserves one-way success probabilities at a multiplicative Renyi loss, while source LWE noise stays inverse-polynomial.", "recommendation": null, "alternates": {"html": "https://wpnews.pro/news/moddiv-wc-unit-anchored-toeplitz-hankel-rounding-with-exact-binary-lwe-masking", "markdown": "https://wpnews.pro/news/moddiv-wc-unit-anchored-toeplitz-hankel-rounding-with-exact-binary-lwe-masking.md", "text": "https://wpnews.pro/news/moddiv-wc-unit-anchored-toeplitz-hankel-rounding-with-exact-binary-lwe-masking.txt", "jsonld": "https://wpnews.pro/news/moddiv-wc-unit-anchored-toeplitz-hankel-rounding-with-exact-binary-lwe-masking.jsonld"}}