Key exchange protocol based on circulant matrix action over congruence-simple semiring

• URL: http://arxiv.org/abs/2505.00664v1
• Date: Thu, 01 May 2025 17:07:11 GMT
• Title: Key exchange protocol based on circulant matrix action over congruence-simple semiring
• Authors: Alvaro Otero Sanchez,
• Abstract summary: We present a new key exchange protocol based on circulant matrices acting on matrices over a congruence-simple semiring.<n>We provide an analysis of its computational cost and its security against known attacks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a new key exchange protocol based on circulant matrices acting on matrices over a congruence-simple semiring. We describe how to compute matrices with the necessary properties for the implementation of the protocol. Additionally, we provide an analysis of its computational cost and its security against known attacks.

Related papers

• Cryptoanalysis of a public key exchange based on circulant matrix over digital semiring [0.0]
  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.
  arXiv  Detail & Related papers  (2025-04-22T13:25:29Z)
• 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)
• Weakly supervised covariance matrices alignment through Stiefel matrices estimation for MEG applications [64.20396555814513]
  This paper introduces a novel domain adaptation technique for time series data, called Mixing model Stiefel Adaptation (MSA) We exploit abundant unlabeled data in the target domain to ensure effective prediction by establishing pairwise correspondence with equivalent signal variances between domains. MSA outperforms recent methods in brain-age regression with task variations using magnetoencephalography (MEG) signals from the Cam-CAN dataset.
  arXiv  Detail & Related papers  (2024-01-24T19:04:49Z)
• Matrix manipulations via unitary transformations and ancilla-state measurements [46.13392585104221]
  We propose protocols for calculating inner product, matrix addition and matrix multiplication based on multiqubit Toffoli-type and the simplest one-qubit operations. The depth (runtime) of the addition protocol is $O(1)$ and that of other protocols logarithmically increases with the dimensionality of the considered matrices.
  arXiv  Detail & Related papers  (2023-11-19T14:06:25Z)
• A Post Quantum Key Agreement Protocol Based on a Modified Matrix Power Function over a Rectangular Matrices Semiring [0.0]
  Sakalauskas matrix power function is an efficient and secure way to generate a shared secret key. We present an improved post-quantum version of Sakalauskas matrix power function key agreement protocol.
  arXiv  Detail & Related papers  (2023-03-21T16:07:17Z)
• An approach to robust ICP initialization [77.45039118761837]
  We propose an approach to initialize the Iterative Closest Point (ICP) algorithm to match unlabelled point clouds related by rigid transformations. We derive bounds on the robustness of our approach to noise and numerical experiments confirm our theoretical findings.
  arXiv  Detail & Related papers  (2022-12-10T16:27:25Z)
• Transfer-matrix summation of path integrals for transport through nanostructures [62.997667081978825]
  We develop a transfer-matrix method to describe the nonequilibrium properties of interacting quantum-dot systems. The method is referred to as "transfer-matrix summation of path integrals" (TraSPI)
  arXiv  Detail & Related papers  (2022-08-16T09:13:19Z)
• Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors [54.936314353063494]
  We provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing. We make use of a practical iterative algorithm, and perform numerical experiments on image datasets to corroborate our results.
  arXiv  Detail & Related papers  (2021-08-08T05:28:06Z)
• Adversarially-Trained Nonnegative Matrix Factorization [77.34726150561087]
  We consider an adversarially-trained version of the nonnegative matrix factorization. In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix. We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices.
  arXiv  Detail & Related papers  (2021-04-10T13:13:17Z)
• $k$-means on Positive Definite Matrices, and an Application to Clustering in Radar Image Sequences [0.0]
  We state theoretical properties for $k$-means clustering of Symmetric Positive Definite (SPD) matrices, in a non-Euclidean space. We then provide a novel application for this method, to time-series clustering of pixels in a sequence of Synthetic Aperture Radar images.
  arXiv  Detail & Related papers  (2020-08-08T06:21:43Z)

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.