scientific article; zbMATH DE number 6292594

DOI10.4086/CJTCS.2008.002MaRDI QIDQ5414564zbMATH OpenOpenAlexFDO

Authors Miklós Ajtai

Publication date 6 May 2014

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/cjtcs.2008.002

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• On the linear complexity of binary lattices
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
• Hardness of approximating the shortest vector problem in lattices
• scientific article; zbMATH DE number 1643917
• Automata, Languages and Programming
• Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
• On linear complexity of binary lattices. II
• Binary representations of finite fields and their application to complexity theory
• scientific article; zbMATH DE number 3870586

Cited in

(2)

• Representing hard lattices with O(n n) bits (extended abstract)
• scientific article; zbMATH DE number 1302849 (Why is no real title available?)

Describes a project that uses

Uses Software

• NTRU

This page was built for publication:

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