An encryption algorithm using a generalization of the Markovski algorithm and a system of orthogonal operations based on T-quasigroups

• URL: http://arxiv.org/abs/2407.14858v1
• Date: Sat, 20 Jul 2024 12:38:07 GMT
• Title: An encryption algorithm using a generalization of the Markovski algorithm and a system of orthogonal operations based on T-quasigroups
• Authors: Nadezhda Malyutina, Alexander Popov, Victor Shcherbacov,
• Abstract summary: We present an implementation of this algorithm based on T-quasigroups, more precisely, based on medial quasigroups. In this paper, we present an implementation of this algorithm based on T-quasigroups, more precisely, based on medial quasigroups.
• Score: 45.67330863443465
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Here is a more detailed description of the algorithm proposed in [1]. This algorithm simultaneously uses two cryptographic procedures: encryption using a generalization of the Markovski algorithm [2] and encryption using a system of orthogonal operations. In this paper, we present an implementation of this algorithm based on T-quasigroups, more precisely, based on medial quasigroups.

Related papers

• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system. We propose a convex-optimization-free algorithm that can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• A New Algorithm for Computing Branch Number of Non-Singular Matrices over Finite Fields [1.3332839594069594]
  The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The differential or linear branch number indicates the minimum number of active S-Boxes in two consecutive rounds of an SPN cipher. This paper presents a new algorithm for computing the branch number of non-singular matrices over finite fields.
  arXiv  Detail & Related papers  (2024-05-11T13:06:03Z)
• On efficient quantum block encoding of pseudo-differential operators [6.134067544403308]
  Block encoding lies at the core of many existing quantum algorithms. This paper presents a study of the block encoding of a rich family of dense operators: the pseudo-differential operators (PDOs)
  arXiv  Detail & Related papers  (2023-01-21T07:18:57Z)
• An efficient quantum-classical hybrid algorithm for distorted alphanumeric character identification [0.0]
  The proposed algorithm can transform a low-resolution bitonal image of a character from the set of alphanumeric characters into a high-resolution image. The quantum part of the proposed algorithm fruitfully utilizes a variant of Grover's search algorithm, known as the fixed point search algorithm.
  arXiv  Detail & Related papers  (2022-12-25T05:31:51Z)
• Description of the Grover algorithm based on geometric considerations [2.680349265843603]
  Grover algorithm allows amplification of quantum states previously tagged by an Oracle. This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way.
  arXiv  Detail & Related papers  (2022-10-30T10:55:25Z)
• Algorithm Selection on a Meta Level [58.720142291102135]
  We introduce the problem of meta algorithm selection, which essentially asks for the best way to combine a given set of algorithm selectors. We present a general methodological framework for meta algorithm selection as well as several concrete learning methods as instantiations of this framework.
  arXiv  Detail & Related papers  (2021-07-20T11:23:21Z)
• Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
  Bilevel optimization has been widely applied in many important machine learning applications. We propose two new algorithms for bilevel optimization. We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
  arXiv  Detail & Related papers  (2021-06-08T21:05:30Z)
• A Note on Enumeration by Fair Sampling [0.0]
  This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. Our algorithm is based on a lemma of the coupon collector's problem and is an improved version of the algorithm described in arXiv:2007.08487 ( 2020)
  arXiv  Detail & Related papers  (2021-04-05T14:56:58Z)
• Accelerated Message Passing for Entropy-Regularized MAP Inference [89.15658822319928]
  Maximum a posteriori (MAP) inference in discrete-valued random fields is a fundamental problem in machine learning. Due to the difficulty of this problem, linear programming (LP) relaxations are commonly used to derive specialized message passing algorithms. We present randomized methods for accelerating these algorithms by leveraging techniques that underlie classical accelerated gradient.
  arXiv  Detail & Related papers  (2020-07-01T18:43:32Z)
• Extreme Algorithm Selection With Dyadic Feature Representation [78.13985819417974]
  We propose the setting of extreme algorithm selection (XAS) where we consider fixed sets of thousands of candidate algorithms. We assess the applicability of state-of-the-art AS techniques to the XAS setting and propose approaches leveraging a dyadic feature representation.
  arXiv  Detail & Related papers  (2020-01-29T09:40:58Z)

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.