Related papers: Trilinear maps for cryptography II

We introduce a common generalization of essentially all known methods for explicit computation of Selmer groups, which are used to bound the ranks of abelian varieties over global fields. We also simplify and extend the proofs relating what…

This paper presents explicit constructions of bases for Riemann-Roch spaces associated with arbitrary divisors on elliptic curves. In the context of algebraic geometry codes, the knowledge of an explicit basis for arbitrary divisors is…

In this paper, we propose to use a twisted dihedral group algebra for public-key cryptography. For this, we introduce a new $2$-cocycle $\alpha_{\lambda}$ to twist the dihedral group algebra. Using the ambient space…

In antiquity, the seal embodied trust, secrecy, and integrity in safeguarding the exchange of letters and messages. The purpose of this work is to continue this tradition in the contemporary era, characterized by the presence of quantum…

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…

In this work we study, in greater detail than before, J.H. Conway's topographs for integral binary quadratic forms. These are trees in the plane with regions labeled by integers following a simple pattern. Each topograph can display the…

The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

In his famous book ``Basic Number Theory", Weil proved several theorems about the existence of norm-orthogonal bases in finite-dimensional vector spaces and lattices over local fields. In this paper, we transform Weil's proofs into…

We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a…

For each object in a tensor triangulated category, we construct a natural continuous map from the object's support---a closed subset of the category's triangular spectrum---to the Zariski spectrum of a certain commutative ring of…

Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce…

We define and study the Weil pairing on the moduli of twisted curves. If $X$ is a twisted curve, then we can combinatorially describe a certain subgroup and a quotient group of $\text{Pic}(X)[2]$ that are Weil dual. Moreover, the pairing…

We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n >= 2. Our approach is based on the problem of computing isogenies between isogenous elliptic curves, which is…

We present a structural attack on the DME cryptosystem with paramenters (3,2,q). The attack recovers 10 of the 12 coefficients of the first linear map. We also show that, if those 12 coefficients were known, the rest of the private key can…

For a cubic hypersurface $X$, work of Galkin--Shinder and Voisin shows the existence of a birational map relating the Hilbert scheme of two points $X^{[2]}$ with a certain projective bundle over $X$. Belmans--Fu--Raedschelders show that…

The advent of isogeometric analysis has prompted a need for methods to generate Trivariate B-spline Solids (TBS) with positive Jacobian. However, it is difficult to guarantee a positive Jacobian of a TBS since the geometric pre-condition…

Hashing methods have been widely used for applications of large-scale image retrieval and classification. Non-deep hashing methods using handcrafted features have been significantly outperformed by deep hashing methods due to their better…

Let k be an algebraically closed field of characteristic two. Let R be the ring of Witt vectors of length two over k. We construct a group stack \hat G over k, the metaplectic extension of the Greenberg realization of Sp_{2n}(R). We also…

In this paper we consider cryptographic applications of the arithmetic on the hyperoctahedral group. On an appropriate subgroup of the latter, we particularly propose to construct public key cryptosystems based on the discrete logarithm.…