Results 51 to 60 of about 103 (87)

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

Construction of LDPC convolutional codes via difference triangle sets. [PDF]

Des Codes Cryptogr, 2021
Alfarano GN, Lieb J, Rosenthal J.
europepmc   +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

Moderate-density parity-check codes from projective bundles. [PDF]

Des Codes Cryptogr, 2022
Bariffi J, Mattheus S, Neri A, Rosenthal J.   +3 more
europepmc   +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

Low-rank parity-check codes over Galois rings. [PDF]

Des Codes Cryptogr, 2021
Renner J, Neri A, Puchinger S.
europepmc   +1 more source

Inner product functional encryption based on the UOV scheme

Journal of Mathematical Cryptology
We analyze the efficiency and security of the inner product functional encryption (IPFE) protocol introduced in 2021 by Debnath, Mesnager, Dey, and Kundu, specifically when instantiated with UOV.
La Scala Roberto, Meneghetti Alessio
doaj   +1 more source

New lattice attacks on DSA schemes

Journal of Mathematical Cryptology, 2016
We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently.
Poulakis Dimitrios
doaj   +1 more source

A note on cohomology and algebraic geometric codes on the curves over rings

Annals of the West University of Timisoara: Mathematics and Computer Science
Let A be a local Artinian ring with residue field k(A). Let X be a curve over A and let be X′ = X ×spec A spec k(A) the fiber of X over k(A). Consider ℒ an invertible sheaf on X and ℒ ′ = ϕ*ℒ ∈ Pic(X′), where ϕ : X′ → X is the natural map.
Nyamda Francis, Mouaha Christophe
doaj   +1 more source

A small serving of mash: (Quantum) algorithms for SPDH-Sign with small parameters

Journal of Mathematical Cryptology
We find an efficient method to solve the semidirect discrete logarithm problem (SDLP) over finite nonabelian groups of order p3{p}^{3} and exponent p2{p}^{2} for certain exponentially large parameters. This implies an attack on SPDH-Sign,Pronounced “SPUD-
Mendelsohn Andrew, Dable-Heath Edmund, Ling Cong   +2 more
doaj   +1 more source