Related papers: A Double Cryptography Using The Smarandache Keedwe…
The present study further strenghtens the use of the Keedwell CIPQ against attack on a system. This is done as follows. The holomorphic structure of AIPQs(AIPLs) and CIPQs(CIPLs) are investigated. Necessary and sufficient conditions for the…
By studying the holomorphic structure of automorphic inverse property quasigroups and loops[AIPQ and (AIPL)] and cross inverse property quasigroups and loops[CIPQ and (CIPL)], it is established that the holomorph of a loop is a Smarandache;…
The isotopic invariance or universality of types and varieties of quasigroups and loops described by one or more equivalent identities has been of interest to researchers in loop theory in the recent past. A variety of quasigroups(loops)…
In this paper, we propose a novel construction for a symmetric encryption scheme, referred as SEBQ which is based on the structure of quasigroup. We utilize concepts of chaining like mode of operation and present a block cipher with…
Scalar multiplication kP is a critical operation in Elliptic Curve Cryptosystems (ECC), often targeted by Side-Channel Analysis (SCA). Despite strategies based on atomic patterns to enhance security, the binary kP algorithms remain…
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…
Quantum LDPC codes have attracted intense interest due to their advantageous properties for realizing efficient fault-tolerant quantum computing. In particular, sheaf codes represent a novel framework that encompasses all well-known good…
Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have…
Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible classically. In this work, we build on the no-cloning principle of quantum mechanics…
Counterfactual quantum cryptography (CQC), recently proposed by Noh, is featured with no transmission of signal particles. This exhibits evident security advantage, such as its immunity to the well known PNS attack. In this paper, the…
We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…
Due to the current standard of Security Credential Management System (SCMS) for Vehicle-to-Everything (V2X) communications using asymmetric cryptography, specifically Elliptic-Curve Cryptography (ECC), which may be vulnerable to quantum…
We compute the quantum double, braiding and other canonical Hopf algebra constructions for the bicrossproduct Hopf algebra $H$ associated to the factorization of a finite group into two subgroups. The representations of the quantum double…
Like all of quantum information theory, quantum cryptography is traditionally based on two level quantum systems. In this letter, a new protocol for quantum key distribution based on higher dimensional systems is presented. An experimental…
In this paper, we propose to use a twisted dihedral group algebra for public-key cryptography. For this, we introduce a new $2$-cocycle $\alpha_{\lambda}$ to twist the dihedral group algebra. Using the ambient space…
In this paper, a novel hybrid protocol for semiquantum key distribution (SQKD) and semiquantum secret sharing (SQSS) was constructed by using GHZ-like states. This protocol is capable of establishing two different private keys between one…
Differential cryptanalysis is one of the most popular methods in attacking block ciphers. However, there still some limitations in traditional differential cryptanalysis. On the other hand, researches of quantum algorithms have made great…
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem,…
Several cryptographic protocols constructed based on less-known algorithmic problems, such as those in non-commutative groups, group rings, semigroups, etc., which claim quantum security, have been broken through classical reduction methods…
We describe the hashing technique to obtain a fast approximation of a target quantum gate in the unitary group SU(2) represented by a product of the elements of a universal basis. The hashing exploits the structure of the icosahedral group…