<--- Back to Details
First PageDocument Content
Abstract algebra / Cyberwarfare / Lattice points / NTRUEncrypt / NTRUSign / Lattice / NTRU / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Polynomial / Post-quantum cryptography / Mathematics / Cryptography
Date: 2011-04-23 07:41:21
Abstract algebra
Cyberwarfare
Lattice points
NTRUEncrypt
NTRUSign
Lattice
NTRU
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
Polynomial
Post-quantum cryptography
Mathematics
Cryptography

Add to Reading List

Source URL: www.szydlo.com

Download Document from Source Website

File Size: 277,37 KB

Share Document on Facebook

Similar Documents

Mathematics / OSI protocols / Computational number theory / Lattice points / Algebra / Orthogonal frequency-division multiplexing / MIMO / Cyclic prefix / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Radio resource management / Information theory / IEEE 802

Lattice-Reduction-Aided Receivers for MIMO-OFDM in Spatial Multiplexing Systems Inaki Berenguer1 , Jaime Adeane1 , Ian J. Wassell1 , and Xiaodong Wang2 1 Laboratory for Communication Engineering Department of Engineering

DocID: 195pA - View Document

Abstract algebra / Lattice problem / Lattice / Learning with errors / Vector space / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Lattice-based cryptography / Algebra / Mathematics / Cryptography

The nc-Unique Shortest Vector Problem is Hard Vadim Lyubashevsky∗ Abstract The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem upon which the first provably-secure lattice-based crypt

DocID: 133NR - View Document

Lattice points / Cryptography / Computational number theory / Linear algebra / Quadratic forms / Lattice problem / Lattice reduction / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Algebra / Mathematics / Abstract algebra

A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech

DocID: 12Qnp - View Document

Cryptography / Lattice points / Linear algebra / Computational number theory / Lattice problem / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / Algebra / Mathematics / Abstract algebra

Solving the Shortest Lattice Vector Problem in Time 22.465n Xavier Pujol1 and Damien Stehl´e2 1 Universit´e de Lyon, Laboratoire LIP, CNRS-ENSL-INRIA-UCBL, 46 All´ee d’Italie, 69364 Lyon Cedex 07, France 2

DocID: 12PSf - View Document

Cryptography / Lattice points / Computational number theory / Linear algebra / Lattice problem / Lattice / Normal distribution / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / Mathematics / Algebra / Abstract algebra

Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem ? Xiaoyun Wang1,2 , Mingjie Liu1 , Chengliang Tian2 and Jingguo Bi2 1 Institute for Advanced Study, Tsinghua University, Beijing, China

DocID: 12JYy - View Document