| Document Date: 2012-12-31 14:07:22
Open Document File Size: 100,29 KBShare Result on Facebook
/ IndustryTerm near-collision algorithm / generic algorithm / memory-less algorithm / collision search / memory-less algorithms / nearcollision algorithm / memory-full algorithm / generic algorithms / matching algorithm / code algorithm / near-collision algorithms / rst algorithm / / / Technology previous covering-code based algorithms / rst algorithm / near-collision algorithm / nearcollision algorithm / one processor / near-collision algorithms / memory-less algorithm / memory-less algorithms / covering code algorithm / covering-code based algorithms / matching algorithm / sorting algorithm / Rho algorithm / truncation-based algorithms / differences Complexity Our algorithm / 2 Memory-less algorithms / previous truncation-based algorithms / 8 Algorithm / /
SocialTag |
Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find near-collisions for a hash