Related papers: Minimal Logarithmic Signatures for one type of Cla…

The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…

A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other…

In this paper we provide a classification of fundamental group elements representing simple closed curves on the punctured Klein bottle, Similar to the Birman-Series classification of curves on the punctured torus[1]. In the process, an…

In this paper, we prove the existence of an efficient algorithm for the computation of $q$-expansions of modular forms of weight $k$ and level $\Gamma$, where $\Gamma \subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup. We…

We prove that the length of the shortest identity in a finite simple group of Lie type of rank $r$ defined over $\mathbb{F}_q$, is bounded (from above and below) by explicit polynomials in $q$ and $r$.

We introduce Latent Secret Spin (LSS), a blind speech watermarking method based on geometric operations in codec latent space. Based upon orthogonal rotations to principal components, LSS induces imperceptible but detectable covariance…

In this article, we propose a method to construct self orthogonal matrix, orthogonal matrix and anti orthogonal matrix over the finite field. Orthogonal matrices has numerous applications in cryptography, so here we demonstrate the…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p^m, or 2p^m where p is an odd large prime and m is a positive integer. It is another…

The expressions for the $\hat{R}$--matrices for the quantum groups SO$_{q^2}$(5) and SO$_q$(6) in terms of the $\hat{R}$--matrices for Sp$_q$(2) and SL$_q$(4) are found, and the local isomorphisms of the corresponding quantum groups are…

Constructing cryptographic schemes with tight or almost-tight security has long been one of the central problems in theoretical cryptography. At ASIACRYPT 2016, Boyen and Li posed an open problem: whether it is possible to construct a…

Codes are crucial in many areas of applications. Different types of codes are designed to meet specific needs, which makes them more effective and useful. Linear codes are extensively used in data storage systems. Identifying codes are…

This report aims at giving a general overview on the classification of the maximal subgroups of compact Lie groups (not necessarily connected). In the first part, it is shown that these fall naturally into three types: (1) those of trivial…

We compute the characters of real irreducible representations of SL(2,q), the special linear group on q letters, for an odd prime $q$. Moreover, we give the dimensions of these irreducible representations under the actions of cyclic…

In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…

Under the assumption of a certain conjecture, for which there exists strong experimental evidence, we produce an efficient algorithm for constructive membership testing in the Suzuki groups Sz(q), where q = 2^{2m + 1} for some m > 0, in…

The Longest Common Substring (LCS) and Longest Palindromic Substring (LPS) are classical problems in computer science, representing fundamental challenges in string processing. Both problems can be solved in linear time using a classical…

We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group. We show that under very general conditions both the weak…

The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of the previously suggested length-based algorithms, that make…

We classify all pairs (G,V) with G a closed subgroup in a classical group with natural module V over the complex numbers such that G has the same composition factors on the kth tensor power of V, for a fixed (small) k. In particular, we…