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

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of…

Advances in quantum computing make Shor's algorithm for factorising numbers ever more tractable. This threatens the security of any cryptographic system which often relies on the difficulty of factorisation. It also threatens methods based…

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…

Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…

Let $\text{U}(n,\mathbb{F}_{q^2})$ denote the subgroup of unitary matrices of the general linear group $\text{GL}(n,\mathbb{F}_{q^2})$ which fixes a Hermitian form and $M\geq 2$ an integer. This is a companion paper to the previous works…

This scholarly work presents an advanced cryptographic framework utilizing automorphism groups as the foundational structure for encryption scheme implementation. The proposed methodology employs a three-parameter group construction,…

This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining…

Pseudorandom generators (PRGs) are a foundational primitive in classical cryptography, underpinning a wide range of constructions. In the quantum setting, pseudorandom quantum states (PRSs) were proposed as a potentially weaker assumption…

In this paper, we present a secure multiparty computation (SMC) protocol for least common multiple (LCM) based on Shor's quantum period-finding algorithm (QPA). Our protocol is based on the following principle: the connection of multiple…

In this paper we consider some Lie groups in complexified Clifford algebras. Using relations between operations of conjugation in Clifford algebras and matrix operations we prove isomorphisms between these groups and classical matrix groups…

Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand, due to progress both on…

We construct sequences $\{a_n\}_{n\in\mathbb{N}}\in\{-1,1\}^{\mathbb{N}}$ with small values of signed harmonic sums \[ \sum_{n\in\mathcal{A}\cap[1,N]}\frac{a_n}{n}, \] for any reasonably dense subsets $\mathcal{A}\subset\mathbb{N}.$ We…

Using the geometry of the projective plane over the finite field F_q, we construct a Hermitian Lorentzian lattice L_q of dimension (q^2 + q + 2) defined over a certain number ring $\cO$ that depends on q. We show that infinitely many of…

Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen…

Traceable signatures (Kiayas et al., EUROCRYPT 2004) is an anonymous digital signature system that extends the tracing power of the opening authority in group signatures. There are many known constructions of traceable signatures, but all…

We reduce a case of the hidden subgroup problem (HSP) in SL(2; q), PSL(2; q), and PGL(2; q), three related families of finite groups of Lie type, to efficiently solvable HSPs in the affine group AGL(1; q). These groups act on projective…

The goal of this paper is to demonstrate the use of techniques from hyperbolic geometry to compute generating sets of certain subgroups of $SL^+(2,\mathbb{C})$; specifically, $SO^+(Q,\mathbb{Z})$ for $Q$ some integral quadratic form of…

We study explicit constructions of min-wise hash families and their extension to $k$-min-wise hash families. Informally, a min-wise hash family guarantees that for any fixed subset $X\subseteq[N]$, every element in $X$ has an equal chance…

We categorify one half of the small quantum sl(2) at a prime root of unity. An extension of this construction to an arbitrary simply-laced case is proposed.

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…