English
Related papers

Related papers: Trilinear maps for cryptography

200 papers

This article describes a lightweight additive homomorphic algorithm with the same encryption and decryption keys. Compared to standard additive homomorphic algorithms like Paillier, this algorithm reduces the computational cost of…

Cryptography and Security · Computer Science 2024-04-03 Wuqiong Pan , Hongliang Gu

Tropical linear algebra has been recently put forward by Grigoriev and Shpilrain as a promising platform for implementation of protocols of Diffie-Hellman and Stickel type. Based on the CSR expansion of tropical matrix powers, we suggest a…

Combinatorics · Mathematics 2022-07-11 Any Muanalifah , Sergei Sergeev

We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…

Algebraic Geometry · Mathematics 2019-09-17 János Nagy , András Némethi

In this paper we model a class of stream and block ciphers as systems of (ordinary) explicit difference equations over a finite field. We call this class "difference ciphers" and we show that ciphers of application interest, as for example…

Cryptography and Security · Computer Science 2022-01-10 Roberto La Scala , Sharwan K. Tiwari

This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…

Rings and Algebras · Mathematics 2026-03-05 Kobiljon Abdurasulov , Maqpal Eraliyeva , Ivan Kaygorodov

We compute Seidel's mirror map for abelian varieties by constructing the homogeneous coordinate rings from the Fukaya category of the symplectic mirrors. The computations are feasible as only linear holomorphic disks contribute to the…

Symplectic Geometry · Mathematics 2025-02-18 Marco Aldi , Eric Zaslow

We introduce the notion of a logarithmic stable map from a minimal log prestable curve to a log twisted semi-stable variety of form $xy=0$. We study the compactification of the moduli spaces of such maps and provide a perfect obstruction…

Algebraic Geometry · Mathematics 2009-01-20 Bumsig Kim

This text answers a question raised by Joux and the second author about the computation of discrete logarithms in the multiplicative group of finite fields. Given a finite residue field $\bK$, one looks for a smoothness basis for $\bK^*$…

Number Theory · Mathematics 2008-02-05 Jean-Marc Couveignes , Reynald Lercier

The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms-including Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS) multiplication, as well as…

Number Theory · Mathematics 2013-10-22 Benjamin Smith

It has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by…

Commutative Algebra · Mathematics 2015-09-11 Thomas Kahle , Robert Krone , Anton Leykin

Let A be a supersingular abelian variety over a finite field k. We give an approximate description of the structure of the group A(k) of rational points of A over k in terms of the characteristic polynomial f of the Frobenius endomorphism…

Number Theory · Mathematics 2007-05-23 Hui Zhu

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…

Cryptography and Security · Computer Science 2019-02-18 Uddipana Dowerah , Srinivasan Krishnaswamy

For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…

Number Theory · Mathematics 2020-08-25 Robert Granger , Thorsten Kleinjung , Jens Zumbrägel

Most classical and post-quantum cryptographic assumptions, including integer factorization, discrete logarithms, and Learning with Errors (LWE), rely on algebraic structures such as rings or vector spaces. While mathematically powerful,…

Cryptography and Security · Computer Science 2025-05-29 Mohamed Aly Bouke

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Computational Complexity · Computer Science 2020-05-21 Jeffrey Finkelstein

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…

Number Theory · Mathematics 2009-07-02 H. Gopalkrishna Gadiyar , K M Sangeeta Maini , R. Padma , Mario Romsy

This paper determines all the possible endomorphism algebras for polarizable Q-Hodge structures of type (n,0,...,0,n). This generalizes the classification of the possible endomorphism algebras of abelian varieties by Albert and Shimura. As…

Algebraic Geometry · Mathematics 2014-02-18 Burt Totaro

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini

Let A be a modular abelian variety over \Q of arbitrary even dimension. We establish criteria to prevent a given quaternion algebra over a totally real number field to be the endomorphism algebra of A over \bar\Q. We accomplish this by…

Number Theory · Mathematics 2008-04-30 Victor Rotger

We introduce and study modular truncations of the Ackermann function viewed as self-maps on finite rings. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural…

Combinatorics · Mathematics 2026-03-27 Jean-Christophe Pain
‹ Prev 1 8 9 10 Next ›