相关论文: Ring-LWE Cryptography for the Number Theorist

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed…

The theory of Gromov-Hausdorff convergence is applied to sequences of quotient rings of integers. It is shown the existence of limit rings (fields) as the Gromov-Hausdorff limits of sequences of metric quotient rings. The relation of these…

Weber's conjecture (1886) governs three aspects of lattice-based cryptography: the solvability of the Principal Ideal Problem, the freeness of modules over rings of integers, and the tightness of worst-case-to-average-case reductions in…

With the increase in machine learning (ML) applications in different domains, incentives for deceiving these models have reached more than ever. As data is the core backbone of ML algorithms, attackers shifted their interest toward…

We give a polynomial time attack on the McEliece public key cryptosystem based on subcodes of algebraic geometry (AG) codes. The proposed attack reposes on the distinguishability of such codes from random codes using the Schur product.…

We study so called regular Lie algebras, i.e. Lie algebras in which each nonzero element is regular. We make a connection with an open problem whether any element of reduced trace zero in a simple associative algebra is a commutator.

We determine the structure of the Hodge ring, a natural object encoding the Hodge numbers of all compact Kaehler manifolds. As a consequence of this structure, there are no unexpected relations among the Hodge numbers, and no essential…

We give a new construction of the algebraic $K$-theory of small permutative categories that preserves multiplicative structure, and therefore allows us to give a unified treatment of rings, modules, and algebras in both the input and…

The perturbative analysis of models of open and closed superstrings presents a number of surprises. For instance, variable numbers of antisymmetric tensors ensure their consistency via generalized Green-Schwarz cancellations and a novel…

Rayleigh Schr\"{o}dinger perturbation theory corrections are developed for an algebraic Bethe ansatz of individual electrons. Numerical results are ambiguous and would need either an orbital optimization or a configuration interaction…

The aim of this paper is to prove the achievability of several coding problems by using sparse matrices (the maximum column weight grows logarithmically in the block length) and maximal-likelihood (ML) coding. These problems are the…

This note started out as a letter to J\"urgen Ritter and is brief attempt to entice some number theorists to study hom-Lie algebras.

Research in logic encryption over the last decade has resulted in various techniques to prevent different security threats such as Trojan insertion, intellectual property leakage, and reverse engineering. However, there is little agreement…

In previous papers of this series we analysed the reduced phase space approach to perturbations of Einstein-Maxwell theory to second order around spherically symmetric backgrounds in the Gullstrand Painlev\'e Gauge and confirmed consistency…

There are similarities between algebraic Lie theory and a geometric description of the blocks of the Brauer algebra in characteristic zero. Motivated by this, we study the alcove geometry of a certain reflection group action. We provide…

Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances are built over finite fields of large characteristic and…

Pre-trained language models (PLMs) have demonstrated remarkable performance as few-shot learners. However, their security risks under such settings are largely unexplored. In this work, we conduct a pilot study showing that PLMs as few-shot…

We prove nilpotency results for Lie algebras over an arbitrary field admitting a derivation, which satisfies a given polynomial identity $r(t)=0$. For the polynomial $r=t^n-1$ we obtain results on the nilpotency of Lie algebras admitting a…

we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of…