Somewhat Homomorphic Encryption based on Random Codes

ePrint Report: Somewhat Homomorphic Encryption based on Random Codes

Carlos Aguilar-Melchor, Victor Dyseryn, Philippe Gaborit

We present a secret-key encryption scheme based on random rank metric ideal linear codes with a simple decryption circuit. It supports unlimited homomorphic additions and plaintext absorptions as well as a fixed arbitrary number of homomorphic multiplications.


We study a candidate bootstrapping algorithm that requires no multiplication but additions and plaintext absorptions only. This latter operation is therefore very efficient in our scheme, whereas bootstrapping …

decryption encryption eprint report homomorphic encryption key linear metric plaintext random report secret simple