7 papers
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…
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…
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…