Related papers: A Novel Method to Generate Key-Dependent S-Boxes w…
Trapped ions are one of the most promising platforms for quantum computing due to the longest qubit coherence times and the highest gate fidelities. However, scaling the number of ions (qubits) in a linear Coulomb crystal is the key…
Lattice-based cryptography relies on generating random bases which are difficult to fully reduce. Given a lattice basis (such as the private basis for a cryptosystem), all other bases are related by multiplication by matrices in…
This work examines the concept of S-permutation matrices, namely $n^2 \times n^2$ permutation matrices containing a single 1 in each canonical $n \times n$ subsquare (block). The article suggests a formula for counting mutually disjoint…
Much scientific work has focused on the generation of random numbers as well as the distribution of said random numbers for use as a cryptographic key. However, emphasis is often placed on one of the two to the exclusion of the other, but…
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…
In this paper, we propose an efficient key management scheme by generating new public and private keys in the Blom scheme. We also focus on making this scheme dynamic by randomly changing the secret key that is generated by the base station…
The Independence of Clones (IoC) criterion measures a voting rule's robustness to strategic nomination. Prior literature has established empirically that individuals may still submit costly, distortionary misreports even in strategy-proof…
An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…
This paper presents a symmetric stream cipher that utilizes the dynamic properties of random cubic mappings in the complex plane to generate pseudo-random key streams. The system is based on the iterations of the random cubic polynomial…
It is designed a new quantum cryptography protocol that generates various secret and secure keys of the same size of the transmitted qubits, implying zero information losses between the interlocutors. Besides, generates key swapping between…
Cancer is a genetic disorder whose clonal evolution can be monitored by tracking noisy genome-wide copy number variants. We introduce the Copy Number Stochastic Block Model (CN-SBM), a probabilistic framework that jointly clusters samples…
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination…
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.…
Most of the information is in the form of electronic data. A lot of electronic data exchanged takes place through computer applications. Therefore information exchange through these applications needs to be secure. Different cryptographic…
In this note, we present a construction of new nonbinary quantum codes with good parameters. These codes are obtained by applying the Calderbank-Shor-Steane (CSS) construction. In order to do this, we show the existence of (classical)…
Given a set $\Pi$ of permutation patterns of length at most $k$, we present an algorithm for building $S_{\le n}(\Pi)$, the set of permutations of length at most $n$ avoiding the patterns in $\Pi$, in time $O(|S_{\le n - 1}(\Pi)| \cdot k +…
Primality generation is the cornerstone of several essential cryptographic systems. The problem has been a subject of deep investigations, but there is still a substantial room for improvements. Typically, the algorithms used have two parts…
This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…
Associative division algebras are a rich source of fully diverse space-time block codes (STBCs). In this paper the systematic construction of fully diverse STBCs from nonassociative algebras is discussed. As examples, families of fully…
Stringology-Based Cryptanalysis (SBC) offers a suitable and a structurally aligned approach for uncovering structural patterns in stream ciphers that traditional statistical tests may often fail to detect. Despite \texttt{EChaCha20}'s…