Related papers: A Miniature CCA2 Public key Encryption scheme base…
These are expanded notes from graduate courses about Lie algebras and Chevalley groups held at the University of Stuttgart. In the 1950s Chevalley showed how linear groups over arbitrary fields could be obtained~ -- ~by a uniform procedure~…
We theoretically propose a symmetric encryption scheme based on Restricted Boltzmann Machines that functions as a probabilistic Enigma device, encoding information in the marginal distributions of visible states while utilizing bias…
In this paper we see the evolution of a capitalized financial event e, with respect to a capitalization factor f, as the exponential map of a suitably defined Lie group G(f,e), supported by the half-space of capitalized financial events…
An infinite-dimensional Lie Algebra is proposed which includes, in its subalgebras and limits, most Lie Algebras routinely utilized in physics. It relies on the finite oscillator Lie group, and appears applicable to twisted noncommutative…
In 1974, Ralph Merkle proposed the first unclassified scheme for secure communications over insecure channels. When legitimate communicating parties are willing to spend an amount of computational effort proportional to some parameter N, an…
We generalize the common notion of descending and ascending central series. The descending approach determines a naturally graded Lie ring and the ascending version determines a graded module for this ring. We also link derivations of these…
In this paper we use the nonrepresentable ring E_p(m)to introduce public key cryptosystems in noncommutative settings and based on the Semigrouop Action Problem and the Decomposition Problem respectively.
In this survey we discuss a wide variety of aspects related to Lie group integrators. These numerical integration schemes for differential equations on manifolds have been studied in a general and systematic manner since the 1990s and the…
We introduce a new approach to computation on encrypted data -- Encrypted Operator Computing (EOC) -- as an alternative to Fully Homomorphic Encryption (FHE). Given a plaintext vector $|{x}\rangle$, $x\in \{0,1\}^n$, and a function $F(x)$…
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement…
In this paper we build a set of parametric quotient Lie group structures on the probabilistic simplex that can be extended to real vector space structures. In particular, we rediscover the main mathematical objects generally used when…
Known key exchange schemes offering information-theoretic (unconditional) security are complex and costly to implement. Nonetheless, they remain the only known methods for achieving unconditional security in key exchange. Therefore, the…
We obfuscate words of a given length in a free monoid on two generators with a simple factorization algorithm (namely $SL_2(\mathbb{N})$) to create a public-key encryption scheme. We provide a reference implementation in Python and…
In this article, we have proposed a public key cryptography using Affine-Hill cipher with a generalized Fibonacci matrix(called multinacci matrix). Also proposed a key establishment(exchange of key matrix $K=Q_{\lambda}^{k}$ of order…
Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the…
In this paper we extend the Lie theory of integration in two different ways. First we consider a finite dimensional Lie algebra of vector fields and discuss the most general conditions under which the integral curves of one of the fields…
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…
The Bayesian Learning Rule provides a framework for generic algorithm design but can be difficult to use for three reasons. First, it requires a specific parameterization of exponential family. Second, it uses gradients which can be…
Quantum mechanics of Hamiltonian (non-dissipative) systems uses Lie algebra and analytic group (Lie group). In order to describe non-Hamiltonian (dissipative) systems in quantum theory we need to use non-Lie algebra and analytic quasigroup…
This paper presents a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. One of the key ingredients used to resist eavesdropping in this scheme is to depolarize all Pauli…