Somewhat homomorphic encryption based on random codes

This work presents a secret-key encryption scheme based on random rank metric ideal linear codes with a simple decryption circuit that achieves competitive sizes and performance and studies a candidate bootstrapping algorithm that requires no multiplication but additions and plaintext multiplications only.