Results 31 to 40 of about 696 (69)

Dynamic-FROST: Schnorr threshold signatures with a flexible committee

Journal of Mathematical Cryptology
Threshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa, De Sclavis Francesco, Galano Giuseppe, Giammusso Sara, Iezzi Michela, Muci Antonio, Nardelli Matteo, Pedicini Marco   +7 more
doaj   +1 more source

Upper bounds for partial spreads [PDF]

, 2016
A partial $t$-spread in $\mathbb{F}_q^n$ is a collection of $t$-dimensional subspaces with trivial intersection such that each non-zero vector is covered at most once.
Kurz, Sascha
core   +1 more source

Time-memory trade-offs for index calculus in genus 3

Journal of Mathematical Cryptology, 2015
In this paper, we present a variant of Diem's O˜(q)${\widetilde{O}(q)}$ index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field 𝔽q.
Laine Kim, Lauter Kristin
doaj   +1 more source

On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R

InPrime, 2022
This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj   +1 more source

DLP in semigroups: Algorithms and lower bounds

Journal of Mathematical Cryptology, 2022
The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups.
Han Jiao, Zhuang Jincheng
doaj   +1 more source

Elliptic curve and k-Fibonacci-like sequence

Scientific African, 2023
In this paper, we will introduce a modified k-Fibonacci-like sequence defined on an elliptic curve and prove Binet’s formula for this sequence. Moreover, we give a new encryption scheme using this sequence.
Zakariae Cheddour, Abdelhakim Chillali, Ali Mouhib   +2 more
doaj   +1 more source

Pl\"ucker Embedding of Cyclic Orbit Codes [PDF]

, 2012
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.Comment: to appear in ...
Trautmann, Anna-Lena
core  

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

The polynomial learning with errors problem and the smearing condition

Journal of Mathematical Cryptology, 2022
As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana, Chin Ariana, Kirtland Aaron, Nazarchuk Vladyslav, Plotnick Esther   +4 more
doaj   +1 more source

On deep holes of standard Reed-Solomon codes

, 2012
Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For
Hong, Shaofang, Wu, Rongjun
core   +1 more source