Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Tripcode decoder?

Name: Anonymous 2007-12-03 19:48

is there anyway to convert a tripcode into the password for that tripcode, im using tripsage and I see that you can put in a word you want to see in a trip code and it produces results of passwords that would produce a tripcode with those letters in it, so if we were to take a complete tripcode someone has and enter it into that field, in theory it should eventually produce the 1 password that produces that tripcode, however i have a core 2 duo e6600 which can run 170,000 crypts per second but with over 10^80 possible combinations(numbers + letters + capital letters + symbols, and 10 characters in a tripcode) it would take litteraly much more than trillions of years to run through every combination. Any other suggestions?

Name: Anonymous 2009-06-12 4:06

>>680
why is there such a strong correlation between inferior technology and initialisms with "cp" in them?

Name: Anonymous 2009-06-12 15:06

milkribs is back HABEEB IT

Name: Anonymous 2009-06-15 13:54

[spoiler]>>>I<<<

Name: Anonymous 2009-06-15 13:55

>>>I<<<

Name: Anonymous 2009-06-15 15:59

>>>I<<<

Name: !Yi3k533gvY 2009-06-16 10:00

Test

Name: um wtf 2009-06-18 13:52

wtf is this place

Name: !FioC/dkH3c 2009-06-18 20:33

Test

Name: Doom !!du1x5SxmvjXnexw 2009-06-22 17:28

testin

Name: nub !!fo0ULwwk2OQ2ozz 2009-06-22 17:32

wtf

Name: !MILKRIBS4k 2009-06-23 4:30

NO THANK YOU

Name: help random trip !!ttt+9wJsFW/ctH9 2009-06-26 21:02

how can i customize my tripcode to say whatever I want?

Name: Anonymous 2009-06-26 21:49

>>691
Let's Lose.

Name: Anonymous 2009-06-27 1:07

Name: Rei !SAMAqkQcxg 2009-07-16 8:35

asdf

Name: Anonymous 2009-07-16 10:09

Can you of you niggers please brute force milkyanus's trip?

Name: Anonymous 2009-07-17 1:29

>>696
* African Americans

Also, Back to /b/, please.

Name: triptest !GALhwE1tck 2009-07-30 18:26

derp

Name: bohaha !!Vwv8xQQdUnkee+U 2009-08-04 12:12

trip test

Name: Anonymous 2009-08-04 12:17

n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger n1gger

Name: Anonymous 2009-08-04 13:53

>>700

print "n1ggers "*10+"\n"

Name: Anonymous 2009-08-04 13:54

>>701
oh god i forgot my loop

Name: Anonymous 2009-08-04 14:21

>>701
cycle "n1ggers "

Name: Anonymous 2009-08-04 14:24

>>703

I don't think so, Tim.

Name: Anonymous 2009-08-04 14:56

>>704
I do, Sebastian.

Name: Anonymous 2009-08-05 0:18

  File "<stdin>", line 1
    cycle "n1ggers "
                   ^
SyntaxError: invalid syntax

Name: Anonymous 2009-08-05 0:33

>>706
Doing that was like doing this
echo 'cycle "n1ggers "' | gcc -x c -
<stdin>:1: error: parse error before string constant

Name: Anonymous !RevGiOKgRo 2009-08-09 13:53

um...can someone post a list of bad ass trip passwords?

Name: !.nOl7a4ZrM 2009-08-09 14:13

⌈|∵|⌋

Name: Anonymous 2009-08-09 15:37

/* 4tripper -- brute-force searching for simple crypt() tripcodes,
 * as used by the futallaby-based image boards (i.e: 4chan.org)
 * --
 * Compile:
 * gcc -O3 -o tripper 4tripper.c -lssl # Most Linux
 * gcc -O3 -o tripper 4tripper.c -ldes # NetBSD
 * gcc -O3 -o tripper 4tripper.c ../mumble/libdes.a # Mine
 * gcc -O3 -fast -mcpu=7450 -o 4tripper 4tripper.c -lcrypto -lssl # OSX on a G4
 * --
 * Usage:
 * ./tripper | grep -i monkey
 * --
 * Copyright 2004 Chris Baird,, <cjb@brushtail.apana.org.au>;
 * Licenced as per the GNU Public Licence Version 2.
 * Released: 2004/12/22. Your CPU heatsink /is/ working, right?
 * --
 * TODO:
 * Accept arguments for the key to resume/finish searching from (for
 * simple load distribution)
 */

#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>

/* Not quite the fastest DES library around, but still reasonable, and
 * most free Unixen should have it available. (Works for at least NetBSD
 * and Debian GNU/Linux (after "apt-get install libssl-dev")
 */
#include <openssl/des.h>

/* How I call a special DES library.. It has to supply a des_fcrypt() as
 * declared below.
 * #include "../libqwikdes/des.h"
 */

/* gotta ask for a robust way to tell the difference between the two..
 */
#if !NEW_OPENSSL
#  define our_fcrypt des_fcrypt /* NetBSD, Linux... */
#else
#  define our_fcrypt DES_fcrypt /* Gentoo, OSX... */
#endif

extern char *our_fcrypt(const char *buf,const char *salt, char *ret);


int main()
{
#define BUFSIZE 8192
  int quit=0, i, counts[8], bp;
  char c, buffer[BUFSIZE+32], result[14], salt[3], word[9];
  /* I haven't throughly checked whether all these characters are valid
   * in a tripcode as yet. */
  char table[]="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
      "0123456789 .!:#/`()_$[]+*{-";

  bp = 0;
  salt[2] = 0;
  for (i=0; i<8; i++)
    {
      counts[i] = -1;
      word[i] = 0;
    }
  counts[0] = 0;
  word[0] = table[0];

  while (!quit)
    {
      salt[0] = word[1];
      salt[1] = word[2];

      our_fcrypt (word, salt, result);

      for (i = 0; (word[i] != 0) && (i < 8); i++)
    buffer[bp++] = word[i];
      buffer[bp++] = ' ';

      for (i = 3; i < 13; i++)
    buffer[bp++] = result[i];
      buffer[bp++] = '\n';

      if ((bp > BUFSIZE))
    {
      write (1, buffer, bp);
      bp = 0;
    }

      i = 0;
    check:
      counts[i]++;
      c = table[counts[i]];
      word[i] = c;

      if (c == 0)
    {
      counts[i] = 0;
      word[i] = table[0];
      i++;
      if (i < 8)
        goto check;
      quit = 1;
    }
    }

  return 0;
}

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !frozEn/KIg 2009-08-09 15:42

>>710 that code doesn't do anything original. It just calls DES crypt.



________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
Velox Et Astrum gamedev forum: http://etastrum.phpbb3now.com
Free flow of information is the only safeguard against tyranny. The once-chained people whose leaders at last lose their grip on information flow will soon burst with freedom and vitality, but the free nation gradually constricting its grip on public discourse has begun its rapid slide into despotism. Beware of he who would deny you access to information, for in his heart he dreams himself your master.

Name: test !.CzKQna1OU 2009-08-09 16:25

test

Name: Smoker 2009-08-09 17:51

>>710
Sin tax error

Name: Anonymous 2009-08-09 18:04

>>710
The problem with that is that it only uses one process.
Try this:

/* Copyright (c) 2009 Xarn
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to
 * deal in the Software without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 * sell copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
 * IN THE SOFTWARE.
 */

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <getopt.h>
#include <signal.h>
#include <string.h>
#include <time.h>
#include <openssl/des.h>

#ifndef _GNU_SOURCE
#define strcasestr strstr
#endif

int checked = 0,    /* # tripcodes examined so far */
    p_id = 0,       /* Process ID */
    t;              /* Starting time */

void salten(const char*, char*);
void done(int);

int main(int argc, char **argv)
{
    int a, b, c, d, e, f, g, h, /* ins indices */
        i,                      /* General loop variable */
        procs = 4,              /* Number of processes to use */
        pstart, pstop,          /* Search domain for the process */
        do_random = 0;          /* Random starting point? */
    char  cap[9],               /* Capword */
          salt[2],              /* Crypt salt */
          ret[14],              /* DES_fcrypt buffer */
         *trip = ret + 3,       /* Actual tripcode */
          opt;
    extern char *optarg;
    const char *ins = "!$%'()*+,-./0123456789:;<=>?@AB"
                      "CDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`"
                      "abcdefghijklmnopqrstuvwxyz{|}~",
               *target = argv[argc - 1];    /* Search target */
    const int len_ins  = strlen(ins),
              len_targ = strlen(target);

    cap[8] = ret[13] = 0;

    if (argc < 2) {
        printf("Usage: %s [ -r ] [ -p PROCS ] STRING\n", argv[0]);
        return 1;
    }

    /* Associate the signal handler. */
    signal(SIGINT, *done);

    /* Parse options */
    while ((opt = getopt(argc, argv, "rp:")) != -1) {
        switch (opt) {
            case 'r':
                do_random = 1;
                break;
            case 'p':
                procs = atoi(optarg);
                break;
        }
    }
   
    /* Validate target */
    for (i = 0; i < len_targ; ++i) {
        if ((target[i] < 'A' || target[i] > 'Z') &&
            (target[i] < 'a' || target[i] > 'z') &&
            target[i] != '/' && target[i] != '.') {
            fprintf(stderr,
                    "Invalid target \033[1m%s\033[0m: not in [a-zA-Z./].\n",
                    target);
            return 2;
        }
    }

    /* Determine the number of processes to use... */
    if (procs < 1) procs = 1;
    pstart = pstop = procs;

    /* ... and spawn them. */
    if (--procs) {
        i = fork();
        while (i != 0 && --procs) {
            ++p_id;
            i = fork();
        }
        if (i != 0) ++p_id;
    }

    /* Find a sensible starting point for the process's search. */
    pstart = len_ins / pstart * p_id;
    pstop = len_ins / pstop * (p_id + 1);
    if (do_random) {
        FILE *randf = fopen("/dev/urandom", "r");
       
        if (randf == NULL) {
            fprintf(stderr, "Error: can't open /dev/urandom. Broken OS?\n");
           
            srand((unsigned int)(time(NULL) + pstart));
            pstart = rand();
        } else {
            fread((void *)&pstart, sizeof(int), 1, randf);
            fclose(randf);
        }
       
        pstart = (unsigned int)pstart % len_ins;
    }

    /* Almost ready to begin! */
    fprintf(stderr, "[%d] Starting at %c.\n", p_id, ins[pstart]);
    t = (int)time(NULL);

    /* Main loop(s) */
    for (b = pstart; b < pstop; ++b) { cap[1] = ins[b];
    for (c = 0; c < len_ins; ++c) {    cap[2] = ins[c]; salten(cap, salt);
    for (a = 0; a < len_ins; ++a) {    cap[0] = ins[a];
    for (d = 0; d < len_ins; ++d) {    cap[3] = ins[d];
    for (e = 0; e < len_ins; ++e) {    cap[4] = ins[e];
    for (f = 0; f < len_ins; ++f) {    cap[5] = ins[f];
    for (g = 0; g < len_ins; ++g) {    cap[6] = ins[g];
    for (h = 0; h < len_ins; ++h) {    cap[7] = ins[h];
        DES_fcrypt(cap, salt, ret);

        if (strcasestr(trip, target) != NULL)
            printf("%s -> %s\n", cap, trip);

        ++checked;

    }}}}}}}} /* FROZENVOID QUALITY */

    done(0);
    return 0;
}

void salten(const char *cap, char *salt)
{
    const char salt_table[128] =
        ".............................................../0123456789ABCDEF"
        "GABCDEFGHIJKLMNOPQRSTUVWXYZabcdefabcdefghijklmnopqrstuvwxyz.....";
    salt[0] = salt_table[(int)cap[1]];
    salt[1] = salt_table[(int)cap[2]];
}


void done(int sig)
{
    /* Signal handler. Performed upon SIGINT. */
    t = (int)time(NULL) - t;
    fprintf(stderr,
            "[%d] %d tripcodes examined in %d seconds (%d per second).\n",
            p_id, checked, t, checked / t);
    exit(sig);
}


(To compile, gcc -D_GNU_SOURCE -lssl file.c. Ubanto users and similar will want the libssl-dev package, everyone else is assumed to know what they're doing.
Omitting -D_GNU_SOURCE will make the search case sensitive, because strcasestr is a GNU extension. It's ANSI C otherwise, so it should compile on any sensible system.

It's still slower than many moonspeak alternatives because it uses OpenSSL's crypt instead of a bitslicing one, but more useful if you have a Beowulf cluster lying around.)

Name: test !CoPSz3buj6 2009-08-09 19:36

.

Name: Anonymous 2009-08-09 20:25

>>714
Why is everyone posting such slow implementations when there's already a JTR version in this very thread?

Name: Anonymous 2009-08-09 20:36

>>714
/* FROZENVOID QUALITY */
I lol'd

Name: Anonymous 2009-08-09 20:37

>>714
/* FROZENVOID QUALITY */
I lol'd

Name: Anonymous 2009-08-09 20:37

>>716
That is a version for distributed processing.

Name: Anonymous 2009-08-10 2:02

>>716
Have you tried to compile that one? It doesn't actually work.

Newer Posts