On the Homomorphic Computation of Symmetric Cryptographic Primitives

摘要: We present an analysis on the homomorphic computability of different symmetric cryptographic primitives, with goal understanding their characteristics respect to evaluation according BGV scheme. Specifically, we start from framework presented by Gentry, Halevi and Smart for evaluating AES. provide improvement it, then perform a detailed computation algorithms families Salsa20 stream cipher, SHA-256 hash function Keccak sponge function. After analysis, report performance results primitives have implemented using recently released HElib. In conclusions discuss our findings analyzed draw general conclusion primitives.