Related papers: On A Cryptographic Identity In Osborn Loops
Left Cheban loops are loops that satisfy the identity x(xy.z) = yx.xz. Right Cheban loops satisfy the mirror identity {(z.yx)x = zx.xy}. Loops that are both left and right Cheban are called Cheban loops. Cheban loops can also be…
Learning diverse features is key to the success of person re-identification. Various part-based methods have been extensively proposed for learning local representations, which, however, are still inferior to the best-performing methods for…
$D$-loops are loops with the antiautomorphic inverse property. The class of such loops is larger than the class of IP-loops. The smallest $D$-loops which is not an IP-loop has six elements. We prove several basic properties of such loops…
We design the first efficient polynomial identity testing algorithms over the nonassociative polynomial algebra. In particular, multiplication among the formal variables is commutative but it is not associative. This complements the strong…
A loop $(Q,\cdot,\backslash,/)$ is called a middle Bol loop if it obeys the identity $x(yz\backslash x)=(x/z)(y\backslash x)$. To every right (left) Bol loop corresponds a middle Bol loop via an isostrophism. In this paper, the structure of…
Universal Circuits (UCs) offer a promising approach to hardware Intellectual Property (IP) obfuscation, leveraging cryptographic principles to hide both structure and function in a programmable logic fabric. Their adaptability makes them…
OpenID Connect (OIDC) enables a user with commercial-off-the-shelf browsers to log into multiple websites, called relying parties (RPs), by her username and credential set up in another trusted web system, called the identity provider…
Most classical and post-quantum cryptographic assumptions, including integer factorization, discrete logarithms, and Learning with Errors (LWE), rely on algebraic structures such as rings or vector spaces. While mathematically powerful,…
Quantum algorithms for solving linear systems of equations have generated excitement because of the potential speed-ups involved and the importance of solving linear equations in many applications. However, applying these algorithms can be…
We propose Obfuscated Semantic Null space Injection for Privacy (OSNIP), a lightweight client-side encryption framework for privacy-preserving LLM inference. Generalizing the geometric intuition of linear kernels to the high-dimensional…
Computing endomorphism rings of supersingular elliptic curves is an important problem in computational number theory, and it is also closely connected to the security of some of the recently proposed isogeny-based cryptosystems. In this…
This paper presents algorithms for local inversion of maps and shows how several important computational problems such as cryptanalysis of symmetric encryption algorithms, RSA algorithm and solving the elliptic curve discrete log problem…
These notes accompany a series of three lectures on automorphic loops to be delivered by the author at Workshops Loops '15 (Ohrid, Macedonia, 2015). Automorphic loops are loops in which all inner mappings are automorphisms. The first paper…
Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD…
We study loops which are universal (that is, isotopically invariant) with respect to the property of flexibility ($xy\cdot x = x\cdot yx$). We also weaken this to semi-universality, that is, loops in which every left and right isotope is…
This is a journey through integrals of involutions and surprising consequences of the Lagrange inversion theorem. On the way, we meet unexpected logarithmic identities, hypergeometric functions with a linear regime and other mysterious…
Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labelled with powers $x^n$ for binary encoded numbers $n$. It is shown that polynomial identity testing for…
The present study illuminates the relation between null cusped Wilson loops and their corresponding amplitudes. We find that, compared to the case with no self-crossing, the one loop expectation value of a self-intersecting Wilson loop…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
We present information-theoretic definitions and results for analyzing symmetric-key encryption schemes beyond the perfect secrecy regime, i.e. when perfect secrecy is not attained. We adopt two lines of analysis, one based on lossless…