On a related note, I'm *sure* I read a paper / post where someone proved that you could manipulate a file to produce a hash where the first and last few characters matched the hash of an unrelated file.
Anyone know what I'm talking about?
On a related note, I'm *sure* I read a paper / post where someone proved that you could manipulate a file to produce a hash where the first and last few characters matched the hash of an unrelated file.
Anyone know what I'm talking about?
This is trivial to do.
@ryanc @retr0id
Oh, sure, the sha256 of "b" and "e" both start with "3".
But I'm sure I read something about manipulating the first and last 5(?) characters.
It is entirely possible I dreamt it though.
@Edent @retr0id Controlling the first and last 5 characters is doable with brute force.
@ryanc @Edent @retr0id It's been demonstrated to be possible, mainly because when people compare hashes (visually), they usually only look at the first and last few characters.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.