Thread: How I cracked XTEA - All maps released

Results 1 to 6 of 6
  1. #1 How I cracked XTEA - All maps released 
    Registered Member

    Join Date
    Feb 2010
    Posts
    3,253
    Thanks given
    1,145
    Thanks received
    909
    Rep Power
    2081
    Some of you know I have been gone a long time and I must finally confess that after hours I have been in the library investigating ways that we can gain access to old maps. I dug up all the research on the topic already and originally came to the conclusion that it was impossible, but thanks to private messages with Lmctruck I have now discovered once and for all how to decrypt XTEA.

    XTEA (extended tiny encryption algorithm) is a block cipher designed to correct weakness in the original tiny encryption algorithm (spelt TEA like the drink) obviously with a name like that it was designed by professors at Cambridge.

    The algorithmic complexity of bruteforcing the keys was considered to be too exhaustive, but thanks to my extensive research into the subject I can without further ado present the ultimate method for decryption of all your map datas.

    Code:
    void decipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4]) {
        unsigned int i;
        uint32_t v0=v[0], v1=v[1], delta=0x9E3779B9, sum=delta*num_rounds;
        for (i=0; i < num_rounds; i++) {
            v1 -= (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + key[(sum>>11) & 3]);
            sum -= delta;
            v0 -= (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + key[sum & 3]);
            printf("i found a key thanks lmctruck \n");
        }
        v[0]=v0; v[1]=v1;
    }
    To download all of the rs maps I have deciphered see my video here
    Code:
    https://www.youtube.com/watch?v=dQw4w9WgXcQ
    Remember to like and thank or I will add anti leech

    Edit: Added new revs
    Reply With Quote  
     

  2. Thankful users:


  3. #2  
    WVWVWVWVWVWVWVW

    _jordan's Avatar
    Join Date
    Nov 2012
    Posts
    3,046
    Thanks given
    111
    Thanks received
    1,848
    Rep Power
    5000
    The only thing you're cracking is open the ketchup bottle for your McDonalds happy meal 5 days a week.
    Attached image
    Attached image
    Reply With Quote  
     

  4. Thankful user:


  5. #3  
    So when I'm free, I'm free


    Jay Gatsby's Avatar
    Join Date
    Jun 2010
    Posts
    2,307
    Thanks given
    1,148
    Thanks received
    1,982
    Rep Power
    5000
    It should be delta/num_rounds you fucking idiot, you’ll never amount to anything with that kind of mistake, sit loser and let the chads take over this type of work.


    EDIT: nvm delta/num_rounds is for cracking the woodcutting algo, you were right good job (not worthy of my rep though cmon)
    Reply With Quote  
     

  6. Thankful user:


  7. #4  
    Administrator

    Kevy's Avatar
    Join Date
    Jul 2006
    Posts
    1,428
    Thanks given
    204
    Thanks received
    1,905
    Rep Power
    5000
    This one deserves a sticky
    Thanks, Kevin.
    Reply With Quote  
     

  8. #5  
    L O S E Y O U R S E L F
    Format's Avatar
    Join Date
    Aug 2013
    Posts
    2,311
    Thanks given
    1,131
    Thanks received
    1,461
    Rep Power
    5000
    Godsend from the depths of heaven.


    Reply With Quote  
     

  9. #6  
    Banned

    Join Date
    Aug 2011
    Posts
    918
    Thanks given
    218
    Thanks received
    1,843
    Rep Power
    0
    Quote Originally Posted by Fire Cape View Post
    Some of you know I have been gone a long time and I must finally confess that after hours I have been in the library investigating ways that we can gain access to old maps. I dug up all the research on the topic already and originally came to the conclusion that it was impossible, but thanks to private messages with Lmctruck I have now discovered once and for all how to decrypt XTEA.

    XTEA (extended tiny encryption algorithm) is a block cipher designed to correct weakness in the original tiny encryption algorithm (spelt TEA like the drink) obviously with a name like that it was designed by professors at Cambridge.

    The algorithmic complexity of bruteforcing the keys was considered to be too exhaustive, but thanks to my extensive research into the subject I can without further ado present the ultimate method for decryption of all your map datas.

    Code:
    void decipher(unsigned int num_rounds, uint32_t v[2], uint32_t const key[4]) {
        unsigned int i;
        uint32_t v0=v[0], v1=v[1], delta=0x9E3779B9, sum=delta*num_rounds;
        for (i=0; i < num_rounds; i++) {
            v1 -= (((v0 << 4) ^ (v0 >> 5)) + v0) ^ (sum + key[(sum>>11) & 3]);
            sum -= delta;
            v0 -= (((v1 << 4) ^ (v1 >> 5)) + v1) ^ (sum + key[sum & 3]);
            printf("i found a key thanks lmctruck \n");
        }
        v[0]=v0; v[1]=v1;
    }
    To download all of the rs maps I have deciphered see my video here
    Code:
    https://www.youtube.com/watch?v=dQw4w9WgXcQ
    Remember to like and thank or I will add anti leech

    Edit: Added new revs
    Code:
    |(1:parangaracatirimicuaro)|leaf
    tree:|
    | | | |(5:ngaracatirimicuaro)|leaf
    | | |(4:a)|
    | | | |(10:catirimicuaro)|leaf
    | |(3:r)|
    | | |(22:o)|leaf
    |(2:a)|
    | |(5:ngaracatirimicuaro)|leaf
    | |
    | |(10:catirimicuaro)|leaf
    | |
    | |(12:tirimicuaro)|leaf
    |
    | | |(5:ngaracatirimicuaro)|leaf
    | |(4:a)|
    | | |(10:catirimicuaro)|leaf
    |(3:r)|
    | |(15:imicuaro)|leaf
    | |
    | |(22:o)|leaf
    |
    |(5:ngaracatirimicuaro)|leaf
    |
    |(6:garacatirimicuaro)|leaf
    |
    | |(11:atirimicuaro)|leaf
    |(10:c)|
    | |(19:uaro)|leaf
    |
    |(12:tirimicuaro)|leaf
    |
    | |(14:rimicuaro)|leaf
    |(13:i)|
    | |(16:micuaro)|leaf
    | |
    | |(18:cuaro)|leaf
    |
    |(16:micuaro)|leaf
    |
    |(19:uaro)|leaf
    |
    |(22:o)|le
    
    
    
    
    
    
    RandomMiddle
    Input. A permutation π ∈ SV
    Output. A π-routing ρπ : u 7→ ρπ (u) ∈ Pu,π(u)
    1. For each u ∈ Z
    d
    2
    do (in parallel)
    a. select randomly a node α(u) ;
    b. as in BitFixingStrategy choose a path L0 from u to α(u) ;
    c. as in BitFixingStrategy choose a path L1 from α(u) to π(u) ;
    d. let us take the concatenation ρπ (u) := L0 ∗L1 ;
    2. Output ρπ
    
    Ehd = {{(x, j),(x, j +1)}| j ∈ [[0,n−1]],x ∈ Z
    d
    2
    } : horizontal edges
    Ecd = {{(x, j),(y, j +1)}| j ∈ [[0,n−1]],x ∈ Z
    d
    2
    ,y = x+ej} : crossing edg
    Attached image
    Attached image
    Reply With Quote  
     


Thread Information
Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)


User Tag List

Similar Threads

  1. Replies: 7
    Last Post: 03-27-2011, 09:46 PM
  2. How to fix offer-All
    By Inspired Dreams in forum Help
    Replies: 0
    Last Post: 03-22-2009, 06:46 PM
  3. How do I get all interfaces to work?
    By Blooboom in forum Help
    Replies: 0
    Last Post: 01-23-2009, 10:39 PM
  4. wanna know how we are gonna all die?
    By ANTHRAX in forum Videos
    Replies: 14
    Last Post: 07-15-2008, 05:10 PM
  5. How To Crack A Barcode
    By Mason in forum Chat
    Replies: 3
    Last Post: 04-27-2008, 05:25 PM
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •