Results 41 to 50 of about 68 (58)

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

open access: yesDes Codes Cryptogr, 2021
Alfarano GN, Lieb J, Rosenthal J.
europepmc   +1 more source

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

open access: yesDes Codes Cryptogr, 2022
Bariffi J   +3 more
europepmc   +1 more source

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

open access: yesJournal 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

Inner product functional encryption based on the UOV scheme

open access: yesJournal 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

open access: yesJournal 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

On the Dimension of Algebraic-Geometric Trace Codes

open access: yesMathematics, 2016
We study trace codes induced from codes defined by an algebraic curve X. We determine conditions on X which admit a formula for the dimension of such a trace code.
Phong Le, Sunil Chetty
doaj   +1 more source

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

open access: yesDes Codes Cryptogr, 2021
Renner J, Neri A, Puchinger S.
europepmc   +1 more source

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

open access: yesAnnals 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

open access: yesJournal 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   +2 more
doaj   +1 more source

Smaller public keys for MinRank-based schemes

open access: yesJournal of Mathematical Cryptology
MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed.
Di Scala Antonio J., Sanna Carlo
doaj   +1 more source

Home - About - Disclaimer - Privacy