Floating-Point LLL: Theoretical and Practical Aspects
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/978-3-642-02295-1_5.pdf
Reference64 articles.
1. LIDIA 2.1.3. A C++ library for computational number theory. Available at http://www.informatik.tu-darmstadt.de/TI/LiDIA/ .
2. IEEE Standards Committee 754. ANSI/IEEE standard 754-1985 for binary floating-point arithmetic. Reprinted in SIGPLAN Notices, 22(2):9–25, 1987.
3. M. Ajtai. Random lattices and a conjectured 0-1 law about their polynomial time computable properties. In Proceedings of the 2002 Symposium on Foundations of Computer Science (FOCS 2002), pages 13–39. IEEE Computer Society Press, 2002.
4. M. Ajtai. The worst-case behavior of Schnorr’s algorithm approximating the shortest nonzero vector in a lattice. In Proceedings of the 35th Symposium on the Theory of Computing (STOC 2003), pages 396–406. ACM, 2003.
5. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th Symposium on the Theory of Computing (STOC 1997), pages 284–293. ACM, 1997.
Cited by 17 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Efficient Algorithm for Integer Lattice Reduction;SIAM Journal on Matrix Analysis and Applications;2024-01-24
2. Crystal Reduced Motif via the Vectors Exchange Theorem I: Impact of Swapping on two Orthogonalization Processes and the AE Algorithm;European Journal of Pure and Applied Mathematics;2023-10-30
3. Lattice Enumeration with Discrete Pruning: Improvements, Cost Estimation and Optimal Parameters;Mathematics;2023-02-03
4. An extension of the fpLLL library to Hermitian lattices;ACM Communications in Computer Algebra;2021-06
5. Towards Faster Polynomial-Time Lattice Reduction;Advances in Cryptology – CRYPTO 2021;2021
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3