相关论文: Using shifted conjugacy in braid-based cryptograph…

This article introduces a novel cryptographic paradigm based on nonderived polyadic algebraic structures. Traditional cryptosystems rely on binary operations within groups, rings, or fields, whose well-understood properties can be exploited…

We produce braided commutative algebras in braided monoidal categories by generalizing Davydov's full center construction of commutative algebras in centers of monoidal categories. Namely, we build braided commutative algebras in relative…

Current advancements in mobility of devices and also Internet of Things (IoT) have replaced the central networks by distributed infrastructure. The more a network is distributed, the more the security of infrastructure and the communication…

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…

We use the classical interpretation of the braid group $B_3$ as a central extension of the modular group $\text{PSL}_2\left(\mathbb{Z}\right)$ to establish new and fundamental properties of $B_3$ using the theory of continued fractions. In…

Blind signatures play an important role in both electronic cash and electronic voting systems. Blind signatures should be secure against various attacks (such as signature forgeries). The work puts a special attention to secret key exposure…

The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction $f_n$ of parties can be corrupted by the adversary. However, due to the infamous Sybil attack, nominal…

The paper is devoted to prove a version of Milnor-Moore Theorem for connected braided bialgebras that are infinitesimally cocommutative. Namely in characteristic different from 2, we prove that, for a given connected braided bialgebra $A$…

We study the Sign_then_Encrypt, Commit_then_Encrypt_and_Sign, and Encrypt_then_Sign paradigms in the context of two cryptographic primitives, namely designated confirmer signatures and signcryption. Our study identifies weaknesses in those…

We show that the braided Hochschild cohomology, of an algebra in a suitably algebraic braided monoidal category, admits a graded ring structure under which it is braided commutative. We then give a canonical identification between the usual…

In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…

During Financial Cryptography 2012 Chan et al. presented a novel privacy-protection fault-tolerant data aggregation protocol. Comparing to previous work, their scheme guaranteed provable privacy of individuals and could work even if some…

Critical slowing down for the Krylov Dirac solver presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. We propose a new multi-grid approach for chiral fermions, applicable to both…

Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The…

The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new…

We propose BQTRU, a non-commutative NTRU-like cryptosystem over quaternion algebras. This cryptosystem uses bivariate polynomials as the underling ring. The multiplication operation in our cryptosystem can be performed with high speed using…

A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in…

We have constructed a modified BFT method that preserves the chain structure of constraints. This method has two advantages: first, it leads to less number of primary constraints such that the remaining constraints emerge automatically; and…

Low-dimensional topological objects, such as knots and braids, have become prevalent in multiple areas of physics, such as fluid dynamics, optics, and quantum information processing. Such objects also now play a role in cryptography, where…

Let $ V$ be a braided tensor category and $ C$ a tensor category equipped with a braided tensor functor $G:V\to Z(C)$. For any exact indecomposable $C$-module category $M$, we explicitly construct a right adjoint of the action functor…