Related papers: Extending class group action attacks via sesquilin…
We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…
For an elliptic curve $E$ over any field $K$, the Weil pairing $e_n$ is a bilinear map on $n$-torsion. For $K$ of characteristic $p>0$, the map $e_n$ is degenerate if and only if $n$ is divisible by $p$. In this paper, we consider $E$ over…
We present a systematic procedure for analyzing cumulants to arbitrary order in the context of heavy-ion collisions. It generalizes and improves existing procedures in many respects. In particular, particles which are correlated are allowed…
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$, if an imaginary quadratic order $O$…
A cryptographic protocol (CP) is a distributed algorithm designed to provide a secure communication in an insecure environment. CPs are used, for example, in electronic payments, electronic voting procedures, database access systems, etc.…
This paper examines the use of Lie group and Lie Algebra theory to construct the geometry of pairwise comparisons matrices. The Hadamard product (also known as coordinatewise, coordinate-wise, elementwise, or element-wise product) is…
We recently proposed a new ensemble clustering algorithm for graphs (ECG) based on the concept of consensus clustering. We validated our approach by replicating a study comparing graph clustering algorithms over benchmark graphs, showing…
Post-Quantum Cryptography PQC attempts to find cryptographic protocols resistant to attacks using Shors polynomial time algorithm for numerical field problems or Grovers algorithm to find the unique input to a black-box function that…
Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…
Graph-based classification methods are widely used for security and privacy analytics. Roughly speaking, graph-based classification methods include collective classification and graph neural network. Evading a graph-based classification…
In the evolving landscape of cryptographic security, the robustness of Elliptic Curve Cryptography (ECC) against side-channel analysis (SCA) attacks is of paramount importance due to the widespread use of ECC and the growing sophistication…
The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is foundational for isogeny-based cryptography. The One Endomorphism…
Matched pairs of Lie groupoids and Lie algebroids are studied. Discrete Euler-Lagrange equations are written for the matched pairs of Lie groupoids. As such, a geometric framework to analyse a discrete system by decomposing it into two…
We study a general family of quantum protocols for position verification and present a new class of attacks based on the Clifford hierarchy. These attacks outperform current strategies based on port-based teleportation for a large class of…
Graph modeling allows numerous security problems to be tackled in a general way, however, little work has been done to understand their ability to withstand adversarial attacks. We design and evaluate two novel graph attacks against a…
An action of a compact quantum group on a compact metric space $(X,d)$ is (D)-isometric if the distance function is preserved by a diagonal action on $X\times X$. We show that an isometric action in this sense has the following additional…
One of the possible generalizations of the discrete logarithm problem to arbitrary groups is the so-called conjugacy search problem (sometimes erroneously called just the conjugacy problem): given two elements a, b of a group G and the…
We study discrete complex analysis and potential theory on a large family of planar graphs, the so-called isoradial ones. Along with discrete analogues of several classical results, we prove uniform convergence of discrete harmonic…
The rapid development of computer technology will be the whole world as a whole, the widespread application of instant messaging technology to bring great convenience to people's lives, while privacy protection has become a more significant…
This article is concerned with numerical methods to approximate effective coefficients in stochastic homogenization of discrete linear elliptic equations, and their numerical analysis --- which has been made possible by recent contributions…