From 5f2ec26337d12cb4a732ceb90e065cfe912a7ae7 Mon Sep 17 00:00:00 2001 From: Tyler Bettilyon Date: Fri, 23 Dec 2016 13:52:11 -0700 Subject: [PATCH] removed comment about my solution from an exercise file --- src/collision-attack.js | 9 --------- 1 file changed, 9 deletions(-) diff --git a/src/collision-attack.js b/src/collision-attack.js index 40aa1ed..6afb442 100644 --- a/src/collision-attack.js +++ b/src/collision-attack.js @@ -37,15 +37,6 @@ module.exports = { return a value that collides with the provided checksum when the charcodeTimesIndex function is used to hash the return value. - Once again, we're restricted to a specific character set. Unfortnuately, - this checksum can't realistically be broken with a brute force search. Doing - so requires solving the "subset-sum" problem, which is NP-Complete. Using a - similar strategy to the above becomes quite slow as soon as we need 16-32 digit - strings. - - Instead I've used a hill-clibming technique that explores randomly when anytime - the hashcode is off by the same amount twice in a row. - @param {integer} checksum : the hash value that our returned string must hash to using the simple sum method