Secure Text Mail Encryption with Generative Adversarial Networks

• URL: http://arxiv.org/abs/2504.07140v2
• Date: Mon, 14 Apr 2025 10:48:41 GMT
• Title: Secure Text Mail Encryption with Generative Adversarial Networks
• Authors: Alexej Schelle,
• Abstract summary: We present an encryption model based on Generative Adversarial Networks (GANs)<n>We assert that encrypted texts can be transmitted more efficiently and securely than from RSA encryption.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work presents an encryption model based on Generative Adversarial Networks (GANs). Encryption of RTF-8 data is realized by dynamically generating decimal numbers that lead to the encryption and decryption of alphabetic strings in integer representation by simple addition rules, the modulus of the dimension of the considered alphabet. The binary numbers for the private dynamic keys correspond to the binary numbers of public reference keys, as defined by a specific GAN configuration. For reversible encryption with a bijective mapping between dynamic and reference keys, as defined by the GAN encryptor, secure text encryption can be achieved by transferring a GAN-encrypted public key along with the encrypted text from a sender to a receiver. Using the technique described above, secure text mail transfer can be realized through component-wise encryption and decryption of text mail strings, with total key sizes of up to $10^{8}$ bits that define random decimal numbers generated by the GAN. From the present model, we assert that encrypted texts can be transmitted more efficiently and securely than from RSA encryption, as long as users of the specific configuration of the GAN encryption model are unaware of the GAN encryptor circuit and configuration, respectively.

Related papers

• An End-to-End GSM/SMS Encrypted Approach for Smartphone Employing Advanced Encryption Standard(AES) [0.0]
  We proposed methodology that enables users to encrypt text messages for secure transmission over cellular networks.<n>This approach utilizes the AES algorithm following the proposed protocols for encryption and decryption.<n>It ensures secure text encryption and enables users to enter messages that are encrypted using a key at the sender's end and decrypted at the recipient's end.
  arXiv  Detail & Related papers  (2025-03-24T16:33:45Z)
• 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)
• The Evolution of Cryptography through Number Theory [55.2480439325792]
  cryptography began around 100 years ago, its roots trace back to ancient civilizations like Mesopotamia and Egypt. This paper explores the link between early information hiding techniques and modern cryptographic algorithms like RSA.
  arXiv  Detail & Related papers  (2024-11-11T16:27:57Z)
• A Machine Learning-Based Framework for Assessing Cryptographic Indistinguishability of Lightweight Block Ciphers [1.5953412143328967]
  Indistinguishability is a fundamental principle of cryptographic security, crucial for securing data transmitted between Internet of Things (IoT) devices. This research investigates the ability of machine learning (ML) in assessing indistinguishability property in encryption systems. We introduce MIND-Crypt, a novel ML-based framework designed to assess the cryptographic indistinguishability of lightweight block ciphers.
  arXiv  Detail & Related papers  (2024-05-30T04:40:13Z)
• 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)
• Exact Homomorphic Encryption [0.0]
  This article proposes a framework dubbed Exact Homomorphic Encryption, EHE, enabling exact computations on encrypted data without the need for pre-decryption. Two fundamental traits of quantum gates, invertibility and the noncommutativity, establish the success of EHE.
  arXiv  Detail & Related papers  (2024-01-17T07:48:52Z)
• RiDDLE: Reversible and Diversified De-identification with Latent Encryptor [57.66174700276893]
  This work presents RiDDLE, short for Reversible and Diversified De-identification with Latent Encryptor. Built upon a pre-learned StyleGAN2 generator, RiDDLE manages to encrypt and decrypt the facial identity within the latent space.
  arXiv  Detail & Related papers  (2023-03-09T11:03:52Z)
• 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)
• Device-independent uncloneable encryption [0.0]
  We introduce a variant of uncloneable encryption in which several possible decryption keys can decrypt a particular encryption.<n>We show that this variant of uncloneable encryption can be achieved device-independently.<n>We show that a simple modification of our scheme yields a single-decryptor encryption scheme.
  arXiv  Detail & Related papers  (2022-10-03T16:17:01Z)
• Enhancing Networking Cipher Algorithms with Natural Language [0.0]
  Natural language processing is considered as the weakest link in a networking encryption model. This paper summarizes how languages can be integrated into symmetric encryption as a way to assist in the encryption of vulnerable streams.
  arXiv  Detail & Related papers  (2022-06-22T09:05:52Z)
• HERS: Homomorphically Encrypted Representation Search [56.87295029135185]
  We present a method to search for a probe (or query) image representation against a large gallery in the encrypted domain. Our encryption scheme is agnostic to how the fixed-length representation is obtained and can therefore be applied to any fixed-length representation in any application domain.
  arXiv  Detail & Related papers  (2020-03-27T01:10:54Z)

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.