A complete break of an homomorphic encryption algorithm based on polynomial rings

MaRDI QIDQ6665911

A. Panigrahi, Yash Makwana

Publication date: 17 January 2025

Published in: Gaṇita (Search for Journal in Brave)

zbMATH Keywords

cryptanalysishomomorphic encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Privacy of data (68P27)

Cites Work

• Title not available (Why is that?)
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Theory of Cryptography

This page was built for publication: A complete break of an homomorphic encryption algorithm based on polynomial rings

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