Back to Results
First PageMeta Content
Mathematics / Applied mathematics / RSA / Lattice problem / Ciphertext indistinguishability / Ciphertext / Mathematical sciences / Rabin cryptosystem / Blum–Goldwasser cryptosystem / Cryptography / Public-key cryptography / Electronic commerce


Multi-Bit Cryptosystems based on Lattice Problems Akinori Kawachi∗ Keisuke Tanaka∗ Keita Xagawa∗ Abstract We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free
Add to Reading List

Document Date: 2010-01-23 11:51:00

Open Document

File Size: 855,69 KB

Share Result on Facebook

City

Tokyo / Introduction Lattice / /

Country

Japan / /

Currency

pence / /

/

Facility

Tokyo Institute of Technology / /

IndustryTerm

polynomial-time algorithm / polynomial-time quantum algorithm / efficient algorithm / cryptographic applications / inner product / given algorithm / /

Organization

Department of Mathematical and Computing Sciences / Tokyo Institute of Technology / /

Person

Keisuke Tanaka∗ Keita Xagawa / /

Position

SVP / n SVP / /

Technology

encryption / correct 4 encryption / efficient algorithm / polynomial-time quantum algorithm / private key / public key / given algorithm / polynomial-time algorithm / /

SocialTag