24 citations · 27 across the 11 of their papers we have counts for
12 papers
Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems
Anna-Lena Horlemann, Karan Khathuria, Marc Newman +2
Post-quantum cryptography has gained attention due to the need for secure cryptographic systems in the face of quantum computing. Code-based and lattice-based cryptography are two…
Information Set Decoding for Lee-Metric Codes using Restricted Balls
Jessica Bariffi, Karan Khathuria, Violetta Weger
The Lee metric syndrome decoding problem is an NP-hard problem and several generic decoders have been proposed. The observation that such decoders come with a larger cost than thei…
On some batch code properties of the simplex code
Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet +1
The binary -dimensional simplex code is known to be a -batch code and is conjectured to be a -functional batch code. Here, we offer a simple, constructive proo…
On Cyclic Matroids and their Applications
Gianira N. Alfarano, Karan Khathuria, Simran Tinani
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely…
Density of Free Modules over Finite Chain Rings
Eimear Byrne, Anna-Lena Horlemann, Karan Khathuria +1
In this paper we focus on modules over a finite chain ring of size . We compute the density of free modules of , where we separately treat the asy…
Cryptanalysis of a code-based full-time signature
Nicolas Aragon, Marco Baldi, Jean-Christophe Deneuville +3
We present an attack against a code-based signature scheme based on the Lyubashevsky protocol that was recently proposed by Song, Huang, Mu, Wu and Wang (SHMWW). The private key in…
Galois ring isomorphism problem
Karan Khathuria
Recently, Doröz et al. (2017) proposed a new hard problem, called the finite field isomorphism problem, and constructed a fully homomorphic encryption scheme based on this problem.…
On single server private information retrieval in a coding theory perspective
Gianira N. Alfarano, Karan Khathuria, Violetta Weger
In this paper, we present a new perspective of single server private information retrieval (PIR) schemes by using the notion of linear error-correcting codes. Many of the known sin…
On the Hardness of the Lee Syndrome Decoding Problem
Violetta Weger, Karan Khathuria, Anna-Lena Horlemann +3
In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem is NP-…
Encryption Scheme Based on Expanded Reed-Solomon Codes
Karan Khathuria, Joachim Rosenthal, Violetta Weger
We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret codes and disguise it by considering its shortened expanded co…
Generalization of the Ball-Collision Algorithm
Carmelo Interlando, Karan Khathuria, Nicole Rohrer +2
In this paper we generalize the Ball-Collision Algorithm by Bernstein, Lange, Peters from the binary field to a general finite field. We also provide a complexity analysis and comp…
On the algebraic structure of and applications to cryptography
Karan Khathuria, Giacomo Micheli, Violetta Weger
In this paper we show that the -module structure of the ring is isomorphic to a -submodule of the matrix ring over $…