Advertisement
Published in:
2009 | OriginalPaper | Chapter
Efficient Public Key Encryption Based on Ideal Lattices
(Extended Abstract)
Authors : Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa
Published in: Advances in Cryptology – ASIACRYPT 2009
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We describe public key encryption schemes with security provably based on the worst case hardness of the approximate Shortest Vector Problem in some structured lattices, called ideal lattices. Under the assumption that the latter is exponentially hard to solve even with a quantum computer, we achieve CPA-security against subexponential attacks, with (quasi-)optimal asymptotic performance: if
n
is the security parameter, both keys are of bit-length
${\widetilde{O}}(n)$
and the amortized costs of both encryption and decryption are
${\widetilde{O}}(1)$
per message bit. Our construction adapts the trapdoor one-way function of Gentry
et al.
(STOC’08), based on the Learning With Errors problem, to structured lattices. Our main technical tools are an adaptation of Ajtai’s trapdoor key generation algorithm (ICALP’99) and a re-interpretation of Regev’s quantum reduction between the Bounded Distance Decoding problem and sampling short lattice vectors.