Abstract
In graph theory, a long standing problem has involved finding
a closed form expression for the number of Euler circuits in
Kn. The solution presented here comprises a function D(x,y)
that has several interesting applications in computing.
Author: Professor John Dwyer
This project was born from the love of computing and communications, and the thrills of being able to overcome security measures in communication systems. The purpose of this project is to prove that it is possible for individuals to break though the barriers of GSM (Global System for Mobile communication) protection systems using common and publicly available tools. It has to be said in advance that devices able to intercept GSM conversations do exist; nonetheless these devices are only available to law enforcement agencies and special services.
Download PDF (2 MB)
Links:
http://lukenotricks.blogspot.com/2008/08/long-tail-of-vulnerability-for-a51.html
http://wiki.thc.org/gsm
http://cryptome.info/0001/a51-bsw/a51-bsw.htm