Cryptography: Against AI and QAI Odds

• URL: http://arxiv.org/abs/2309.07022v1
• Date: Wed, 13 Sep 2023 15:29:52 GMT
• Title: Cryptography: Against AI and QAI Odds
• Abstract summary: AI and quantum computers pose a catastrophic threat to modern cryptography. The supremacy of AI can be challenged by creating ciphertexts that would give the AI attacker erroneous responses. Strategy against AI odds is feasible by implementing non-algorithmic randomness.
• Score: 0.49157446832511503
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Artificial Intelligence (AI) presents prodigious technological prospects for development, however, all that glitters is not gold! The cyber-world faces the worst nightmare with the advent of AI and quantum computers. Together with Quantum Artificial Intelligence (QAI), they pose a catastrophic threat to modern cryptography. It would also increase the capability of cryptanalysts manifold, with its built-in persistent and extensive predictive intelligence. This prediction ability incapacitates the constrained message space in device cryptography. With the comparison of these assumptions and the intercepted ciphertext, the code-cracking process will considerably accelerate. Before the vigorous and robust developments in AI, we have never faced and never had to prepare for such a plaintext-originating attack. The supremacy of AI can be challenged by creating ciphertexts that would give the AI attacker erroneous responses stymied by randomness and misdirect them. AI threat is deterred by deviating from the conventional use of small, known-size keys and pattern-loaded ciphers. The strategy is vested in implementing larger secret size keys, supplemented by ad-hoc unilateral randomness of unbound limitations and a pattern-devoid technique. The very large key size can be handled with low processing and computational burden to achieve desired unicity distances. The strategy against AI odds is feasible by implementing non-algorithmic randomness, large and inexpensive memory chips, and wide-area communication networks. The strength of AI, i.e., randomness and pattern detection can be used to generate highly optimized ciphers and algorithms. These pattern-devoid, randomness-rich ciphers also provide a timely and plausible solution for NIST's proactive approach toward the quantum challenge.

Related papers

• AI-Accelerated Brute Force Cryptanalysis [0.0]
  AI can de-flatten the probability curve over the remaining key space.<n>The more spiked this curve, the faster the ciphertext is defeated.<n>NIST PQC is not immunized against AI-Accelerated Brute Force attack.
  arXiv  Detail & Related papers  (2026-05-09T04:57:40Z)
• Securing Cryptography in the Age of Quantum Computing and AI: Threats, Implementations, and Strategic Response [3.4562767039451674]
  RSA and elliptic curve cryptography are at risk of compromise from quantum computers.<n> lattice-based algorithms resist known quantum attacks but require careful implementation to prevent side-channel leakage.<n>Hash-based signatures provide conservative security with signature sizes ranging from 17 to 50 KB.
  arXiv  Detail & Related papers  (2026-03-07T01:07:35Z)
• Equilibrium SAT based PQC: New aegis against quantum computing [0.0]
  This paper introduces a novel public-key cryptography algorithm that generates ciphertexts by counting the number of elements in randomly extracted subsets from a multiset.<n>The advantages of the proposed algorithm are: first, it is significantly faster than other public-key algorithms; second, it does not require big numbers, making it executable on any devices; and third, it can be easily extended into a public-key cryptosystem using a single public key and multiple private keys while maintaining quantum resistance.
  arXiv  Detail & Related papers  (2025-12-02T10:05:06Z)
• All Code, No Thought: Current Language Models Struggle to Reason in Ciphered Language [4.658955683408114]
  Chain-of-thought (CoT) monitoring is one method widely used to detect adversarial attacks and AI misalignment.<n>Attackers and misaligned models might evade CoT monitoring through ciphered reasoning.<n>We test whether models can perform encrypted ciphered reasoning.
  arXiv  Detail & Related papers  (2025-10-10T06:01:22Z)
• Efficient Decoding Methods for Language Models on Encrypted Data [32.58944595512403]
  Homomorphic encryption (HE) enables computation on encrypted data for secure inference.<n>Neural text generation requires decoding methods like argmax and sampling, which are non-polynomial and thus computationally expensive under encryption.<n>We introduce cutmax, an HE-friendly argmax algorithm that reduces cipher operations compared to prior methods, enabling practical greedy decoding under encryption.
  arXiv  Detail & Related papers  (2025-09-10T08:23:14Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• SuperARC: An Agnostic Test for Narrow, General, and Super Intelligence Based On the Principles of Recursive Compression and Algorithmic Probability [0.14061979259370275]
  We introduce an open-ended test grounded in algorithmic probability. It can avoid benchmark contamination in the quantitative evaluation of frontier models. We prove that compression is equivalent and directly proportional to a system's predictive power.
  arXiv  Detail & Related papers  (2025-03-20T23:11:30Z)
• Cyber Threats in Financial Transactions -- Addressing the Dual Challenge of AI and Quantum Computing [0.0]
  Financial sector faces escalating cyber threats amplified by artificial intelligence (AI) and the advent of quantum computing. Report analyzes these threats, relevant frameworks, and possible countermeasures like quantum cryptography. Financial industry must adopt a proactive and adaptive approach to cybersecurity.
  arXiv  Detail & Related papers  (2025-03-19T20:16:27Z)
• Transformers -- Messages in Disguise [3.74142789780782]
  NN based cryptography is being investigated due to its ability to learn and implement random cryptographic schemes. R is comprised of three new NN layers: the (i) projection layer, (ii) inverse projection layer, and (iii) dot-product layer. This results in an ANC network that (i) is computationally efficient, (ii) ensures the encrypted message is unique, and (iii) does not induce any communication overhead.
  arXiv  Detail & Related papers  (2024-11-15T15:42:29Z)
• OML: Open, Monetizable, and Loyal AI [39.63122342758896]
  We propose OML, which stands for Open, Monetizable, and Loyal AI. OML is an approach designed to democratize AI development. Key innovation of our work is introducing a new scientific field: AI-native cryptography.
  arXiv  Detail & Related papers  (2024-11-01T18:46:03Z)
• Lightweight Public Key Encryption in Post-Quantum Computing Era [0.0]
  Confidentiality in our digital world is based on the security of cryptographic algorithms. In the course of technological progress with quantum computers, the protective function of common encryption algorithms is threatened. Our concept describes the transformation of a classical asymmetric encryption method to a modern complexity class.
  arXiv  Detail & Related papers  (2023-11-24T21:06:42Z)
• Brain-Inspired Computational Intelligence via Predictive Coding [89.6335791546526]
  Predictive coding (PC) has shown promising performance in machine intelligence tasks. PC can model information processing in different brain areas, can be used in cognitive control and robotics.
  arXiv  Detail & Related papers  (2023-08-15T16:37:16Z)
• Can AI-Generated Text be Reliably Detected? [50.95804851595018]
  Large Language Models (LLMs) perform impressively well in various applications. The potential for misuse of these models in activities such as plagiarism, generating fake news, and spamming has raised concern about their responsible use. We stress-test the robustness of these AI text detectors in the presence of an attacker.
  arXiv  Detail & Related papers  (2023-03-17T17:53:19Z)
• 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)
• Deniable Encryption in a Quantum World [6.550883342516878]
  We study (sender-)deniable encryption in a setting where the encryption procedure is a quantum algorithm. We show that quantum unlocks a fundamentally stronger form of deniable encryption, which we call perfect unexplainability.
  arXiv  Detail & Related papers  (2021-12-30T09:45:24Z)
• The Feasibility and Inevitability of Stealth Attacks [63.14766152741211]
  We study new adversarial perturbations that enable an attacker to gain control over decisions in generic Artificial Intelligence systems. In contrast to adversarial data modification, the attack mechanism we consider here involves alterations to the AI system itself.
  arXiv  Detail & Related papers  (2021-06-26T10:50:07Z)
• Recovering AES Keys with a Deep Cold Boot Attack [91.22679787578438]
  Cold boot attacks inspect the corrupted random access memory soon after the power has been shut down. In this work, we combine a novel cryptographic variant of a deep error correcting code technique with a modified SAT solver scheme to apply the attack on AES keys. Our results show that our methods outperform the state of the art attack methods by a very large margin.
  arXiv  Detail & Related papers  (2021-06-09T07:57:01Z)
• Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
  Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
  arXiv  Detail & Related papers  (2020-06-17T18:14:30Z)
• On Adversarial Examples and Stealth Attacks in Artificial Intelligence Systems [62.997667081978825]
  We present a formal framework for assessing and analyzing two classes of malevolent action towards generic Artificial Intelligence (AI) systems. The first class involves adversarial examples and concerns the introduction of small perturbations of the input data that cause misclassification. The second class, introduced here for the first time and named stealth attacks, involves small perturbations to the AI system itself.
  arXiv  Detail & Related papers  (2020-04-09T10:56:53Z)

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.