Related papers: Quasigroups in cryptology
In this paper, we examine the state art of quantum computing and analyze its potential effects in scientific computing and cybersecurity. Additionally, a non-technical description of the mechanics of the listed form of computing is provided…
In this paper, we state two combination theorems for relatively quasiconvex subgroups in a relatively hyperbolic group. Applications are given to the separability of double cosets of certain relatively quasiconvex subgroups and the…
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
The notion of quasicrossed product is introduced in the setting of G-graded quasialgebras, i.e., algebras endowed with a grading by a group G, satisfying a "quasiassociative" law. The equivalence between quasicrossed products and…
It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…
We give an axiomatic formulation of quantum structures like semilogics and quasilogics which generalize the boolean semirings of events and fuzzy logics. The notions of distributions, states, representations observables and semiobservables…
We introduce a ring and a field, generated by a semigroup, and we investigate some of their properties.
The normalization of a quasi-log canonical pair is a quasi-log canonical pair.
One of the earliest cryptographic applications of quantum information was to create quantum digital cash that could not be counterfeited. In this paper, we describe a new type of quantum money: quantum coins, where all coins of the same…
This is about the paper by Thawhat Changphas and Nawamin Phaipong in Quasigroups and Related Systems 22 (2014), 193--200.
Quantum computers impose an immense threat to system security. As a countermeasure, new cryptographic classes have been created to prevent these attacks. Technologies such as post-quantum cryptography and quantum cryptography. Quantum…
We define a convenient $\infty$-operad parametrizing modules over commutative algebras in $\infty$-categories.
Nowadays, using cryptographic systems play an effective role in security and safety technologies. One of the most applied kind of cryptography is Symmetric Cryptography and its applications. New aspects of symmetric Cryptography…
An $H$-closed quasitopological group is a Hausdorff quasitopological group which is contained in each Hausdorff quasitopological group as a closed subspace. We obtained a sufficient condition for a quasitopological group to be $H$-closed,…
We define the notion of $\epsilon$-stable quasimaps to a GIT stack bundle, and study the wall-crossing behavior of the resulting $\epsilon$-quasimap theory as $\epsilon$ varies.
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are easily established. Authentication and signature…
With the rapid development of quantum computers the currently secure cryptographic protocols may not stay that way. Quantum mechanics provides means to create an inherently secure communication channel that is protected by the laws of…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…