Anyone can set up a tor-server, especially when you already have a web-server with a static IP address. Maybe I’ll blog about setting up a tor-node someday.If you’re interested to know how tor works: Tor-Project Overview You can find an overview of some tor-servers here.
://[^ ] \.[^ ] $", str(link))) ''' gets the domain name from valid URL ''' def get_domain(self, link): m = re.search("(^http[s]?
://[^/] )", str(link)) if m: return m.groups() return '' ''' recursive algorithm to scan website and it's plain HTML-contents ''' def __scan_page(self, link): # reject invalid URLs if not self.is_url(link): return # reject already processed links if link in self.__links or self.__unique_urls.count(link) = self.__max_http_get_urls): return # reject recursive repetitions if re.search("\..
The brute-force attack is, even though not the most sophisticated attack, still an attack with a high success rate, because users choose weak passwords. Brute-force is an algorithm that iterates all possible passwords assuming a certain charset. The overall number of permutations for a password with charset Example: How many permutations are needed by a brute-force algorithm in the worst case for cracking a password with alphanum charset (26 * 2 10 = 62 characters) and a password length of max. Answer – Polynomial function: 62 62 = 931.151.402 permutations So almost one billion permutations need to be analysed by a brute-force algorithm in a worst case scenario for cracking only 5 alphanums due to exponential growth.
Let’s assume we forgot our router’s password, but we remember that it contains max. Brute-force algorithm implemented in C : The following C brute-force algorithm calculates the number of permutations using the polynomial function mentioned above and uses that number as break-condition for its main iteration.
backup script: &2 && exit 1 [ -d $/ ] || dir=$ echo "Starting $(hostname -f)'s backup at $(date) ..." time tar --exclude=/dev/* \ --exclude=/lost found/* \ --exclude=/media/* \ --exclude=/mnt/* \ --exclude=/proc/* \ --exclude=/var/cache/apt/archives/* \ --exclude=/sys/* \ --exclude=/tmp/* \ --exclude=/usr/ports/* \ --exclude=/$/* \ -cpf - / | gzip --best #!
/usr/bin/python ''' from - programming a Web-Spider ''' import os import re import sys import urllib2 import urlparse ''' class Unique URLS: handles unique URLs ''' class Unique URLs: __urls = # URL-hash Key = (Protocol, Link, (GET-parameter names)), Value = amount) __max_kind = 0 # max.
Sometimes you’re overworked, sometimes you’re tired, sometimes you can’t focus on too many things simultaneously, sometimes you get sloppy. This is why the only secure way is to set up and use an environment and configuration which protects you even in situations when you make a mistake like accidentally accessing a target’s server without using a proxy which reveals your IP address. TOR: Commercial VPN providers are not trustworthy these days and we do not know if government agencies like the NSA have access to VPN providers and their servers, so don’t rely on them.
You’re better off using the tor-technology for anonymous browsing.
number of unique links def __init__(self, max_kind): n = max(max_kind, 1) self.__max_kind = n ''' transforms URL to unique link ''' def __transform(self, url): t = urlparse.urlparse(url) # get GET-variables from PHP URL q = re.findall("[? =;] )", url) # create unique hash from protocol, domain, url and GET variable names return (str(t) "://" str(t) str(t), tuple(q)) ''' add URL ''' def add(self, url): e = self.__transform(url) if not e in self.__urls: self.__urls[e] = 1 else: if self.__urls[e] == self.__max_kind: return False self.__urls[e] = 1 return True ''' count URLs of the same kind or all URLs ''' def count(self, url=''): if not url: return len(self.__urls) e = self.__transform(url) if not e in self.__urls: return 0 return self.__urls[e] ''' class Website: recursively scans websites and saves HTTP GET-parameter URLs ''' class Website: __domain = '' # website's domain name __links = set() # accepted URLs __http_get_urls = set() # HTTP GET-URLs __skipped = set() # skipped URLs __max_urls = 40000 # max URLs to evaluate __follow_links = 20 # max.
number of similar links to follow (see class Unique URLs) __max_url_length = 256 # max allowed length of URL __max_http_get_urls = 300 # max amount of HTTP GET-URLS to collect ''' Interface to class Unique URLs ''' __unique_urls = Unique URLs(__follow_links) ''' constructor accessing the website's URLs ''' def __init__(self, url): http = " https = "https://" c = 0 fn = '' # reject invalid URLs if not str(url).startswith(http) and not str(url).startswith(https): url = http url if not self.is_url(url): sys.stderr.write("not a valid URL: " url "\n") return # get domain name self.__domain = self.get_domain(url) print "domain:", self.__domain # check URL print "evaluating HTTP-code to URL '" url "' ...
Typically you need a username and a password to log into a protected area like facebook, twitter, forums or wherever you want to log into: In most scenarios usernames are public and easy to discover, but passwords are hidden or somehow encrypted. So, somewhere between the single character “a” and “zzzzz” the brute-force algorithm will finally find your password, because there is only a finite amount of possible password permutations based on a given alphabet and brute-force algorithms are designed to iterate every password’s permutation so it has to match eventually; it’s just a matter of time.Tags: Adult Dating, affair dating, sex dating