Related papers: Cryptographic transformations over polyadic rings
Based on the controlled order rearrange encryption (CORE) for quantum key distribution using EPR pairs[Fu.G.Deng and G.L.Long Phys.Rev.A68 (2003) 042315], we propose the generalized controlled order rearrangement encryption (GCORE)…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
We propose public-key cryptosystems with public key a system of polynomial equations, algebraic or differential, and private key a single polynomial or a small-size ideal. We set up probabilistic encryption, signature, and signcryption…
New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this…
We present a study on the use of Pell hyperbolas in cryptosystems with security based on the discrete logarithm problem. Specifically, after introducing the group's structure over generalized Pell conics (and also giving the explicit…
The work offers a new approach to the formation of functions which are used in cryptography and cryptanalysis. It will use alternative forms of representation of Boolean functions, that is, those which are different from the classical form,…
Caesar cipher is an ancient, elementary method of encrypting plain text message to protect it from adversaries. However, with the advent of powerful computers there is a need for increasing the complexity of such algorithms. In this paper,…
We analyze the Sibert et al. group-based (Feige-Fiat-Shamir type) authentication protocol and show that the protocol is not computationally zero-knowledge. In addition, we provide experimental evidence that our approach is practical and can…
The MOR cryptosystem is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a $p$-group, a cryptosystem was built by this author in 'A simple generalization of El-Gamal cryptosystem to non-abelian groups'. It…
The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic versions of it have been proposed recently, such as those in the…
We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use…
Attribute-based encryption (ABE) which allows users to encrypt and decrypt messages based on user attributes is a type of one-to-many encryption. Unlike the conventional one-to-one encryption which has no intention to exclude any partners…
Since 1870s, scientists have been taking deep insight into Lie groups and Lie algebras. With the development of Lie theory, Lie groups have got profound significance in many branches of mathematics and physics. In Lie theory, exponential…
In 2021, the $p$-adic signature scheme and public-key encryption cryptosystem were introduced. These schemes have good efficiency but are shown to be not secure. The attack succeeds because the extension fields used in these schemes are…
In this paper we study a quadratic Poisson algebra structure on the space of bilinear forms on $C^{N}$ with the property that for any $n,m\in N$ such that $n m =N$, the restriction of the Poisson algebra to the space of bilinear forms with…
The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such…
A new framework for interference alignment in secure and private information retrieval (PIR) from colluding servers is proposed, generalizing the original cross-subspace alignment (CSA) codes proposed by Jia, Sun, and Jafar. The general…