Galois ring isomorphism problem

by   Karan Khathuria, et al.

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. In this paper, we generalize the problem to the case of Galois rings, resulting in the Galois ring isomorphism problem. The generalization is achieved by lifting the isomorphism between the corresponding residue fields. As a result, this generalization allows us to construct cryptographic primitives over the ring of integers modulo a prime power, instead of a large prime number.



page 1

page 2

page 3

page 4


Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power

We define and analyze low-rank parity-check (LRPC) codes over extension ...

Temperature-Based Hardware Trojan For Ring-Oscillator-Based TRNGs

True random number generators (TRNGs) are essential components of crypto...

Generalized Reed-Muller codes over Galois rings

Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes ...

On the ideal shortest vector problem over random rational primes

Any ideal in a number field can be factored into a product of prime idea...

A new idea for RSA backdoors

This article proposes a new method to inject backdoors in RSA and other ...

Ring Learning With Errors: A crossroads between postquantum cryptography, machine learning and number theory

The present survey reports on the state of the art of the different cryp...

Gracefully Degrading Gathering in Dynamic Rings

Gracefully degrading algorithms [Biely et al., TCS 2018] are designed to...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.