Secure Function Extensions to Additively Homomorphic Cryptosystems

ePrint Report: Secure Function Extensions to Additively Homomorphic Cryptosystems

Mounika Pratapa, Aleksander Essex

The number-theoretic literature has long studied the question of distributions of sequences of quadratic residue symbols modulo a prime number. In this paper, we present an efficient algorithm for generating primes containing chosen sequences of quadratic residue symbols and use it as the basis of a method extending the functionality of additively homomorphic cryptosystems.


We present an algorithm for encoding a chosen Boolean function into the public …

algorithm distributions eprint report extensions function literature prime question report