Related papers: Goldbach Ellipse Sequences for Cryptographic Appli…

We generalize the construction of elliptic stable envelopes to actions of connected reductive groups and give a direct inductive proof of their existence and uniqueness in a rather general situation. We show these have powerful enumerative…

This paper introduces the concept of necklace binomial coefficients motivated by the enumeration of a special type of sequences. Several properties of these coefficients are described, including a connection between their roots and an…

We present the notion of \emph{reasonable utility} for binary mechanisms, which applies to all utility functions in the literature. This notion induces a partial ordering on the performance of all binary differentially private (DP)…

This article presets a review of the achievements rapidly developing field of cryptography - public-key cryptography based on the lattice theory. Paper contains the necessary basic concepts and the major problems of the lattice theory, as…

Secret sharing schemes with optimal and universal communication overheads have been obtained independently by Bitar et al. and Huang et al. However, their constructions require a finite field of size q > n, where n is the number of shares,…

Elliptic curve cryptography (ECC) is foundational to modern secure communication, yet existing standard curves have faced scrutiny for opaque parameter-generation practices. This work introduces a Selmer-inspired framework for constructing…

Cryptography is the science of using mathematics to encrypt and decrypt data. Cryptography enables you to store sensitive information or transmit it across insecure networks so that it cannot be read by anyone except the intended recipient.…

This paper proposes a framework dedicated to the construction of what we call discrete elastic inner product allowing one to embed sets of non-uniformly sampled multivariate time series or sequences of varying lengths into inner product…

This paper introduces a novel cryptographic approach based on the continuous logarithm in the complex circle, designed to address the challenges posed by quantum computing. By leveraging its multi-valued and spectral properties, this…

We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…

The ability to hide information from unauthorized individuals has been a prevalent issue over the years. Countless algorithms such as DES, AES and SHA have been developed. These algorithms depend on varying key length and key management…

In this paper, a code-based public-key cryptosystem based on interleaved Goppa codes is presented. The scheme is based on encrypting several ciphertexts with the same Goppa code and adding a burst error to them. Possible attacks are…

We establish an algorithm to encrypt and decrypt messages, where messages can be seen as elements of a finite field, using of mutations in a cluster algebra finite type.

Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such models with respect to computational ones, is to explicitly…

Subfield subcodes of algebraic-geometric codes are good candidates for the use in post-quantum cryptosystems, provided their true parameters such as dimension and minimum distance can be determined. In this paper we present new values of…

In this paper we have shown that a double sequence in a topological space satisfies certain conditions which in turn are capable to generate a topology on a non empty set. Also we have used the idea of I-convergence of double sequences to…

This paper proposes, and demonstrates the efficacy of, an elementary method for establishing a lower bound for cardinalities of selected sets of twin primes, and shows that the proof employed may be modified for selected sets of Goldbach…

Homomorphic encryption is a sophisticated encryption technique that allows computations on encrypted data to be done without the requirement for decryption. This trait makes homomorphic encryption appropriate for safe computation in…

The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several signcryption schemes are proposed throughout the years, each…

This paper proposes the use of the binary primes sequence to strengthen pseudorandom (PN) decimal sequences for cryptography applications. The binary primes sequence is added to the PN decimal sequence (where one can choose from many…