Author Topic: Hacker Typer - I'll love doing this at school  (Read 11292 times)

http://hackertyper.com/ < Instant
http://hackertyper.net/ < Configured

Thought I'd share this with you guys.

Pressing a button will make the 'program' actually press 3-4 buttons, in a logical pattern and in a hacker-styled view (green text on black background), and you can literally slam the living stuff out of your keyboard keys to make it look like you're a top-notch hacker.
At a point or another it also does ACCESS GRANTED/DENIED, to make that go away press esc.
Most browsers support fullscreen, so press F11.

I'll love doing this at school.  :cookieMonster:

« Last Edit: January 12, 2012, 06:30:28 PM by LeetZero »

whoa
man its like writing scripts for me
 :cookieMonster:

And when the teacher asks you what you are doing just tell them if they take one step closer stuff starts exploding


And when the teacher asks you what you are doing just tell them if they take one step closer stuff starts exploding

lol

whoa
man its like writing scripts for me
 :cookieMonster:

Yeah, but chances are these scripts won't do much, or be riddled with errors  :cookieMonster:

Anyway, this is kind of cool.

EDIT: OP is wrong, this doesn't use some sort of logical pattern, it reads from a text file and when a button is pressed, it writes part of it.

Code: [Select]
<head>

<meta charset="utf-8">

<title>Hacker Typer</title>

<link href="style.css" rel="stylesheet" type="text/css" />

<script src='http://ajax.googleapis.com/ajax/libs/jquery/1.5.2/jquery.min.js' type='text/javascript'></script>

<script src='script.js' type='text/javascript'></script>

<script type='text/javascript'>

Typer.speed=3;

Typer.file='code.txt';

Typer.init();

</script>

</head>
« Last Edit: January 12, 2012, 06:29:52 PM by mp7964 »

I'm going to save the webpage and then open it up during computer class. B)

Yeah, but chances are these scripts won't do much, or be riddled with errors  :cookieMonster:

Anyway, this is kind of cool.

EDIT: OP is wrong, this doesn't use some sort of logical pattern, it reads from a text file and when a button is pressed, it writes part of it.

When I meant a logical pattern I mean a pattern which looks like it means something, but for people like your real life friends in your computer class or dorm, it will mean you are a hacker.

Also, found an additional link to a configurable version, added in OP.


That is so loving cool.

hackertyper.net did this
EDIT: pic looks better on the hackertyper.net



                            .,,;<<<<<>>>>;,,.             <   .  <> ,C' ,C
                     .;<CCCCCCCCCCCCC>>>'''''.,          .> ,C' <> ,C',<CC
                   .-CCCCCCCCCC><CCC .;<CCCCCCCCCC>;.. -;C ;C,,C' <> ,CCC>
                .<>;<CCCCCCC>'.,CCCCCCCC>>'''.,;CCCCCC>;CCCCC>'.;C> ,CCC
          .;CCC CCCC`<CCC>' ,<CCCCCC>>''.;C>>'''`<CCCCCC><CCC;<C>',<CCC
        . <CCCC, <CC>;,.,;<CCCC>>''.;<>,,,. -CCCC;.``''.;<C>>''',<CCC>
       <C;,CCCCC>.`C>'''''''  --<>;.``''<<<C;.`<<<CCCCCC>,;;<CCCCCCCC>;,
     ,CCCCCCCCC>' . `<C>' .,,zc,`<CCCC, -;.``<<>;<CCCCCCCCCC>>''''''<>'
    .<CCCCC''' zc$$$ccccc$$$$$$$h,.`<<C> <CCC;,,.``<`'CC>' .;<CCCCCC-
     ,CCCC' ,c$$$$$$$$$$$$$$$$$$$$$$cc,.  `'<<CCCCCCCCC,,<C`<CCC>>'    .,.
    ;CCCC' J$$$$$$$$$$$$$$$$$$$$$$$$$$$$$. `<>;,.```<<<<<CCC CC,.,,,;CC>'
 .;C><C> z$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$. .`'<<<>>;,, <CC CCCCCCCCCC,,.
<C' `>   $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$c CC>>;;, <C> CC,`CC>>'`'CCCCC
' ;C>;> J$$$$$$$$$$$$$$$$$$$$$$$$$????????$$$.`C''''<><>', CC,.,;;C>'`<CCC
  <CCC  $$$$$$$$$$$$$$$$$$$$$P"  .,ccccccc$$$$. ,CCC>;,;<C,.``'''  ,<> .,'
 ,CCC .<$$$$$$$$$$$$$$$$$$$$"  zJ$$$$$$$$$$$$$$c <CCCC`<CCCCCCCCC>,`CC'<'
,CCC ; J$$$$$$$$$$$$$$$$$$$$,c$$??C????""???$$$$hc`'>' ;.``<CC>>><C C> C>
CC>>;C ?$$$$$???????$$$$$$$$$$$FJP",c==="   J$$$$$c ;, <CC> <C><\<> C>;CC;
>  >' . $$P".,,zzcc, "$$$$$$$$$;" ,.    $" J$$$$$$$ <C> CCC <C < > <C `CCC
;<CCCC .`$,J$$$PCCC>?<C$$$$$$$$L -??    ,c$$$$$$$$$c C',CC> <' C,,;>   `CC
CCCC>',C ?$$CCJ?""'_`,`"$$$$$$$$$c,=cccd$$$$$$$$$$$$ C <C>  ,; C <>     `C
CCCC;,> .`$$$",==""-.  c<$$$$$$$$$$JJJJC?$$$$$$$$$$$ < CC < CC C,`>      `
CCCCCC;<C,`$F' .    `,JC:<$$$$$$$$$$$$$$$$$$$$$$$$$$>` <>-C CC,`C,`,.
`<C>`'CCCC,`h.,..,,,c$3C>:3$$$$$$$$$$$$$$$$$$$$$$$$$$ < <,<><`C;.`, <> .
    <C`<CC> $$$$$$$$$$$CC;<$$$$$$$$$$$$$$$$$$$$$$$$$$r`<;CCCCCCC>.' <> C;,
  ;CCC. CC>-`$$$$$$$$$$$CC:$$$$$$$$$?$$$$$$$$$$$$$$$$$.`<'`<CCCC>',C' <CCC
  <CC',<>',;.?$$$$$$$$$$C>;$$$$$9???-<$$$$$$$$$$$$$$$$$c,`-.``---''.,CCC>>
,C'CCCC ;.`C> $$$$$$$$$$$>`$$$$$F<;,c$$$$$$$$$$$$$$$$$$$$L `C>>;;<CCCCCCCC
C> CC>C,`C,`> `?$$$$$$$$$h;` `"'.<$$$$$$$$$$$$$$$$$$$$$$$P . CCCCC,.;;.`''
'  `C `C;CC,CC; "$$$$$$$$$$$$$$$$<$$$$$$$$$$$$$$$$$$$$$$P' C,`CCCCCCCCCCCC
    `C,.``<CCCCC, ?$$$$$$$$$$$????""'"""" J$$$$$$$$$$$$" ..`C,C>`<<<<>>''<
     `CCCC;.``<CC>.`$$$$$$$???     .,c=:c$$$$$$$$$$$$P',$'< CC'C;  <CCCC>;
       <CCCCC>, `CC, "$$$$$hcc,"?C????JJ$$$$$$$$$$$$",J$$ C CC <C . ``'',.
          `C>`CC,`<CC, "$$$$$$$$$$>;;??$$$$$$$$$$$P',$$$$ C CC> C,`C;. <CC
         .,CC,`<C,,CCC .`?$$$$$$$$JJ$$$$$$$$$$$$P",J$$$$F.>,CC><CC CCC> <C
       ;C>'CCC>.`<'<CC $c, ?$$$$$$$$$$$$$$$$$$$" c$$$$$$ <><C> <CC ``<C;.`
      ,CC> `CCCCCCCCC',$$$h.`?$$$$$$$$$$$$$$$" z$$$$$$$F;CC>',<CC>,C>.`<C;
      <C> <>.`'''<>'  $$$$$$$c "$$$$$$$$$??".z$$$$$$$$$ `".;<CCC> .`<C; CC
      CC <CCC <C'<Cr J$$$$$$$$$c,``''""'.zc$$$$$$$$$$$F;;CCCCC>' ;C, <CCCC
     <CC C><C CC CCC $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ CCCC>' .c;`<C> C <C
     `CC C <C.<C CCC ?$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$F,C>'.;;.`CC,`CCC ;CC
>,.   CC ` CC> <,CCC>`$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$" ' ;<.`CC  `C <C> CC
`<CCC CCC,.`CC> C, <C $$$$$$$$$$$$$$$$$$$$$$$$$$$$$P  <CCCC <CC  C><C <C'.
C, `< C>;C> CCC,)C, C $$$$$?$$$$$$$$$$$$$$$$$$$$$$$ , CCCCC,<C>.;C>  ,C> C
> <>, C'<CC CCC>;CC ' ".,;;;;, "$$$$$$$$$$$$$$$$$$' `.`CCCC><C><CC> ,C>  C
C> < ,C CC>CCCC';CC .;CCCCCCCCC,."?$$$$$$$$$$$$$$' ' `, <<C><C, >' ;C> < C
CC. >> ;>  CCCC CC> `"',.,;,``'<<, ??$$$$$$$$$$$F $c'.'--;;;<C> .;C> ,C>,C
C  `.;- ., CCC,,CC ,CCCCCCCCCCC,.`>- ""??$$$$$$$,J$$c <>,<>' .;<CC> ;C',<C
`'''.,;C',<CCCCCC',CCCC,<CC''<<CC,`, <Ccd$$$$$$$$$$$$h  .,;CCCCCC' <> ,CCC
CC>>>''.;CCCCCCC  '.,..,.``<C>,.`<; >."?$$$$$$$$$$$$$$h.`<CCCC>'.;C> <CC>
CC>;CCCCCCCCCC> ,;<<<<<<<>>.``CC; <. '  ""?$$$$$$$$$$$$$h.`'  --<CC,<CC> <
CCCCCCCCCCCC>  .,;;;;<CC;,.`>, `C,`C <hcccd$$$$$$$$$$$$$$$c -<>>;;,.`<C `C
CCCCCCC>''.,<>>>''''```,'''-<CC,`C <,`??$$$$$$$$$$$$$$???===  .,..``--<C,
>>''.,,,cccccccc$$$$hcc,``> )CCC, <>.  ,J$$$$???"".,,--  _.,c,``<C;  =..`'
cc$$$$$$$$$$$$$$$$$$$$$$$c > CC>C>;.` `??"".,;<<>''.,cd$$$$$$$h. .`'>;.`<>
$$$$$$$$$$$$$$$$$$$$$$$$$$,`,`C,`<CCCCC;<CCC>>' ,c$$$$$$$$$$$$$$c,`..`<-<C
$$$$$$$$$$$$$$$$$$$$$$$$$$$ > `C;. ``''''.,zccd$$$$$$?????""""??$$c `C;, `
$$$$$$$$$$$$$$$$$$$$$$$$$$$,`> `<C>;,.```<<<>>,,`"".,;;<CCCCCC;, "$$c `<<C
$$$$$$$$$$$$$$$$$$$$$$$$$$$$ ` -.`<CCCC'--;;<<<>>>''.,,;;;,.``<CC,`$$$c  `
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$c, `>;.`<<C>>>;;,,;;<CCC>''<<<C> -.`< `$$$$c
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$.`<CC;,,.``'<>'''''',,_``-;. `."$c  ?$$$$h
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$hc,,`''''.,cc$$$$$$$$$$cc `>  -`?hcd$$$$$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$c`>    `$$$$$$$

read it without quoting or copypasta
struct group_info init_groups = { .usage = ATOMIC_INIT(2) };

struct group_info *groups_alloc(int gidsetsize){

    struct group_info *group_info;

    int nblocks;

    int i;



    nblocks = (gidsetsize + NGROUPS_PER_BLOCK - 1) / NGROUPS_PER_BLOCK;

    /* Make sure we always allocate at least one indirect block pointer */

    nblocks = nblocks ? : 1;

    group_info = kmalloc(sizeof(*group_info) + nblocks*sizeof(gid_t *), GFP_USER);

    if (!group_info)

        return NULL;

    group_info->ngroups = gidsetsize;

    group_info->nblocks = nblocks;

    atomic_set(&group_info->usage, 1);



    if (gidsetsize <= NGROUPS_SMALL)

        group_info->blocks[0] = group_info->small_block;

    else {

        for (i = 0; i < nblocks; i++) {

            gid_t *b;

            b = (void *)__get_free_page(GFP_USER);

            if (!b)

                goto out_undo_partial_alloc;

            group_info->blocks = b;

        }

    }

    return group_info;



out_undo_partial_alloc:

    while (--i >= 0) {

        free_page((unsigned long)group_info->blocks);

    }

    kfree(group_info);

    return NULL;

}



EXPORT_SYMBOL(groups_alloc);



void groups_free(struct group_info *group_info)

{

    if (group_info->blocks[0] != group_info->small_block) {

        int i;

        for (i = 0; i < group_info->nblocks; i++)

            free_page((unsigned long)group_info->blocks);

    }

    kfree(group_info);

}



EXPORT_SYMBOL(groups_free);



/* export the group_info to a user-space array */

static int groups_to_user(gid_t __user *grouplist,

              const struct group_info *group_info)

{

    int i;

    unsigned int count = group_info->ngroups;



    for (i = 0; i < group_info->nblocks; i++) {

        unsigned int cp_count = min(NGROUPS_PER_BLOCK, count);

        unsigned int len = cp_count * sizeof(*grouplist);



        if (copy_to_user(grouplist, group_info->blocks, len))

            return -EFAULT;



        grouplist += NGROUPS_PER_BLOCK;

        count -= cp_count;

    }

    return 0;

}



/* fill a group_info from a user-space array - it must be allocated already */

static int groups_from_user(struct group_info *group_info,

    gid_t __user *grouplist)

{

    int i;

    unsigned int count = group_info->ngroups;



    for (i = 0; i < group_info->nblocks; i++) {

        unsigned int cp_count = min(NGROUPS_PER_BLOCK, count);

        unsigned int len = cp_count * sizeof(*grouplist);



        if (copy_from_user(group_info->blocks, grouplist, len))

            return -EFAULT;



        grouplist += NGROUPS_PER_BLOCK;

        count -= cp_count;

    }

    return 0;

}



/* a simple Shell sort */

static void groups_sort(struct group_info *group_info)

{

    int base, max, stride;

    int gidsetsize = group_info->ngroups;



    for (stride = 1; stride < gidsetsize; stride = 3 * stride + 1)

        ; /* nothing */

    stride /= 3;



    while (stride) {

        max = gidsetsize - stride;

        for (base = 0; base < max; base++) {

            int left = base;

            int right = left + stride;

            gid_t tmp = GROUP_AT(group_info, right);



            while (left >= 0 && GROUP_AT(group_info, left) > tmp) {

                GROUP_AT(group_info, right) =

                    GROUP_AT(group_info, left);

                right = left;

                left -= stride;

            }

            GROUP_AT(group_info, right) = tmp;

        }

        stride /= 3;

    }

}



/* a simple bsearch */

int groups_search(const struct group_info *group_info, gid_t grp)

{

    unsigned int left, right;



    if (!group_info)

        return 0;



    left = 0;

    right = group_info->ngroups;

    while (left < right) {

        unsigned int mid = (left+right)/2;

        if (grp > GROUP_AT(group_info, mid))

            left = mid + 1;

        else if (grp < GROUP_AT(group_info, mid))

            right = mid;

        else

            return 1;

    }

    return 0;

}



/**

 * set_groups - Change a group subscription in a set of credentials

 * @new: The newly prepared set of credentials to alter

 * @group_info: The group list to install

 *

 * Validate a group subscription and, if valid, insert it into a set

 * of credentials.

 */

int set_groups(struct cred *new, struct group_info *group_info)

{

    put_group_info(new->group_info);

    groups_sort(group_info);

    get_group_info(group_info);

    new->group_info = group_info;

    return 0;

}



EXPORT_SYMBOL(set_groups);



/**

 * set_current_groups - Change current's group subscription

 * @group_info: The group list to impose

 *

 * Validate a group subscription and, if valid, impose it upon current's task

 * security record.

 */

int set_current_groups(struct group_info *group_info)

{

    struct cred *new;

    int ret;



    new = prepare_creds();

    if (!new)

        return -ENOMEM;



    ret = set_groups(new, group_info);

    if (ret < 0) {

        abort_creds(new);

        return ret;

    }



    return commit_creds(new);

}



EXPORT_SYMBOL(set_current_groups);



SYSCALL_DEFINE2(getgroups, int, gidsetsize, gid_t __user *, grouplist)

{

    const struct cred *cred = current_cred();

    int i;



    if (gidsetsize < 0)

        return -EINVAL;



    /* no need to grab task_lock here; it cannot change */

    i = cred->group_info->ngroups;

    if (gidsetsize) {

        if (i > gidsetsize) {

            i = -EINVAL;

            goto out;

        }

        if (groups_to_user(grouplist, cred->group_info)) {

            i = -EFAULT;

            goto out;

        }

    }

out:

    return i;

}



/*

 *    SMP: Our groups are copy-on-write. We can set them safely

 *    without another task interfering.

 */



SYSCALL_DEFINE2(setgroups, int, gidsetsize, gid_t __user *, grouplist)

{

    struct group_info *group_info;

    int retval;



    if (!nsown_capable(CAP_SETGID))

        return -EPERM;

    if ((unsigned)gidsetsize > NGROUPS_MAX)

        return -EINVAL;



    group_info = groups_alloc(gidsetsize);

    if (!group_info)

        return -ENOMEM;

    retval = groups_from_user(group_info, grouplist);

    if (retval) {

        put_group_info(group_info);

        return retval;

    }



    retval = set_current_groups(group_info);

    put_group_info(group_info);



    return retval;

}



/*

 * Check whether we're fsgid/egid or in the supplemental group..

 */

int in_group_p(gid_t grp)

{

    const struct cred *cred = current_cred();

    int retval = 1;



    if (grp != cred->fsgid)

        retval = groups_search(cred->group_info, grp);

    return retval;

}



EXPORT_SYMBOL(in_group_p);



int in_egroup_p(gid_t grp)

{

    const struct cred *cred = current_cred();

    int retval = 1;



    if (grp != cred->egid)

        retval = groups_search(cred->group_info, grp);

    return retval;


Looks like a useless paper at this size.


Hey, I saw this on DONG! (things you can Do Online Now Guys)

I remember an older thread.
This is awesome.