Search
Search Results
-
-
-
-
Effective and Efficient Masking with Low Noise Using Small-Mersenne-Prime Ciphers
Embedded devices used in security applications are natural targets for physical attacks. Thus, enhancing their side-channel resistance is an...
-
Improved Lattice-Based Attack on Mersenne Low Hamming Ratio Search Problem
This paper investigates the Mersenne number-based AJPS cryptosystem, with a particular focus on its associated hard problem. Specifically, we aim to...
-
-
Generalized Feistel Ciphers for Efficient Prime Field Masking
A recent work from Eurocrypt 2023 suggests that prime-field masking has excellent potential to improve the efficiency vs. security tradeoff of masked...
-
Connecting Leakage-Resilient Secret Sharing to Practice: Scaling Trends and Physical Dependencies of Prime Field Masking
Symmetric ciphers operating in (small or mid-size) prime fields have been shown to be promising candidates to maintain security against low-noise (or...
-
Optimizing Lightweight Intermittent Message Authentication for Programmable Logic Controller
Programmable Logic Controllers (PLCs) are essential for Cyber-Physical Systems (CPS) but lack a software solution for lightweight message...
-
Certifying Giant Nonprimes
GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth...
-
Windmills of the Minds: A Hopping Algorithm for Fermat’s Two Squares Theorem
Fermat’s two squares theorem asserts that a prime one more than a multiple of 4 is a sum of two squares. There are many proofs of this gem in number...
-
Towards Breaking the Half-Barrier of Local Leakage-Resilient Shamir’s Secret Sharing
Advanced methods for repairing Reed-Solomon codes, exemplified by the work of Guruswami and Wooters (STOC 2016), can be exploited to launch local...
-
A color image authenticated encryption using conic curve and Mersenne twister
A robust secure image transmission scheme has to achieve all the security services as confidentiality, authentication, integrity and nonrepudiation...
-
Post-quantum Provably-Secure Authentication and MAC from Mersenne Primes
This paper presents a novel, yet efficient secret-key authentication and MAC, which provide post-quantum security promise, whose security is reduced...
-
On Two Applications of Polynomials \(x^k-cx-d\) over Finite Fields and More
For integers \(k \in [2,q-2]\) coprime to...
-
E\({^2}\)CSM: efficient FPGA implementation of elliptic curve scalar multiplication over generic prime field GF(p)
Elliptic curve scalar multiplication (ECSM) is the primitive operation that is also the main computational hurdle in almost all protocols based on...
-
-
Montgomery-friendly primes and applications to cryptography
This paper deals with Montgomery-friendly primes designed for the modular reduction algorithm of Montgomery. These numbers are scattered in the...
-
An algebraic approach to symmetric linear layers in cryptographic primitives
Subterranean 2.0 is a permutation-based cipher suite which works with a 257 bit-state. It is designed for lightweight cryptography, and it scores...