Ternary public-key cryptosystem

• URL: http://arxiv.org/abs/2606.07832v1
• Date: Fri, 05 Jun 2026 20:45:41 GMT
• Title: Ternary public-key cryptosystem
• Abstract summary: We generalize the public-key cryptosystems to ternary algebraic structures.<n>We derive explicit ternary power and querelement formulas that enable correct decryption.
• Score: 3.0860863056832826
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Public-key cryptosystems eliminate the requirement for pre-shared secret keys by enabling encryption with a publicly disclosed key and decryption with a corresponding private key. In this article we generalize the public-key cryptosystems to ternary algebraic structures, with particular attention to ElGamal as a representative family. We introduce the necessary algebraic background for nonderived ternary structures, including special elements, ternary group rings, and a matrix ternarization procedure that maps binary rings and group rings to antidiagonal symbolic matrices closed under ternary multiplication. Building on these foundations, we formulate a ternary analogue of the ElGamal three-step protocol (key generation, ephemeral encryption, and decryption via querelements) and derive explicit ternary power and querelement formulas that enable correct decryption. Concrete instantiations and numerical examples over a ternary fraction field, a matrix-ternarized finite group ring, and a finite \((6,3)\)-ring (field) validate the construction and illustrate admissible word-length quantization and cycle behaviour of ternary powers. The ternary framework highlights two practical advantages: richer algebraic structure (querelements replace binary inverses) that increases algebraic complexity for attackers, and higher information density (matrix ternarization transfers paired/plaintext vectors). Formal hardness assumptions, optimized parameter choices, and comprehensive security and performance analyses remain necessary future work.

Related papers

• Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Homomorphic Encryption naturally fits the client--aggregator communication pattern of Federated Learning.<n>We propose lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption.<n>Our results show that the proposed approach substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
  arXiv  Detail & Related papers  (2026-09-01T23:21:48Z)
• Tensor--Action Ko--Lee Cryptography: A Framework and Structural Cryptanalysis of Commuting Subgroup Constructions [4.793124350155299]
  We formulate a Ko--Lee-style framework for public-key encryption from cubic tensor actions.<n>We show that the framework is generically insecure when commuting matrix subgroups are given by public finite generating sets.<n>The contribution is therefore a framework proposal together with its cryptanalysis; it does not provide a secure public-key encryption scheme.
  arXiv  Detail & Related papers  (2026-08-15T04:32:02Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• Cryptographic transformations over polyadic rings [3.0860863056832826]
  cryptosystems rely on binary operations within groups, rings, or fields.<n>We propose a shift to polyadic rings, which generalize classical rings by allowing operations of higher arity.<n>We present two concrete encryption procedures that leverage this structure.
  arXiv  Detail & Related papers  (2025-12-14T07:15:55Z)
• Decryption Through Polynomial Ambiguity: Noise-Enhanced High-Memory Convolutional Codes for Post-Quantum Cryptography [0.0]
  We present a novel approach to post-quantum cryptography that employs directed decryption of noise-enhanced high-memory convolutional codes.<n>The proposed generates random-like generator matrices that effectively conceal and resist structural attacks.
  arXiv  Detail & Related papers  (2025-12-02T14:30:03Z)
• MST3 Encryption improvement with three-parameter group of Hermitian function field [0.0]
  This work presents an advanced cryptographic framework utilizing automorphism groups as the foundational structure for encryption scheme implementation.<n>A key innovation in this implementation is utilizing the Hermitian function field as the underlying mathematical framework.<n>The encryption mechanism features phased key de-encapsulation from ciphertext, representing a substantial advantage over alternative implementations.
  arXiv  Detail & Related papers  (2025-04-21T18:58:42Z)
• New Permutation Decomposition Techniques for Efficient Homomorphic Permutation [33.30918602217202]
  Homomorphic permutation is fundamental to privacy-preserving computations based on batch-encoding homomorphic encryption.<n>We propose novel decomposition techniques to optimize homomorphic permutations, advancing homomorphic encryption-based privacy-preserving computations.<n>We design a network structure that deviates from the conventional scope of decomposition and outperforms the state-of-the-art technique with a speed-up of up to $1.69times$ under a minimal rotation key requirement.
  arXiv  Detail & Related papers  (2024-10-29T08:07:22Z)
• QPP and HPPK: Unifying Non-Commutativity for Quantum-Secure Cryptography with Galois Permutation Group [0.0]
  We leverage two novel primitives: the Quantum Permutation Pad (QPP) for symmetric key encryption and the Homomorphic Polynomial Public Key (HPPK) for Key Encapsulation Mechanism (KEM) and Digital Signatures (DS) QPP achieves quantum-secure symmetric key encryption, seamlessly extending Shannon's perfect secrecy to both classical and quantum-native systems. HPPK, free from NP-hard problems, fortifies symmetric encryption for the plain public key.
  arXiv  Detail & Related papers  (2024-02-02T19:10:43Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Secret Key Agreement with Physical Unclonable Functions: An Optimality Summary [29.438154152702758]
  A physical unclonable function (PUF) is a promising solution for local security in digital devices. Low-complexity signal processing methods are discussed to make the information-theoretic analysis tractable. Proposed optimal code constructions that jointly design the vector quantizer and error-correction code parameters are listed.
  arXiv  Detail & Related papers  (2020-12-16T13:21:20Z)
• Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers [0.0]
  We cast encryption via classical block ciphers in terms of operator spreading in a dual space of Pauli strings. We quantify the quality of ciphers using measures of delocalization in string space.
  arXiv  Detail & Related papers  (2020-11-12T18:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.