Related papers: Trilinear maps for cryptography II

Confidentiality and Integrity are two paramount objectives in the evaluation of information and communication technology. In this paper, we propose an arithmetic approach for designing asymmetric key cryptography. Our method is based on the…

In this PhD thesis we develop the frame work of triple crossing diagram maps (TCD maps), which describes constrained configurations of points in projective spaces and discrete dynamics on these configurations. We are able to capture the…

Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…

There is a well known theorem by Deuring which gives a criterion for when the reduction of an elliptic curve with complex multiplication (CM) by the ring of integers of an imaginary quadratic field has ordinary or supersingular reduction.…

In this paper, we investigate a class of Collatz-like problems associated with weakly and strongly admissible triplets of integers. This framework extends the classical Collatz mapping, providing a systematic method for generating triplets…

Persistence diagrams (PDs), often characterized as sets of death and birth of homology class, have been known for providing a topological representation of a graph structure, which is often useful in machine learning tasks. Prior works rely…

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using Shor polynomial time algorithm for numerical field problems or Grover search algorithm. A mostly overlooked but valuable line of solutions…

Suppose that X is a complex projective variety and L is a pseudo-effective divisor. A numerical reduction map is a quotient of X by all subvarieties along which L is numerically trivial. We construct two variants: the L-trivial reduction…

In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of…

For a complex projective manifold, Walker has defined a regular homomorphism lifting Griffiths' Abel-Jacobi map on algebraically trivial cycle classes to a complex abelian variety, which admits a finite homomorphism to the Griffiths…

Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…

Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…

Short Weierstrass's elliptic curves with underlying hard Elliptic Curve Discrete Logarithm Problems was widely used in Cryptographic applications. This paper introduces a new security notation 'trusted security' for computation methods of…

We propose an approach for constructing secret and private keys based on the long-known Slepian-Wolf code, due to Wyner, for correlated sources connected by a virtual additive noise channel. Our work is motivated by results of Csisz\'ar and…

Privacy is become major issue in distributed data mining. In the literature we can found many proposals of privacy preserving which can be divided into two major categories that is trusted third party and multiparty based privacy protocols.…

In this paper, algorithms for multivariate public key cryptography and digital signature are described. Plain messages and encrypted messages are arrays, consisting of elements from a fixed finite ring or field. The encryption and…

We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic…

The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph…

Multivariate Cryptography is one of the candidates for Post-quantum Cryptography. Multivariate schemes are usually constructed by applying two secret affine invertible transformations $\mathcal S,\mathcal T$ to a set of multivariate…

This paper is the third installment in a series of papers devoted to the computation of enumerative invariants of abelian surfaces through the tropical approach. We develop a pearl diagram algorithm similar to the floor diagram algorithm…