Back to Results
First PageMeta Content
Post-quantum cryptography / Lie groups / Number theory / NTRUEncrypt / Lattice / Learning with errors / Valuation / Normal distribution / Ideal lattice cryptography / Cryptography / Abstract algebra / Mathematics


Making NTRU as Secure as Worst-Case Problems over Ideal Lattices Damien Stehlé1 and Ron Steinfeld2
Add to Reading List

Document Date: 2011-02-24 04:40:45

Open Document

File Size: 418,11 KB

Share Result on Facebook

City

Lyon / Lattice / /

Company

R/I / /

Country

France / Australia / /

Currency

pence / /

/

Facility

Macquarie University / /

IndustryTerm

time quantum algorithms / generation algorithm / cryptographic applications / subexponential quantum algorithm / additive / geometric law / ron.steinfeld@mq.edu.au http /

Organization

Macquarie University / Department of Computing / Centre for Advanced Computing / /

Position

CPA / SVP / obtained representative / worst-case SVP / /

ProgrammingLanguage

R / K / /

Technology

encryption / Cryptography / key generation algorithm / public key / post-quantum public-key encryption / subexponential quantum algorithm / secret key / time quantum algorithms / /

URL

http /

SocialTag