Related papers: Binary bi-braces and applications to cryptography

We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…

We demonstrate that the two inequivalent spinor representations of the braid group \B_{2n+2}, describing the exchanges of 2n+2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from computational point of…

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a…

Isolated hypersurface singularities come equipped with distinguished bases of their Milnor lattices and with upper triangular integral matrices, which are called here distinguished matrices. These matrices form an orbit of a braid group and…

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…

We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…

In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils down to solving the derivation problem for Horn theories. This…

The iterative conditional branchings appear in various sensitive algorithms, like the modular exponentiation in the RSA cryptosystem or the scalar multiplication in ellipticcurve cryptography. In this paper, we abstract away the desirable…

Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…

Double Blind Comparison is a new cryptographic primitive that allows a user who is in possession of a ciphertext to determine if the corresponding plaintext is identical to the plaintext for a different ciphertext held by a different user,…

We consider two different types of deformations for the linear group $ GL(n)$ which correspond to using of a general diagonal R-matrix. Relations between braided and quantum deformed algebras and their coactions on a quantum plane are…

Biquandle brackets are a type of quantum enhancement of the biquandle counting invariant for oriented knots and links, defined by a set of skein relations with coefficients which are functions of biquandle colors at a crossing. In this…

We study blocks of the double covers of symmetric and alternating groups. The main result is a `local' description, up to Morita equivalence, of arbitrary defect RoCK blocks of these groups in terms of generalized Schur superalgebras…

We relate commutative algebras in braided tensor categories to braid-reversed tensor equivalences, motivated by vertex algebra representation theory. First, for $\mathcal{C}$ a braided tensor category, we give a detailed construction of the…

The impetus for this study is the work of Dumas and Rigal on the Jordanian deformation of the ring of coordinate functions on $2\times 2$ matrices. We are also motivated by current interest in birational equivalence of noncommutative rings.…

Transformation coefficients between standard bases for irreducible representations of the Brauer centralizer algebra $\mathfrak{B}_f(x)$ and split bases adapted to the $\mathfrak{B}_{f_1} (x) \times \mathfrak{B}_{f_2} (x) \subset…

We introduce a new Baxterisation for R-matrices that depend separately on two spectral parameters. The Baxterisation is based on a new algebra, close to but different from the braid group. This allows us to recover the R-matrix of the…

Differential cryptanalysis famously uses statistical biases in the propagation of differences in a block cipher to attack the cipher. In this paper, we investigate the existence of more general statistical biases in the differences. To this…

Birack modules are modules over an algebra Z[X] associated to a finite birack X. In previous work, birack module structures on Z mod n were used to enhance the birack counting invariant. In this paper, we use birack modules over Laurent…

We consider a key exchange procedure whose security is based on the difficulty of computing discrete logarithms in a group, and where exponentiation is hidden by a conjugation. We give a platform-dependent cryptanalysis of this protocol.…