| Document Date: 2014-07-31 14:00:16
Open Document File Size: 264,89 KBShare Result on Facebook
Company G. For / Bernstein / G/H / Zm 2 / / Country China / New Zealand / / Facility Peking University / University of Auckland / / IndustryTerm faster algorithms / polynomial-time algorithms / heuristic algorithm / parallel collision search / low-density algorithms / quotient / desired original solution / time-memory tradeoff algorithms / final algorithm / additive / generic hash function collision algorithms / extended k-tree algorithm / possible solutions / partial solutions / larger quotient / approximate subset-sum algorithms / lattice algorithms / / OperatingSystem ISIS / / Organization Department of Mathematics / School of Mathematical Sciences / University of Auckland / Auckland / Peking University / Beijing / / Person Lyubashevsky / / Technology heuristic algorithm / generic hash function collision algorithms / main algorithm / This algorithm / cryptography / Improved Exponential-time Algorithms / Shroeppel-Shamir algorithm / 2 2.1 Algorithms / low-density algorithms / extended k-tree algorithm / 2.7 The algorithm / lattice algorithms / known algorithms / BCJ algorithm / polynomial-time algorithms / previous algorithms / CPW algorithm / Shamir algorithm / HGJ algorithm / final algorithm / CPW algorithms / time-memory tradeoff algorithms / BCJ algorithms / Patarin/Wagner algorithm / 2 2.8 The algorithm / approximate subset-sum algorithms / Schroeppel-Shamir algorithm / be computed efficiently using the Shroeppel-Shamir algorithm / /
SocialTag |
Improved Exponential-time Algorithms for Inhomogeneous-SIS Shi Bai1 , Steven D. Galbraith1 , Liangze Li2 , and Daniel Sheffield1 1 Department of Mathematics, University of Auckland, Auckland, New Zealand. 2