Results 41 to 50 of about 696 (69)

On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in ℚ(𝜁2𝑠)

Journal of Mathematical Cryptology, 2019
A family of ring-based cryptosystems, including the multilinear maps of Garg, Gentry and Halevi [Candidate multilinear maps from ideal lattices, Advances in Cryptology—EUROCRYPT 2013, Lecture Notes in Comput. Sci.
Biasse Jean-François, Song Fang
doaj   +1 more source

Predicate signatures from pair encodings via dual system proof technique

Journal of Mathematical Cryptology, 2019
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.
Nandi Mridul, Pandit Tapas
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 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

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

Partial Spreads in Random Network Coding [PDF]

, 2013
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular, following an idea in
Gorla, Elisa, Ravagnani, Alberto
core  

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

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

A new method of choosing primitive elements for Brezing–Weng families of pairing-friendly elliptic curves

Journal of Mathematical Cryptology, 2015
In this paper we present a new method of choosing primitive elements for Brezing–Weng families of pairing-friendly elliptic curves with small rho-values, and we improve on previously known best rho-values of families [J.
Yoon Kisoon
doaj   +1 more source