Results 21 to 30 of about 242 (42)
On the leakage-resilient key exchange
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
Pl\"ucker Embedding of Cyclic Orbit Codes [PDF]
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
On linear codes with random multiplier vectors and the maximum trace dimension property
Let CC be a linear code of length nn and dimension kk over the finite field Fqm{{\mathbb{F}}}_{{q}^{m}}. The trace code Tr(C){\rm{Tr}}\left(C) is a linear code of the same length nn over the subfield Fq{{\mathbb{F}}}_{q}.
Erdélyi Márton +3 more
doaj +1 more source
Every Binary Self-Dual Code Arises From Hilbert Symbols
In this paper we construct binary self-dual codes using the \'etale cohomology of $\mathbb{Z}/2$ on the spectra of rings of $S$-integers of global fields.
Chinburg, Ted, Zhang, Ying
core +1 more source
This article aims to speed up (the precomputation stage of) multiscalar multiplication (MSM) on ordinary elliptic curves of j-invariant 0 with respect to specific “independent” (also known as “basis”) points.
Koshelev Dmitrii
doaj +1 more source
DAGS: Key encapsulation using dyadic GS codes
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 +12 more
doaj +1 more source
One- and Two-Point Codes over Kummer Extensions
We compute the Weierstrass semigroup at one totally ramified place for Kummer extensions defined by $y^m=f(x)^{\lambda}$ where $f(x)$ is a separable polynomial over $\mathbb{F}_q$.
Masuda, Ariane M. +2 more
core +1 more source
Predicate signatures from pair encodings via dual system proof technique
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
Some bounds for the relative generalized Hamming weights of some evaluation codes
In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree.
Sarabia Manuel González
doaj +1 more source
Further Results of the Cryptographic Properties on the Butterfly Structures
Recently, a new structure called butterfly introduced by Perrin et at. is attractive for that it has very good cryptographic properties: the differential uniformity is at most equal to 4 and algebraic degree is also very high when exponent $e=3$.
Feng, Xiutao, Fu, Shihui
core +1 more source

