Search arXiv⌕ Search

arXiv subjects

Rufine Marius Lalasoa

Publications and source records attributed to Rufine Marius Lalasoa.

3 recordsLinked to original sources

DM-RSA-OAEP: Formal Treatment of a Dual-Modulus Fault-Detection Countermeasure Based on Physical Diversity

We revisit DM-RSA, an RSA variant that uses two independent moduli, whose original version was broken by Håstad's attack and contained an incorrect compromise-tolerance claim. We give a formal treatment of its repaired variant, DM-RSA-OAEP: (i) a complete IND-CCA2 security proof in the random-oracle model via a two-step hybrid argument, upper-bounding the security of the scheme by that of the weaker underlying RSA-OAEP instance, with an explicit simulation loss; (ii) a fault-detection theorem in an explicit adversary model that covers computation, key, and verification faults, including safe-error attacks, under a clearly stated physical-diversity assumption; (iii) an explicit analysis of why the countermeasure degrades to uselessness when the diversity assumption is violated (common-mode faults on a single chip). We position the scheme against the countermeasure landscape and against the broken dual-modulus literature. The contribution is deliberately framed as a fault countermeasure with a provable detection guarantee, not as a computationally stronger RSA. We conclude with a concrete instantiation and a detailed measurement protocol.

cs.CR↗

DM-RSA: An Extension of RSA with Dual Modulus

We introduce DM-RSA (Dual Modulus RSA), a variant of the RSA cryptosystem that employs two distinct moduli symmetrically to enhance security. By leveraging the Chinese Remainder Theorem (CRT) for decryption, DM-RSA provides increased robustness against side-channel attacks while preserving the efficiency of classical RSA. This approach improves resistance to partial compromise of a modulus and integrates easily into existing infrastructures.

cs.CR↗

A Dynamical System-based Key Equation for Decoding One-Point Algebraic-Geometry Codes

A closer look at linear recurring sequences allowed us to define the multiplication of a univariate polynomial and a sequence, viewed as a power series with another variable, resulting in another sequence. Extending this operation, one gets the multiplication of matrices of multivariate polynomials and vectors of powers series. A dynamical system, according to U. Oberst is then the kernel of the linear mapping of modules defined by a polynomial matrix by this operation. Applying these tools in the decoding of the so-called one point algebraic-geometry codes, after showing that the syndrome array, which is the general transform of the error in a received word is a linear recurring sequence, we construct a dynamical system. We then prove that this array is the solution of Cauchy's homogeneous equations with respect to the dynamical system. The aim of the Berlekamp-Massey-Sakata Algorithm in the decoding process being the determination of the syndrome array, we have proved that in fact, this algorithm solves the Cauchy's homogeneous equations with respect to a dynamical system.

cs.IT↗