Results 61 to 70 of about 706 (71)

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

Affine Cartesian codes with complementary duals

, 2018
A linear code $C$ with the property that $C \cap C^{\perp} = \{0 \}$ is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD.
López, Hiram H., Manganiello, Felice, Matthews, Gretchen L.   +2 more
core  

On the leakage-resilient key exchange

Journal of Mathematical Cryptology, 2017
Typically, secure channels are constructed from an authenticated key exchange (AKE) protocol, which authenticates the communicating parties based on long-term public keys and establishes secret session keys.
Alawatugoda Janaka
doaj   +1 more source

DAGS: Key encapsulation using dyadic GS codes

Journal of Mathematical Cryptology, 2018
Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo, Barreto Paulo S. L. M., Boidje Brice Odilon, Cayrel Pierre-Louis, Dione Gilbert Ndollane, Gaj Kris, Gueye Cheikh Thiécoumba, Haeussler Richard, Klamti Jean Belo, N’diaye Ousmane, Nguyen Duc Tri, Persichetti Edoardo, Ricardini Jefferson E.   +12 more
doaj   +1 more source

The condition number associated with ideal lattices from odd prime degree cyclic number fields

Journal of Mathematical Cryptology
The condition number of a generator matrix of an ideal lattice derived from the ring of integers of an algebraic number field is an important quantity associated with the equivalence between two computational problems in lattice-based cryptography, the ...
de Araujo Robson Ricardo
doaj   +1 more source

Smaller public keys for MinRank-based schemes

Journal 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

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

On the normality of <i>p</i>-ary bent functions. [PDF]

Cryptogr Commun, 2018
Meidl W, Pirsic Í.
europepmc   +1 more source

On tiny-probability lattice enumeration. [PDF]

Jpn J Ind Appl Math
Aono Y, Nguyen PQ.
europepmc   +1 more source

CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist. [PDF]

Des Codes Cryptogr
Katsumata S, Lai YF, LeGrow JT, Qin L.
europepmc   +1 more source