Results 31 to 40 of about 68 (58)

The Eleventh Power Residue Symbol

Journal of Mathematical Cryptology, 2020
This paper presents an efficient algorithm for computing 11th-power residue symbols in the cyclo-tomic field ℚ(ζ11),$ \mathbb{Q}\left( {{\zeta }_{11}} \right), $where 11 is a primitive 11th root of unity.
Joye Marc, Lapiha Oleksandra, Nguyen Ky, Naccache David   +3 more
doaj   +1 more source

Security analysis of Modified Rivest Scheme

Journal of Mathematical Cryptology, 2014
The Modified Rivest Scheme (MRS) is an additive homomorphic scheme recently used in many applications which demands third party processing of encrypted data. The present study carries out a comprehensive security analysis of MRS.
Haridas Deepthi, Venkataraman Sarma, Varadan Geeta   +2 more
doaj   +1 more source

Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)

Journal of Mathematical Cryptology, 2020
Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a ...
Crescenzo Giovanni Di, Khodjaeva Matluba, Kahrobaei Delaram, Shpilrain Vladimir   +3 more
doaj   +1 more source

Group structure of elliptic curves over ℤ/Nℤ

Journal of Mathematical Cryptology
We characterize the possible groups E(Z∕NZ)E\left({\mathbb{Z}}/N{\mathbb{Z}}) arising from elliptic curves over Z∕NZ{\mathbb{Z}}/N{\mathbb{Z}} in terms of the groups E(Fp)E\left({{\mathbb{F}}}_{p}), with pp varying among the prime divisors of NN.
Sala Massimiliano, Taufer Daniele
doaj   +1 more source

New number-theoretic cryptographic primitives

Journal of Mathematical Cryptology, 2020
This paper introduces new prq-based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not belong to the two common design blueprints, which are the inversion of a trapdoor permutation and the ...
Brier Éric, Ferradi Houda, Joye Marc, Naccache David   +3 more
doaj   +1 more source

Security analysis of ZKPoK based on MQ problem in the multi-instance setting

Journal of Mathematical Cryptology
Bidoux and Gaborit introduced a new general technique to improve zero-knowledge (ZK) proof-of-knowledge (PoK) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank ...
Kahrobaei Delaram, Perret Ludovic, Vigorito Martina   +2 more
doaj   +1 more source

Characterizing overstretched NTRU attacks

Journal of Mathematical Cryptology, 2020
Overstretched NTRU is a variant of NTRU with a large modulus. Recent lattice subfield and subring attacks have broken suggested parameters for several schemes.
De Micheli Gabrielle, Heninger Nadia, Shani Barak   +2 more
doaj   +1 more source

Detecting Encrypted and Unencrypted Network Data Using Entropy Analysis and Confidence Intervals. [PDF]

Entropy (Basel), 2023
Ticleanu OA, Popa T, Hunyadi DI, Constantinescu N.   +3 more
europepmc   +1 more source

Cryptographic properties of monotone Boolean functions

Journal of Mathematical Cryptology, 2016
We prove various results on monotone Boolean functions. In particular, we prove a conjecture proposed recently, stating that there are no monotone bent Boolean functions.
Carlet Claude, Joyner David, Stănică Pantelimon, Tang Deng   +3 more
doaj   +1 more source

Generic constructions of PoRs from codes and instantiations

Journal of Mathematical Cryptology, 2019
In this paper, we show how to construct – from any linear code – a Proof of Retrievability (𝖯𝗈𝖱{\mathsf{PoR}}) which features very low computation complexity on both the client (𝖵𝖾𝗋𝗂𝖿𝗂𝖾𝗋{\mathsf{Verifier}}) and the server (𝖯𝗋𝗈𝗏𝖾𝗋{\mathsf{Prover}}) sides,
Lavauzelle Julien, Levy-dit-Vehel Françoise   +1 more
doaj   +1 more source