Anonymous ID: 4d00ef July 31, 2018, 3:18 p.m. No.2376757   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>6809 >>6851

>>2376618

Working on pic related

Have searched this keyspace up to length of 3 chars for the F5 seed

abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 .,:;!?()-+*/[]{}@_><#~=^`'"&%$

space included

No hits - proceeding to length of 4 - will report back in a few days

Anonymous ID: 4d00ef July 31, 2018, 10:52 p.m. No.2385732   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>6063

>>2385604

I know. Rather than shooting for one target hash, we try 1k passwords at once and run each serially with however many iterations required, in parallel. I don't see a problem here. I still think it can be modified to our purpose.

Anonymous ID: 4d00ef July 31, 2018, 11:35 p.m. No.2386525   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>6742

>>2386063

Is size the size of the decompressed bitmap? Or is it something else?

PS tells me that's about 303K for illumipepe.

Even if it's 1MB as you say, that's still 1500 instances of the image.

With my lame 1.5GB graphics card that's still almost 5K potential instances

Anonymous ID: 4d00ef July 31, 2018, 11:58 p.m. No.2386850   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>6977

>>2386742

The DCT coefficient list only gets computed once, correct? If so, we only need to push one copy of the data to the graphics card and we should be able to copy it as many times as we want, no? And if we manage to implement it all on the graphics card, then all we really care about getting back is the rate of attempts and the valid key, if any. And yes, I understand many images are larger but essentially it would work out to max available GPU mem divided by decompressed image size in terms of threads. I'm willing to bet that's still a fuckton more than we've got going currently.

Anonymous ID: 4d00ef Aug. 1, 2018, 3:44 p.m. No.2398936   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun

>>2398717

 

K so all we need to do is image search medium.com for an image with that header. If no results found (and the original filename isn't like medium's random naming bullshit) then we probably have a PK image.

Anonymous ID: 4d00ef Aug. 1, 2018, 3:57 p.m. No.2399203   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>9442 >>9450

>>2399125

Does stegdetect hit false positives?

Here's a medium article with the exact illumipepe image [positive ID by SHA] that's in your list.

https://medium. com/@Freequincy/right-wing-dove-squad-how-trash-dove-became-the-symbol-of-the-alt-right-c7794b84a48d

Anonymous ID: 4d00ef Aug. 1, 2018, 6:29 p.m. No.2402121   ๐Ÿ—„๏ธ.is ๐Ÿ”—kun   >>9199

>>2401778

https://anonfile.com/EaG3B8fbb8/PKunknot.zip

This is what I'm using anon - single thread per instance though. You'll have to manually split your wordlists. It will automatically generate every permutation for a given charset and exit if a correct solution is found.

Run by calling the following on your command line:

java -cp bcprov-jdk15on-160.jar; q.Main %IMGNAME% %CHARSETFILE% %STARTINGWORD%