The Evolution of Cryptography through Number Theory

• URL: http://arxiv.org/abs/2411.14451v1
• Date: Mon, 11 Nov 2024 16:27:57 GMT
• Title: The Evolution of Cryptography through Number Theory
• Authors: Fernando Peralta Castro,
• Abstract summary: 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.
• Score: 55.2480439325792
• License:
• Abstract: Cryptography, derived from Greek meaning hidden writing, uses mathematical techniques to secure information by converting it into an unreadable format. While cryptography as a science began around 100 years ago, its roots trace back to ancient civilizations like Mesopotamia and Egypt. Over time, cryptography evolved from basic methods to complex systems involving number theory, such as modular arithmetic, the Euclidean algorithm, and Eulers totient function. This paper explores the link between early information hiding techniques and modern cryptographic algorithms like RSA, which use advanced number theory to secure data for billions of people. By analyzing historical methods, this study shows how the development of number theory enabled the transition from simple letter shifting ciphers, like the Caesar and Vigenere ciphers, to more sophisticated encryption methods. This evolution reflects a profound impact on daily life and the importance of number theory in protecting information.

Related papers

• 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. These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem. 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)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Homomorphic Encryption Based on Post-Quantum Cryptography [0.0]
  This study proposes post-quantum cryptography (QCP)-based homomorphic encryption method. It includes the homomorphic encryption function based on a code-based cryptography method for avoiding quantum computing attacks. Results show that the encryption time and time of the proposed method are shorter than other cryptography methods.
  arXiv  Detail & Related papers  (2024-02-22T00:38:23Z)
• 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)
• CipherSniffer: Classifying Cipher Types [0.0]
  We frame the decryption task as a classification problem. We first create a dataset of transpositions, substitutions, text reversals, word reversals, sentence shifts, and unencrypted text.
  arXiv  Detail & Related papers  (2023-06-13T20:18:24Z)
• 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)
• Quantum Advantage in Cryptography [4.847980206213335]
  Quantum cryptography allows us to build communication schemes whose secrecy relies on the laws of physics. This article provides an overview of the principles and state of the art of quantum cryptography.
  arXiv  Detail & Related papers  (2022-06-08T18:00:03Z)
• 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)
• A brief history on Homomorphic learning: A privacy-focused approach to machine learning [2.055949720959582]
  Homomorphic encryption allows running arbitrary operations on encrypted data. It enables us to run any sophisticated machine learning algorithm without access to the underlying raw data. It took more than 30 years of collective effort to finally find the answer "yes"
  arXiv  Detail & Related papers  (2020-09-09T21:57:47Z)
• 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)

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.