An improvement of key generation algorithm for Gentry's homomorphic encryption scheme from ideal lattices

MaRDI QIDQ4902134zbMATH OpenFDO

Authors Naoki Ogura, Go Yamamoto, Tetsutaro Kobayashi, Shigenori Uchiyama

Publication date 25 January 2013

Full work available at URL http://gcoe-mi.jp/english/./temp/publish/e50d20a5d26d4401107c49ad98f40b64.pdf

zbMATH Keywords

circulant matrixideal latticehomomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Improved key generation algorithm for Gentry's fully homomorphic encryption scheme
• Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
• Faster fully homomorphic encryption
• Toward basing fully homomorphic encryption on worst-case hardness
• Implementing Gentry's fully-homomorphic encryption scheme

Cited in

(4)

• Experiments with the plaintext space in Gentry's somewhat homomorphic scheme
• An upgrade on the key generation algorithm of the GGH-MKA lattice-based encryption scheme
• Improved key generation algorithm for Gentry's fully homomorphic encryption scheme
• Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme

This page was built for publication: An improvement of key generation algorithm for Gentry's homomorphic encryption scheme from ideal lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902134)