Cryptoanalysis of a public key exchange based on circulant matrix over digital semiring

• URL: http://arxiv.org/abs/2504.15880v1
• Date: Tue, 22 Apr 2025 13:25:29 GMT
• Title: Cryptoanalysis of a public key exchange based on circulant matrix over digital semiring
• Authors: Alvaro Otero Sanchez,
• Abstract summary: We present a cryptanalysis of a key exchange protocol based on the digital semiring.<n>We find the maximal solution of a linear system over such semiring, and use the properties of circulant matrix to demonstrate that the protocol is vulnerable.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a cryptanalysis of a key exchange protocol based on the digital semiring. For this purpose, we find the maximal solution of a linear system over such semiring, and use the properties of circulant matrix to demonstrate that the protocol is vulnerable. Specifically, we provide an efficient attack that recovers the shared secret key from publicly exchanged information for any instance of the digital semiring in polynomial time.

Related papers

• Key exchange protocol based on circulant matrix action over congruence-simple semiring [0.0]
  We present a new key exchange protocol based on circulant matrices acting on matrices over a congruence-simple semiring. We provide an analysis of its computational cost and its security against known attacks.
  arXiv  Detail & Related papers  (2025-05-01T17:07:11Z)
• Provably Secure Public-Key Steganography Based on Admissible Encoding [66.38591467056939]
  The technique of hiding secret messages within seemingly harmless covertext is known as provably secure steganography (PSS) PSS evolves from symmetric key steganography to public-key steganography, functioning without the requirement of a pre-shared key. This paper proposes a more general elliptic curve public key steganography method based on admissible encoding.
  arXiv  Detail & Related papers  (2025-04-28T03:42:25Z)
• 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)
• Post-Quantum Key Agreement Protocols Based on Modified Matrix-Power Functions over Singular Random Integer Matrix Semirings [0.0]
  Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers.<n>This paper introduces two novel post-quantum key agreement protocols that can be easily implemented on standard computers.
  arXiv  Detail & Related papers  (2025-01-04T14:01:09Z)
• Quantum-Safe Hybrid Key Exchanges with KEM-Based Authentication [2.102973349909511]
  In PQCrypto 2023, Bruckner, Ramacher and Striecks proposed a novel hybrid AKE (HAKE) protocol, dubbed Muckle+.<n>Muckle# uses post-quantum key-encapsulating mechanisms for implicit authentication inspired by recent works in the area of Transport Layer Security (TLS) protocols.
  arXiv  Detail & Related papers  (2024-11-06T16:28:17Z)
• 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.<n>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)
• Multi-Layered Security System: Integrating Quantum Key Distribution with Classical Cryptography to Enhance Steganographic Security [0.0]
  We present a novel cryptographic system that integrates Quantum Key Distribution (QKD) with classical encryption techniques. Our approach leverages the E91 QKD protocol to generate a shared secret key between communicating parties. This key is then hashed using the Secure Hash Algorithm (SHA) to provide a fixedlength, high-entropy key.
  arXiv  Detail & Related papers  (2024-08-13T15:20:29Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Cryptoanalysis of a key exchange protocol based on a congruence-simple semiring action [0.0]
  We show that a previously introduced key exchange based on a congruence-simple semiring action is not secure by providing an attack that reveals the shared key from the distributed public information for any of such semirings.
  arXiv  Detail & Related papers  (2024-02-13T13:13:58Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• 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)
• Decrypting Nonlinearity: Koopman Interpretation and Analysis of Cryptosystems [0.05120567378386613]
  We introduce a novel perspective on cryptosystems by viewing the Diffie-Hellman key exchange and the Rivest-Shamir-Adleman cryptosystem as nonlinear dynamical systems.<n>By applying Koopman theory, we transform these dynamical systems into higher-dimensional spaces and analytically derive equivalent purely linear systems.
  arXiv  Detail & Related papers  (2023-11-21T16:38:48Z)
• CRYPTO-MINE: Cryptanalysis via Mutual Information Neural Estimation [42.481750913003204]
  Mutual Information (MI) is a measure to evaluate the efficiency of cryptosystems. Recent advances in machine learning have enabled progress in estimating MI using neural networks. This work presents a novel application of MI estimation in the field of cryptography.
  arXiv  Detail & Related papers  (2023-09-14T20:30:04Z)
• Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.<n>The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol.<n>We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• 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)
• Experimental anonymous conference key agreement using linear cluster states [0.0]
  Greenberger-Horne-Zeilinger (GHZ) states have been introduced as resource states for anonymous key exchange protocols. Here we demonstrate that linear cluster states can serve as a versatile and potentially scalable resource in such applications.
  arXiv  Detail & Related papers  (2022-07-19T18:02:24Z)
• 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)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)

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.