sampritipanda

from pwn import *
from randcrack import RandCrack
from gmpy import gcd
from Crypto.Util.number import long_to_bytes
from Crypto.Cipher import AES

# proc = remote('crypto.chal.ctf.westerns.tokyo', 5643)
proc = process('./server.py')

# context.log_level = 'debug'

sampritipanda

#include <stdint.h>
#include <sys/io.h>
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <string.h>
#include <assert.h>

#include "virt_to_phys.c"

sampritipanda

from pwn import *

#r = process("/home/gift/run.sh")
r = remote("pwn01.grandprix.whitehatvn.com", 26129)
bin = ELF('./giftshop')
poprdi = 0x000000000000225f # pop rdi ; ret
poprsi = 0x0000000000002261 # pop rsi ; ret
poprdx = 0x0000000000002265 # pop rdx ; ret
putsplt = bin.plt['puts']
putsgot = bin.got['puts']

sampritipanda

#!/bin/bash

adduser sampriti
usermod -aG sudo sampriti
rsync --archive --chown=sampriti:sampriti ~/.ssh /home/sampriti

sampritipanda

#!/usr/bin/env python

import logging
import socket
import urllib
import ipaddress

import tornado.ioloop
import tornado.iostream
import tornado.web

sampritipanda

import struct
from z3 import *
from pwn import *
from ciphers import tbl, names, permute, xor
import hashlib
import binascii
import os

tbl_rev = [{} for i in range(6)]
for i in range(6):

sampritipanda

Keybase proof

I hereby claim:

• I am sampritipanda on github.
• I am sampriti (https://keybase.io/sampriti) on keybase.
• I have a public key whose fingerprint is 8DAA AC1F 77E6 78CF 752D 6DD7 2C5C 6A6A 2C52 02CB

To claim this, I am signing this object:

sampritipanda

var draft_model = (function () {
    var exports = {};

    // the key that the drafts are stored under.
    var KEY = "drafts";
    var ls = localstorage();
    ls.version = 1;

    function createKey () {
        // use the base16 of the current time + a random string to reduce

sampritipanda

gem 'nokogiri'  # Required for parsing webpages

sampritipanda

def recursive(a, b)
  n = a.length
  if n == 0 or n == 1 then
    p b
    return
  end

  (1...n).each do |i|
    recursive(a - [a[0], a[i]], b + [[a[0], a[i]]])
  end