Encryption scheme based on Automorphism Group of Hermitian Function Field with Homomorphic Encryption
- URL: http://arxiv.org/abs/2504.10747v1
- Date: Mon, 14 Apr 2025 22:39:40 GMT
- Title: Encryption scheme based on Automorphism Group of Hermitian Function Field with Homomorphic Encryption
- Authors: Gennady Khalimov, Yevgen Kotukh,
- Abstract summary: We enhance the Hermitian function field-based encryption scheme with homomorphic encryption capabilities.<n>Both the attack complexity and the encrypted message size are directly correlated with the order of the group.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This article proposes a comprehensive approach to implementing encryption schemes based on the automorphism group of the Hermitian function field. We utilize a three-parameter group with logarithmic representations outside the group's center. In this work, we enhance the Hermitian function field-based encryption scheme with homomorphic encryption capabilities, which constitutes a significant advantage of our implementation. Both the attack complexity and the encrypted message size are directly correlated with the order of the group.
Related papers
- Secured Encryption scheme based on the Ree groups [0.0]
An improved design of a cryptosystem based on small Ree groups is proposed.
We have changed the encryption algorithm and propose to use a logarithmic signature for the entire Ree group.
arXiv Detail & Related papers (2025-04-24T20:21:02Z) - 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.
A key innovation in this implementation is utilizing the Hermitian function field as the underlying mathematical framework.
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) - Advanced MST3 Encryption scheme based on generalized Suzuki 2-groups [0.0]
This article presents a method for enhancing the encryption algorithm in the MST3 cryptosystem for generalized Suzuki 2-groups.
In our approach, the logarithmic signature extends across the entire group, with cipher security dependent on the group order.
arXiv Detail & Related papers (2025-04-16T06:32:45Z) - Improved MST3 Encryption scheme based on small Ree groups [0.0]
This article presents an encryption scheme based on the small Ree groups.<n>We propose utilizing the small Ree group structure to enhance the overall security parameters of the encryption scheme.
arXiv Detail & Related papers (2025-04-15T07:51:56Z) - Cryptographic Strengthening of MST3 cryptosystem via Automorphism Group of Suzuki Function Fields [0.0]
The article describes a new implementation of MST3 cryptosystems based on the automorphism group of the Suzuki function field.<n>The complexity of cryptanalysis and the size of the message for encryption squared is higher than that of the MST3 cryptosystem in the Suzuki group.
arXiv Detail & Related papers (2025-04-09T22:37:08Z) - Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
arXiv Detail & Related papers (2025-01-25T04:53:36Z) - Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
arXiv Detail & Related papers (2025-01-17T13:26:14Z) - Symmetric Encryption Scheme Based on Quasigroup Using Chained Mode of Operation [1.4249472316161877]
We propose a novel construction for a symmetric encryption scheme, referred as SEBQ.
We utilize concepts of chaining like mode of operation and present a block cipher with in-built properties.
arXiv Detail & Related papers (2024-08-08T14:39:51Z) - CodeChameleon: Personalized Encryption Framework for Jailbreaking Large
Language Models [49.60006012946767]
We propose CodeChameleon, a novel jailbreak framework based on personalized encryption tactics.
We conduct extensive experiments on 7 Large Language Models, achieving state-of-the-art average Attack Success Rate (ASR)
Remarkably, our method achieves an 86.6% ASR on GPT-4-1106.
arXiv Detail & Related papers (2024-02-26T16:35:59Z) - Constructing a fully homomorphic encryption scheme with the Yoneda Lemma [0.0]
The paper redefines the foundations of asymmetric cryptography's homomorphic cryptosystems through the application of the Yoneda Lemma.<n>It demonstrates that widely adopted systems, including ElGamal, RSA, Benaloh, Regev's LWE, and NTRUEncrypt, are directly derived from the principles of the Yoneda Lemma.<n>This synthesis leads to the creation of a holistic homomorphic encryption framework, the Yoneda Encryption Scheme.
arXiv Detail & Related papers (2024-01-24T06:46:26Z) - 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) - LieTransformer: Equivariant self-attention for Lie Groups [49.9625160479096]
Group equivariant neural networks are used as building blocks of group invariant neural networks.
We extend the scope of the literature to self-attention, that is emerging as a prominent building block of deep learning models.
We propose the LieTransformer, an architecture composed of LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
arXiv Detail & Related papers (2020-12-20T11:02:49Z) - Invariant Feature Coding using Tensor Product Representation [75.62232699377877]
We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier.
A novel feature model that explicitly consider group action is proposed for principal component analysis and k-means clustering.
arXiv Detail & Related papers (2019-06-05T07:15:17Z)
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.