<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>

<channel>
	<title>Cipher</title>
	<atom:link href="http://www.cipher.org.uk/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.cipher.org.uk</link>
	<description>org uk</description>
	<pubDate>Fri, 18 Jul 2008 14:49:24 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
	<language>en</language>
			<item>
		<title>Source code review with AutoBugle</title>
		<link>http://www.cipher.org.uk/read/2008/02/05/source-code-review-with-bugle/</link>
		<comments>http://www.cipher.org.uk/read/2008/02/05/source-code-review-with-bugle/#comments</comments>
		<pubDate>Tue, 05 Feb 2008 22:23:40 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[bugle]]></category>

		<category><![CDATA[google]]></category>

		<category><![CDATA[Security]]></category>

		<category><![CDATA[source code]]></category>

		<category><![CDATA[tool]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/read/2008/02/05/source-code-review-with-bugle/</guid>
		<description><![CDATA[Some time ago I start creating a list of google queries (Bugle) people could use to hunt bugs in source code available in the web. The project started before Google Code Search, so the only way to point to source code was using the Filetype and <u>? * .</u> operators which worked pretty well. After a couple  of months Google announced the Code Search service and the accompanied API which made things much more interesting. Using the new Google service people  can supply full regular expression when searching and pinpoint to Bugs a bit more accurately.

Anyway, to cut a long story short, utilising <a href="http://jquery.com/" title="jQuery">jQuery</a>, <a href="http://code.google.com/apis/codesearch/" title="Google Code Search API">Google Code Search API</a> and <a href="http://www.cipher.org.uk/bugle.php" title="Bugle">Bugle</a>, I created an <a href="http://www.cipher.org.uk/projects/bugle/auto" title="AutoBugle">automated version</a> of the Bugle project which  looks as close as possible to a desktop based source code review tool.
 
<a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautosnapshot1.png" title="Bugle Snapshot"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautosnapshot1.png" alt="Bugle Snapshot" /></a><br />

To demonstrate Bugle Automated I will be looking for bugs in Samba. The first step is to add the package you want to inspect in the Scan field, as you can see below there is Auto Complete functionality available suggesting possible packages while you type a name.]]></description>
			<content:encoded><![CDATA[<p>Some time ago I start creating a list of google queries (Bugle) people could use to hunt bugs in source code available in the web. The project started before Google Code Search, so the only way to point to source code was using the Filetype and <u>? * .</u> operators which worked pretty well. After a couple  of months Google announced the Code Search service and the accompanied API which made things much more interesting. Using the new Google service people  can supply full regular expression when searching and pinpoint to Bugs a bit more accurately.</p>
<p>Anyway, to cut a long story short, utilising <a href="http://jquery.com/" title="jQuery">jQuery</a>, <a href="http://code.google.com/apis/codesearch/" title="Google Code Search API">Google Code Search API</a> and <a href="http://www.cipher.org.uk/bugle.php" title="Bugle">Bugle</a>, I created an <a href="http://www.cipher.org.uk/projects/bugle/auto" title="AutoBugle">automated version</a> of the Bugle project which  looks as close as possible to a desktop based source code review tool.</p>
<p><a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautosnapshot1.png" title="Bugle Snapshot"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautosnapshot1.png" alt="Bugle Snapshot" /></a><br />
To demonstrate Bugle Automated I will be looking for bugs in Samba. The first step is to add the package you want to inspect in the Scan field, as you can see below there is Auto Complete functionality available suggesting possible packages while you type a name.</p>
<p><a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep1.png" title="Scan form"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep1.png" alt="Scan form" height="108" width="267" /></a></p>
<p>After choosing a package, press scan an Bugle will do the rest.</p>
<p>The first screen you see is a bit empty , both the Main Panel and the Stats Panel will load as soon as you choose a vulnerability category from the left side. Bugle displays the number of issues of each category, so you can immediately get an general idea on where you might find a bug.</p>
<p><a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep2.png" title="Categories - Menu"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep2.png" alt="Categories - Menu" height="184" width="145" /></a></p>
<p>As soon as you choose a category a sub menu will be revealed, presenting all the different signatures in that category. At the same time the statistics Panel will load and all the relevant graphs for the project/categories and categories/signatures will be displayed.</p>
<p><a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep6.png" title="Bugle stats"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep6.png" alt="Bugle stats" height="149" width="303" /></a><a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep3.png" title="Graphs - Submenu"> </a></p>
<p>Next we choose the Buffer Overflows category, with 205 hits and then the Generic BoF signature (with 50 hits). The Main Panel loads and then we can see each individual line with a possible bug. We scroll down until we find something that could be a vulnerability and click on that line.<br />
<a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep4.png" title="Lines list"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep4.png" alt="Lines list" height="117" width="253" /></a><br />
We click the Line 117 of samba-1.9.15p8.mvs/source/sockspy.c and we inspect the code in the Code Snippet dialog. Then we scroll down until we find the  line with the yellow highlighted text<br />
<a href="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep5.png" title="Source code snippet"><img src="http://www.cipher.org.uk/wp-content/uploads/2008/02/bugleautostep5.png" alt="Source code snippet" height="372" width="392" /></a></p>
<p>We can see that   strcpy(DestHost,argv[1]);  is copying the arv[1] into the DestHost buffer which has 256 chars size. Now we can guess that if we pass in the command line DestHost larger than 256 chars we can create a buffer overflow condition. (Note that this bug in sockspy.c is in a very very very old version of Samba)</p>
<p>That&#8217;s <a href="http://www.cipher.org.uk/projects/bugle/auto/" title="AutoBugle">Bugle Auto Scanner</a>, hopefully this will assist in discovering and fixing bugs out there.</p>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2008%2F02%2F05%2Fsource-code-review-with-bugle%2F&amp;title=Source+code+review+with+AutoBugle" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2008/02/05/source-code-review-with-bugle/feed/</wfw:commentRss>
		</item>
		<item>
		<title>FuzzMan - man pages based fuzzer</title>
		<link>http://www.cipher.org.uk/read/2007/04/18/fuzzman-man-pages-based-fuzzer/</link>
		<comments>http://www.cipher.org.uk/read/2007/04/18/fuzzman-man-pages-based-fuzzer/#comments</comments>
		<pubDate>Wed, 18 Apr 2007 09:54:10 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[fuzzing]]></category>

		<category><![CDATA[idea]]></category>

		<category><![CDATA[tool]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2007/04/18/fuzzman-man-pages-based-fuzzer/</guid>
		<description><![CDATA[ Fuzzing using man pages This article is to introduce a (probably) new fuzzing idea  (FuzzMan)  that is built around man pages. Many know that in *nix systems if you type man command  you  will get a manual page informing you on how to use a specific tool. So by just [...]]]></description>
			<content:encoded><![CDATA[<p><img src="http://www.cipher.org.uk/images/fuzzman.jpg" /> <em>Fuzzing using man pages</em> This article is to introduce a (probably) new fuzzing idea  (<a href="http://www.cipher.org.uk/index.php?p=cipher/projects.cipher">FuzzMan</a>)  that is built around man pages. Many know that in *nix systems if you type <strong>man command</strong>  you  will get a <a href="http://en.wikipedia.org/wiki/Manual_page_%28Unix%29">manual page</a> informing you on how to use a specific tool. So by just looking at the manual  you can find out pretty much in seconds what type of argument and what options are offered by  any given command.</p>
<p>The format which man pages follow is universal (mostly), so it is not very difficult to  make a script and extract the offered options - which is exactly what gave me the idea of making a tool that can generate fuzzing data based on manual pages. Based on that  concept we can fuzz as accurately as possible any command that has a man page.</p>
<p>So lets take a command and generate fuzzing data.</p>
<p>The choice for this example is &#8220;shar&#8221; <em>- GNU sharutils 4.2.1</em></p>
<p><strong>Shar</strong>  creates  &#8220;shell  archives&#8221;  (or  shar files) which are in text format and can be mailed.  These files may be unpacked later by executing them with /bin/sh.  The resulting archive is sent to standard out unless the -o option is  given.</p>
<p>Below you can see how a man page looks in the console<br />
<img src="http://www.cipher.org.uk/images/fuzzman1.jpg" /><br />
or have a look at the On-line <strong>Shar</strong> <a href="http://www.linuxmanpages.com/man1/shar.1.php">Manual page</a>There are several options available for this command and therefore the fuzzer has to generate lots of combinations. Fuzzman catches signals so if you see that you have enough combinaitons you can press ctrl-c.<br />
if you type <strong>./fuzzman.pl shar</strong> you get :<br />
<code>=== Extract arguments for "shar" ===<br />
        STANDARD<br />
         : --version<br />
         : --print-text-domain-dir<br />
         : --help<br />
         : --version<br />
         :        -q<br />
         :        -p<br />
         :        -Z<br />
         :        -S<br />
         :        -z<br />
         :        -o<br />
         :        -l<br />
         :        -L<br />
         :        -n<br />
         .<br />
         .<br />
         .<br />
         : --no-i18n<br />
         : --print-text-domain-dir<br />
        ADDITIONAL<br />
         : EXTRA BoF Arg<br />
         : EXTRA Format String Arg<br />
         : EXTRA Numbers  Arg</p>
<p>:Number of Arguments :36 <strong>&lt;=== it is not 100% accurate</strong> but is very close</p>
<p>=== Generate Fuzzing Script ===<br />
+STOP GENERATOR WITH CTRL-C<br />
:Agrument combinations  : 1040  <strong>&lt;== This is the combinations counter</strong><br />
:Partial shar.sh, not all combinations have been generated<br />
:Run fuzzing script [sh shar.sh]</code></p>
<p>We can see above that there are approximately 36 options. That would create several thousand combinations so I stopped it at 1040 combinations. Fuzzman tried different options adding arguments that could potentially lead to different overflow types, now the shar.sh script is ready.</p>
<p>Starting the shar.sh will execute the command 1040 times.<br />
<img src="http://www.cipher.org.uk/images/fuzzman2.jpg" /><br />
As we can see above we hit into a bug, Segmentation fault is always a sign.</p>
<p>You can download Fuzzman from <a href="http://www.cipher.org.uk/projects/downloads/fuzzman.tar.gz">here</a>,<br />
Enjoy<em></p>
<p>Note: This version of Sharutils have been reported for both Buffer Overflow and Format string vulns some time ago  (<a href="http://www.securityfocus.com/archive/1/359639/30/0/threaded">here</a> and <a href="http://www.securityfocus.com/bid/11298/info">here</a>)</em></p>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2007%2F04%2F18%2Ffuzzman-man-pages-based-fuzzer%2F&amp;title=FuzzMan+-+man+pages+based+fuzzer" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2007/04/18/fuzzman-man-pages-based-fuzzer/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Hamachi Considerations</title>
		<link>http://www.cipher.org.uk/read/2006/11/03/hamachi-considerations/</link>
		<comments>http://www.cipher.org.uk/read/2006/11/03/hamachi-considerations/#comments</comments>
		<pubDate>Fri, 03 Nov 2006 17:31:58 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[Bugs]]></category>

		<category><![CDATA[Security]]></category>

		<category><![CDATA[vpn]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2008/01/27/hamachi-considerations/</guid>
		<description><![CDATA[ &#8220;Hamachi is a zero-configuration virtual private networking (VPN) application.&#8221;I was introduced to Hamachi last week, and I thought wow that sounds cool and easy. So I installed both windows and linux versions and start messing around. while I was using different networks, I noticed that if you start  typing random network names the [...]]]></description>
			<content:encoded><![CDATA[<p><img src="http://www.cipher.org.uk/images/hamachi_logo.jpg" /> <em>&#8220;Hamachi is a zero-configuration virtual private networking (VPN) application.&#8221;</em>I was introduced to <a href="http://www.hamachi.cc/">Hamachi</a> last week, and I thought wow that sounds cool and easy. So I installed both windows and linux versions and start messing around. while I was using different networks, I noticed that if you start  typing random network names the system sents back an obvious message saying if a network exists or not. I found that inappropriate, to illustrate an obvious use of that  I wrote a tiny perl script to detect different networks using the rather expected brute  force approach.</p>
<p><img src="http://www.cipher.org.uk/images/detect-hamachi.jpg" /></p>
<pre>Detect Networks script <a href="http://www.cipher.org.uk/projects/downloads/hamachiscripts.zip">Detect-hamachi.pl</a></pre>
<p>After that the next step was to see if the system returns a distinctive error if the network picked is correct but the password supplied is wrong. Again that proved to be the case, so the next step was to check on the network I created if there is any account lockout or IP blocking if I submit the wrong password several times. I send the wrong password 10 times and the account was still active. When considering the fact that someone creates a VPN to establish a secure tunnel between private assets this can be considered as an immediate security threat.</p>
<p>At this stage I modified the previous tiny script to go through a list of passwords given a valid  network name and the result was predictebale, found the valid password and join the network.</p>
<p><img src="http://www.cipher.org.uk/images/beef-hamachi.jpg" /></p>
<pre>Find valid Hamachi passwords script <a href="http://www.cipher.org.uk/projects/downloads/hamachiscripts.zip">beef-hamachi.pl</a></pre>
<p>A fast solution to the issue described is to &#8220;Block new network members by default&#8221;, there is an  option in the Security tab to do that.</p>
<p>All of the above are very simple observations, nothing on the protocol or implementation as such (also as far as I am concerned the project is closed source at the moment). Haven&#8217;t used it that much so if you see something wrong in here let <a href="http://www.cipher.org.uk/index.php?p=cipher/contact.cipher">me</a> know.</p>
<p>These scripts work only in linux and you need to have perl and hamachi installed.  Have a look at http://files.hamachi.cc/linux/README on how to install in linux , note in Debian  you need to create the /dev/net/tun device to make it work.</p>
<pre>mkdir /dev/net/tun
mknod /dev/net/tun c 10 200</pre>
<p>Note: The provided scripts are only for illustration purpose, use them only on networks you own.</p>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F11%2F03%2Fhamachi-considerations%2F&amp;title=Hamachi+Considerations" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2006/11/03/hamachi-considerations/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Hacking: A very brief Introduction</title>
		<link>http://www.cipher.org.uk/read/2006/10/18/hacking-a-very-brief-introduction/</link>
		<comments>http://www.cipher.org.uk/read/2006/10/18/hacking-a-very-brief-introduction/#comments</comments>
		<pubDate>Wed, 18 Oct 2006 17:40:15 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[guest post]]></category>

		<category><![CDATA[hacking]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2008/01/27/hacking-a-very-brief-introduction/</guid>
		<description><![CDATA[Guest Post by (Pascal.Cretain[AT]gmail.com)
An awful lot has been said about hacking, most of it is simply not true. Due to misinformation, ignorance, the decline of mass media, and other miscellaneous obscure powers, hacking has been associated with electronic crime, illegal access to forbidden realms, the pentagon, the FBI, the CIA, the Russian mafia, credit card [...]]]></description>
			<content:encoded><![CDATA[<p>Guest Post by <em>(<a href="mailto:Pascal.Cretain%20%5B%20at%20%5D%20%20%20gmail.com">Pascal.Cretain[AT]gmail.com</a>)</em></p>
<p>An awful lot has been said about hacking, most of it is simply not true. Due to misinformation, ignorance, the decline of mass media, and other miscellaneous obscure powers, hacking has been associated with electronic crime, illegal access to forbidden realms, the pentagon, the FBI, the CIA, the Russian mafia, credit card fraud, identity theft, software piracy, vandalism, corruption, murder and death. Give me a break. A hacker, in the original sense, is a person who is curious, inventive, intelligent, eager to learn, willing to discover (and perhaps fail a thousand times before achieving any result) alternative ways of using tools and ideas. Using a metaphor here, if I may, a hacker is a bit like a child; she likes to take things apart to see what�s inside, and find out how things actually work. A hacker likes to stretch things to their limits, use devices in ways they were not meant to be used, cross borders and break rules just for the sake of experimentation. A real hacker does not give a fuck about the potential trophy (be it a p0rn, software, monetary compensation, sensitive databases or anything else) waiting for her as soon she has gained access to a restricted domain using a creative, alternative route to circumvent the defence mechanisms in place. She might e-mail the system administrators to let them know that their security is crap, at best, leave everything impact, then move on to a new project. A hacker is more than anything else, a student, not a criminal mind, period. This definition is not necessarily restricted in the world of computing. One can hack in real life. If you decide that your TV does not have any positive effect on your life when it�s on, and decide to cover it with a table cloth, and use it to eat your breakfast on, then you have hacked your TV, in a primitive fashion. Well done, that�s a great starting point.</p>
<p>There is a reason why all this bad hype around hacking has been created. See, hacking is tightly bound with intelligence, creativity and free spirit. Now these attributes are a bit of a threat to governments, global regulators and other bodies �in charge� who want to run the show. To achieve their goal easily and effectively, the controlling powers need to have obedient, non-creative and certainly not very intelligent citizens under their supervision. Where this profit-making, control seeking �plan� is supposed to lead humanity is beyond me, still there is a good chance that this is the way things work nowadays. It is not a coincidence that formal education has degraded to simple (biased) information processing. Our schools, institutions, society and family do not encourage creative and alternative thinking. In fact, they are afraid of it. This concept can extend even more, taking into consideration our lives and career aspirations in general. As the freegan manifesto (<a href="http://freegan.info/?page=anotherview">http://freegan.info/?page=anotherview</a>) accurately proclaims, as much as capitalists like equating the free market with freedom, our lives are severely constrained under capitalism. Here in we are all expected to live within the rules of a specific narrow model. We go to schools that promote hierarchy and obedience while suppressing creativity and indoctrinating us with the patriotic dogmas and distorted histories of the dominant forces of our national leadership. We are compelled to fiercely compete for the best grades so that we can get into the best college, run up big debts on college loans that we will spend years paying off. Get good grades, get into the best grad school, get a high paying job, buy lots of stuff, buy a house and spend years paying off the mortgage, have kids, keep working to the point where out jobs become miserable unending chores, put our kids through college and grad school so they can start on the same cycle. We go through a mid-life crisis where we wonder what the point of it all is. We retire and get sick with degenerative diseases from a lifetime of eating an unhealthy, fast-food, meat based died and from sedentary living&#8211; miserable desk jobs and hours spent vegetating in front of corporate pablum on television. As we degenerate, bored, lonely, and isolated in a society that overvalues competition and undervalues community, we are shipped off to nursing homes, eventually end up in hospitals that attempt to prolong miserable and unhealthy lives, with surgical procedures and drugs and radiation treatments that are tremendously profitable to insurance companies, hospitals, physicians, and medical equipment and drug manufacturers, but do little to address the underlying issues of poor health and often make us even sicker. Eventually we die, providing income to the undertakers, coffin manufacturers, funeral parlours, and cemeteries to turn our corpses into formaldehyde filled hazardous waste that will not be cycled back into the ecosystem locked in boxes made of dead rainforest trees or strip-mined metals. This is considered &#8220;a successful life� for the Western middle class and lower portions of the upper class. Apparently, I got a bit carried away, but follow me and you will see where I am getting at.</p>
<p>Don�t panic, though, for all is not lost. We have the unbelievable luxury of living in the internet era. Now this is a whole new topic again, and a huge one indeed, but it is very relevant to this study for certain reasons. If you think back some years ago, access to information and knowledge was very, very different. First of all, there used to be one horrible restriction to acquire information: it had a price. To learn how to be a doctor, computer programmer, lawyer, journalist, biologist, builder, you had to buy many, expensive books and/or go to expensive schools. You very evolution itself was too damn hard, since every time you encountered a problem, an unknown condition in your field, you had to go to public libraries, make expensive telephone calls to other fellow professionals, spend time investigating and if you were lucky enough to find a solution, you would rely on it just because it was the only solution you were able to locate. It is not the case today. Today�s internet is a gift. An ever-changing, almost organic collection of all sorts of information that brings together individuals and ideas of all races, social classes, religions, scientific fields and arts. The power of this mechanism lies in its multi-inclusive nature. Looking for an answer to a question you might have, you are very likely to encounter tons of crap, some quite good approaches, and a few superb ones. You will, though, invariably gain the ability to evaluate, judge, search and think for yourself. And that, my friend, is a tremendous skill. In fact, it is the very root of becoming a superior human being and understanding the world you happen to live in, in depth, so you can make conscious choices and reject this or that lifestyle that �they� are trying to enforce upon you. Computer (or real life) hacking just happens to be one of the benefits drawn from this new skill that you will (hopefully) acquire. So, if there is one service you have to buy in this damn world, it is, in my humble opinion, a good internet connection. Get DSL. Assuming that living in London you speak English, internet access is all you are ever going to need ( provided that you have a computer � a crappy one will do, get your uncle�s old PC that she was planning to donate to charity if you have to), plus some spare time to invest.</p>
<p>Trust me in this one, reader: It will not always be like that. The internet is a very new invention, and a very groundbreaking one. As it happens with all radical inventions in the history of mankind (the wheel, electricity, relativity) it takes quite some time until people are eventually able to govern the new invention�s power, and restrict its potential misuse through many rules, legislation and supervision. The early stages are somewhat �experimental� and very liberal. Man (including the superior forces running the show) has realised the full potential of the internet as a generous profit-making source. Due to the fact that one of our main characteristics is greed, people got quickly addicted (and dependent) to the internet, and now refuse to let go. Fortunately for the rest of us, not profit-oriented, various healthy tendencies including open source information exchange grew in parallel and got their place quietly in the internet. Because of the fact that no-body actually �owns� the internet, it is deemed very unlikely that the internet is going to shut down some time soon for �general maintenance and regulations introduction�. Control is happening, though. Slowly it spreads over the wires through mechanisms like legislation, and sniffing. There are however countermeasures to being supervised: Cryptography is a good one. Cryptography has been made available to the masses about a decade ago through a program called PGP (Pretty Good Privacy) written by a genius hacker called Phil Zimmerman. Cryptography is another, very complicated issue that we are not going to cover here, but it is worth mentioning that the strength of your encrypted messages relies on the size (in bits) of the encryption algorithm. If 40 bits are used, it�s quite easy to decrypt. If 256 bits are used it�s bloody difficult, even for governments or intelligence agencies to decrypt your message. This is because the extent of difficulty introduced to a cipher by adding just one bit doubles, so that a cipher with 41 bits is twice as hard to crack (takes twice the time) compared to one using 40 bits. This is why the US government has put restrictions to the exports of cryptographic algorithms (40 bits I think), and they have classified cryptography under �weapons� so that they can maintain control of the game. Moral of the story: (Ab)use the internet in its present form, for it might not last that long.</p>
<p>While it is possible to hack computer networks without being a programmer (or at least being able to read and understand code) I strongly suggest you acquire that skill. Remember, the goal is not to scratch the surface (as sick of it all says), but to get a shovel and start digging. If you want to hack wisely, you have to understand how the tools you are going to use actually work. That�s why I personally support the �open source� approach, because it gives you access to the underlying architecture of all the tools you are using. In that way, you can really understand what�s going on behind the scenes, and perhaps modify anything as you see fit. The languages commonly used in the computer security field are Ansi C (often used in a scripting approach under the UNIX shell), and many general purpose scripting languages such as Tcl, Perl and Python. I have seen apps recently written in pure Java, though this language is generally not preferred in the underground. Moreover, you must get acquainted with the basic concepts of computer networking. There are a few protocols which are extremely popular and you should know how they work. These include the TCP/IP protocol suite (including UDP and ICMP), the mail protocols (POP3 and SMTP) and various others such as HTTP. You should also get familiar with the major Operating Systems, Windows and Linux. There are things you can do with one but can�t with the other, so you should learn and use both. If you have no fuckin� clue what I�m talking about in these last few lines, then I strongly urge you to get an internet connection (see above), and start using www.google.com to educate yourself. I shall warn you here, reader, that the legislation on computer attacks is rapidly changing, and getting stricter every day. So as soon as (and if) you ever start launching attacks against computer networks, be sure to launch them against networks you own, or ones that you have formal authorisation to perform testing against, to avoid getting in trouble. It is perfectly possible to hide your tracks and clean up your mess effectively, but it is a very daunting task, something that comes with experience. As a newbie, you might as well forget about it for the time being.</p>
<p>I suspect what you might be thinking �Hey, that�s all good, now teach me how to hack!�, and, gee, I really hope that I�m wrong. See, there is a reason why I decided to release this document in this very event - the resistance festival. Taking into account the fact that you came here, you are quite likely a person who already has an �alternative� approach to life. You try to differentiate yourself from the mass through unconventional music and other art forms, �revolutionary� appearance (we have all been there at one time or another), maybe travelling and the likes. If you have followed me until this point, you have hopefully realised that the mission of this document is not to provide some quick guide to getting porn and certainly not illegally accessing your girlfriend�s hotmail account. It is to teach you how to be a creative problem solver, and how to seek knowledge. The means employed to try and get you started is computer hacking. This is because it just so happens that I have an elementary knowledge of this field, I consider it interesting, and I feel that there is a great potential to it. If, on the other hand, you are one of them people who want to learn how to hack computer systems because it is considered �elite�, or to get some free shit, while not having genuine interest in improving yourself, perhaps the security mechanisms employed in the IT industry nowadays, and eventually getting (more) wise then to hell with you anyway. Forget you ever read this document and go back to whatever you were doing. The community does not need you.</p>
<p><strong>Section II: Doing it</strong><br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;- Although I have been fiercely propagating creativity, I do believe that it is important to follow (not religiously though) a standard methodology when hacking. This ensures that you hack effectively and do not forget any necessary steps due to your enthusiasm or various other reasons. Of course, the methodology you choose should be one you have studied thoroughly (or created it yourself � even better), and customized to your specific needs. What we are talking about, here, is a hacked methodology, by means of our prior definition of what hacking essentially is. A nice, open-source methodology for security testing is provided by the fine folks at ISECOM, and is called OSSTMM. I suggest you have a look at it. Now moving on to the juicy bits.</p>
<p><strong>Step 1: Profiling the target (fingerprinting): </strong>Just like in real life, the first thing you need to when planning an attack is information gathering. If your target was to break in a house, you wouldn�t just smash the window and enter, not if you didn�t want to get busted that is. The same goes for hacking. You main source to gather information is, you guessed it, the internet. Use the main search engines (Google is good, but there�s tons of other search engines that you might want to have a look at, see Fravia�s ww.searchlores.org to learn how to find anything and everything on the web). Identify IP addresses, Domain Name Servers, telephone numbers (might come in handy for war dialling) , key personnel names; try to find messages in public message boards seeking technical information on specific problems they might have, for this might reveal specific software or hardware they are running, as well as version numbers. Gather e-mail addresses and e-mail server IPs, articles written by the target�s personnel, whatever seems relevant and you can lay your hands on. Use tools such as SamSpade, query the public Whois databases (like www.ripe.net), do what you have to do, be creative. This way, you will plot a nice picture of the target, though public channels, without having to query the target at all. This phase might seem dull to you, but it�s the quintessence of hacking. Without this information, you will be surely lost and helpless, in danger of knocking other people�s virtual doors, or even worse, knocking in vain where it is unlikely that you will ever get an answer.</p>
<p><strong>Step 2: Scanning &amp; Beyond:</strong> Now comes the point where you reckon you have gathered enough information to start getting more active. You have discovered several public facing devices perhaps a couple of firewalls, routers, Web and Mail Servers and you wonder what you can do to them. This is when you start scanning your target. The art of scanning attempts to find out what particular services and program daemons are listening, and on which ports. While there are several methods (Xmas, Null, Full, UDP) to discover such information, the most common and effective one is to send synchronisation (SYN) requests to your target. This is also known as the half-open TCP connection, and usually it manages to obtain a list of ports which demonstrated an interest, revealing that there is something running there. When there is something running, it can probably be exploited. You can use tools like Nmap by Fyodor, or Superscan(GUI)/Scanline(command line) by Foundstone. There are many free scanners out there, you go and have a look for yourself. An indispensable part of port scanning is the so-called banner grabbing. This functionality is included nowadays with many of the freely available scanners and what it does is try to tell you more about what it has found, such as which piece of software is active, what version it is running etc. There is a beautiful tool capable of doing myriads of things, that might help you in this goal too, and this tool is called NetCat. Netcat tries to establish a remote connection to a user-defined port, and sometimes it can achieve that, often revealing sensitive, useful information that will help you better profile your target�s vulnerabilities. Alternatively, you can use a splendid free tool called Nessus, which does just that, without getting you into manual trouble at all. Nessus is a general purpose scanner, which runs off a constantly updated vulnerability database. If you run Nessus against your target, it will inform you of any specific holes it has found, and will propose remedial action. If you like it manual, though, you can now browse to a public vulnerability database (hint: www.securityfocus.com), and see which (if any) exploits are applicable in your situation.</p>
<p><strong>Step 3: Exploitation:</strong> There you are, you have found at least one machine that�s running a service vulnerable to some exploit you are now aware of. You can try to exploit the hole reported, using publicly available exploit code, or when you have become a competent hacker, perhaps write your own exploit. Not all exploits will provide you with System privileges in your target system; many of the security problems are of a different nature, some can cause Denial of Service Attacks (another big topic), others are related with more subtle issues, such as ineffective logging. Give it a try, though. See if the problem you have spotted is likely to cause �remote arbitrary code execution�. If the problem is a buffer overflow, your chances are good. Check out the MetaSploit framework, an experimental website dedicated to exploit development and research. With some luck, you might end up having System privileges in your target network. This effectively means you can do whatever you want. Even if you have not achieved to break in with Systems privileges, you might try to escalate your privileges while inside. For that, you can use local exploits, a different family of exploits. Use your imagination and creativity. There is no strict rule as to what you can do. You can attempt to go even further, perhaps by obtaining a copy of the local password file. In modern OSs, the password file is encrypted so you �d better transfer a copy of the password file to your local machine and try to crack it later using one of the many, free password crackers. You might now be thinking �Hey what�s all that crap you said before that strong cryptography is extremely difficult to crack�? There is one condition under which cryptography is effective: that the user chooses a good password. See, most of the times the cryptographic algorithm generates a hash of the password provided. A hash is a mathematical one-way function that�s meant to be extremely difficult to reverse. What password crackers do, effectively, is to try to match weak passwords (taken from password lists) with the equivalent entries in a hash file. A different approach (more lengthy indeed) is to try all possible combinations to match a password and its hash. These approaches are tagged Dictionary and Brute Force attack, respectively.</p>
<p><strong>Step Null: Web Application Hacking:</strong> A category of devices that deserves special treatment is that of Web Servers. To you, the newbie, this probably can be interpreted as website hacking. Websites sit on machines called Web Servers, which run special software to achieve their goal (serve web content to you). We classify this as �application hacking� because most of the stuff runs at the application (the highest) layer of the OSI seven-layered model. There�s a bunch of nasty things you can do to web applications, including, but not limited to SQL injection, path traversal, and cross site scripting. The list goes on. For a very good interactive tutorial on application testing, I refer you to the WebGoat (www.owasp.org). As far as automated Web app scanning, there�s a fine tool called Nikto which launches specialised attacks to test security and/or patching level. Manually speaking, there�s a suite of tools called proxies which you will find very useful if you are interested in application testing. Proxies basically sit between you and the web server, acting as a man-in-the-middle. All requests that you send to the web server can be intercepted and modified by the proxy before they leave your machine. In this way, you can craft customised requests, mess around with HTTP, manipulate cookies, change fields as you see fit, and see what happens. Some nice, free proxies for Windows are Odysseus, Achilles and WebScarab.</p>
<p><strong>Step Nullx02: Firewall Hacking / IDS evasion:</strong> Due to the increase in electronic attacks, the high availability of information and tools, and human stupidity, today�s IT landscape is very tight. One can envisage a company�s network as a castle, without an easy way in. Devices called Firewalls can be thought of as the walls protecting the castle; Intrusion Detection Systems can be viewed as dog guards. What a firewall effectively does is take the responsibility to define which services and protocols will be allowed in and out of the caste. It�s a passive, but effective, means of defence if configured correctly. IDS systems usually work with attack signatures. Their role is to be more energetic, logging and preventing potential attacks. They also attempt to stop so-called 0-day hacks by applying intelligent hostile activity recognition methods to incoming traffic, even when there is no actual match to one of the attack signatures in the database. Firewall hacking is difficult and requires skill and creativity. One simple approach is to try and tunnel hostile traffic through a port/service that is being permitted by the firewall �officially�. Port 80, the one used to allow internal users to browse the web, is a good candidate for experimentation. IDS systems evasion can also be a difficult task, because these systems are getting more and more intelligent as we speak. One straightforward approach to attempt to cause confusion is packet fragmentation. Using tools such as the fragrouter by Dug Song, the IDS systems cannot tell with certainty whether the incoming packets constitute an attack or not, because the structure of the packets differs from the signatures in the IDS� database. To be honest with you, this last step is a bit advanced, but I thought I�d mention it here since I had some free space, and it�s an important section in the IT infrastructure.</p>
<p><strong>Considerations &amp; Conclusions:</strong> As I said before, hacking in our era can be dangerous. Needless to say here, I do not have responsibility if you do anything stupid with the knowledge and tools that you became aware of in this document. Handle with caution. Other than that, may I wish to you, reader, good luck in you journey to knowledge through hacking. It is a difficult and certainly long journey, and you will often feel disappointed and might consider quitting. I strongly suggest that you stay, though, for it is a fascinating field and many interesting people are involved in this. I wish to stress one more time, here, that if you feel like staying with us, please do it right, and don�t be one of these lusers who go out there and Change HTML (the equivalent of Spray painting) in some old, forgotten, unprotected and unpatched web servers operated, perhaps, by the catholic church of Stoke-on-Trent. These people give a bad reputation to hacking, and are certainly not hackers themselves.</p>
<p><strong>Contact:</strong> That�s it reader. I hope you have gained some useful information from this document I composed. Even more, I hope that you might be inclined to research these issues for yourself, hopefully under the right ethics and mentality, as a true hacker should. Obviously, this is just an A4 you�re holding so you probably didn�t expect me to fit in here even more information than I already did. Feel free to contact me with your opinion/feedback on this paper. If you intend to ask me any questions, though, be very careful. If you manage to convince me that you have spent considerable time on research, tried different approaches, used your brain but still have not managed to reach a sound conclusion, I will be more than happy to help you. (If I know the answer, which I seriously doubt for I am a novice as well). If, on the contrary, you send me an email with a very lame question that clearly demonstrates you fall into the dreadful category of hotmail password seekers/lazy lusers that want everything served to them without moving their little finger, then I am afraid that I will not reply to you, hell I might even try to spam your mailbox (joke). I�m sorry if my communication approach does not satisfy you, but these are the rules of the game. Take care.</p>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F18%2Fhacking-a-very-brief-introduction%2F&amp;title=Hacking%3A+A+very+brief+Introduction" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2006/10/18/hacking-a-very-brief-introduction/feed/</wfw:commentRss>
		</item>
		<item>
		<title>The Semantic Web</title>
		<link>http://www.cipher.org.uk/read/2006/10/12/the-semantic-web/</link>
		<comments>http://www.cipher.org.uk/read/2006/10/12/the-semantic-web/#comments</comments>
		<pubDate>Thu, 12 Oct 2006 10:34:20 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[guest post]]></category>

		<category><![CDATA[semantic web]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2006/10/12/the-semantic-web/</guid>
		<description><![CDATA[Guest Post (by Nick Lagos)
&#8220;The bane of my existence is doing things that I know the computer could do for me.&#8221; &#8212; Dan Connolly, The XML Revolution
In 1989, Tim Berners-Lee, a British researcher working at CERN (Conseil European pour la Recherche Nucleaire), envisioned the birth of a linked information system that would offer efficient access [...]]]></description>
			<content:encoded><![CDATA[<p id="main">Guest Post (by <a href="http://www.mec.cf.ac.uk/%7Escenl">Nick Lagos</a>)</p>
<p id="main">&#8220;The bane of my existence is doing things that I know the computer could do for me.&#8221; &#8212; Dan Connolly, The XML Revolution</p>
<p>In 1989, Tim Berners-Lee, a British researcher working at CERN (Conseil European pour la Recherche Nucleaire), envisioned the birth of a linked information system that would offer efficient access to data, regardless of the program or terminal in use. That led to the creation of the World Wide Web. Nowadays, the essential property of the World Wide Web is its universality. This constitutes both power and weakness, as anything can be found but the amount of information included is enormous and thus unmanageable. In order to confront the problem of information proliferation, changes have to be made to the current structure of the Web. Along these lines, Tim Berners-Lee proposed the reformation of the Web, as it exists, to the &#8220;Semantic Web&#8221;. As Berners-Lee argues &#8220;the Semantic Web is not a separate Web but an extension of the current one, in which information is given well-defined meaning, better enabling computers and people to work in co-operation�the challenge of the Semantic Web, therefore, is to provide a language that expresses both data and rules for reasoning about the data and that allows rules from any existing knowledge-representation system to be exported onto the Web&#8221; (Berners-Lee et al. 2001).</p>
<p>So, the Semantic Web should provide enhanced information access based on the exploitation of machine-processable metadata. Facilities to put machine-understandable data on the Web are becoming a high priority for many communities. The Web can reach its full potential only if it becomes a place where data can be shared and processed by automated tools as well as by people. For the Web to scale, tomorrow&#8217;s programs must be able to share and process data even when these programs have been designed totally independently. The Semantic Web is a vision: the idea of having data on the Web defined and linked in a way that it can be used by machines not just for display purposes, but for automation, integration and reuse of data across various applications (W3C 2002).</p>
<p>But in order for the Semantic Web to become successful, it has to be based on the principles that made the current World Wide Web successful. According to Goble (2003) these are its scalability, by challenging assumptions on link consistency and completeness, and its simplicity. So the challenges that emerge for the semantic technologies to be brought in the Web are (Goble 2003):</p>
<ul>
<li>�	The Web is vast, so solutions have to scale. Reasoning engines must perform quickly and robustly.</li>
<li> The Web is here&#8211;we have a legacy so we will have a mixed environment where some resources are &#8220;semantic&#8221; and some are just &#8220;Web&#8221;. We must have a clear and achievable migration path from non-semantic to semantic.</li>
<li> The Web is democratic&#8211;all are knowledge acquisition experts and all are knowledge modellers. The barriers of admission must be low enough for most users to participate to the degree that is appropriate for them.</li>
<li> The Web grows from the bottom. Most people wrote their first HTML by editing a third parties. The Semantic Web will arise from fragments of metadata copied in a similar way.</li>
<li>	The Web is volatile and changeable&#8211;resources appear and disappear, resources change.</li>
<li> The Web is dirty&#8211;there is no way to ensure consistency or whether information is trustworthy, and provenance is unknown. However, tolerance of error does not necessarily mean one should be oblivious to it.</li>
<li> The Web is heterogeneous&#8211;no one solution or one technology will be adopted; no one set of metadata will apply to a resource. Agreements are difficult, and mappings and translations will be common place.</li>
</ul>
<p>Towards achieving the attainment of the Semantic Web, the development of three major technologies is needed. These are: a language that allows users to add structure into their documents easily and in a uniform way, a framework that would add meaning to the evolved structure and an entity that would solve the problem of communication. Each of these technologies will be presented and discussed in future sections.</p>
<p>Useful links:<br />
http://www.w3.org/2001/sw/ (W3C&#8217;s page, the power behind the Semantic Web)<br />
http://www.semanticweb.org/ (Community for the Semantic Web)<br />
http://rdfweb.org/ (Example of a Semantic Web application)<br />
http://www.w3.org/DesignIssues/Semantic (Roadmap to the future for the Semantic Web)<br />
http://ftrain.com/google_takes_all.html (Why Google marketplace became so successful?)<br />
http://www.netcrucible.com/semantic.html (How can you make a semantic web site?)</p>
<p>References</p>
<ul>
<li>	W3C Semantic Web Homepage, http://www.w3.org/2001/sw/ (21 November 2002).</li>
<li>	Goble, C. 2003. The Semantic Web: an evolution for a revolution. In: Computer Networks, Volume 42, Issue 5, pp. 551-556.</li>
<li>	Berners-Lee, T.; Hendler, J. and Lasilla, O. 2001. The Semantic Web. Ed. Scientific American, Vol. 284, Issue 5, New York.</li>
</ul>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2006%2F10%2F12%2Fthe-semantic-web%2F&amp;title=The+Semantic+Web" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2006/10/12/the-semantic-web/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Applied Honeypots</title>
		<link>http://www.cipher.org.uk/read/2005/12/12/applied-honeypots/</link>
		<comments>http://www.cipher.org.uk/read/2005/12/12/applied-honeypots/#comments</comments>
		<pubDate>Mon, 12 Dec 2005 17:40:15 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[honeypots]]></category>

		<category><![CDATA[Security]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2005/12/12/applied-honeypots/</guid>
		<description><![CDATA[Track Big Brother using HoneypotsAlthough honeypot�s main application is to create attractive traps for hackers, there is a good opportunity for hackers to track governmental or other information gathering agents using the same method. A scenario like that would be a really big breakthrough into the world of secrecy, since top secret tools and techniques [...]]]></description>
			<content:encoded><![CDATA[<p><strong>Track Big Brother using Honeypots</strong>Although honeypot�s main application is to create attractive traps for hackers, there is a good opportunity for hackers to track governmental or other information gathering agents using the same method. A scenario like that would be a really big breakthrough into the world of secrecy, since top secret tools and techniques will be revealed to the public. Can you imagine how difficult will be to make an investigation if the agent who is doing it is not sure if the system he is �logged� is a honeypot or not? It is almost sure that someone who will be able to track a government agent searching into his data will be able to go to the court and have evidence of this intrusion into his system. The legal issues of something like that will be rough to solve. The main steps of achieving an entrapment of an agent into a honeypot are two and commonly used by governments and organisations to catch hackers. A hacker can use the same plan the �enemy� uses.</p>
<p>Reputation<br />
Content</p>
<p>Both of these steps are not difficult to achieve. Reputation: make some public noise about a particular illegal service you provide through your system so an agent will notice it (public noise is not difficult these days, especially via the web).</p>
<p>Content: create some fake �illegality� in your system so it can convince an observer.At this point government knows about the service you provide but since there is not any evidence about you they need to make some analysis of your system/data using forensic techniques, which most likely will be launched remotely. Note that they (government) want to see your system work in real-time so they won�t stop it. Now that the hacker expects to be under investigation the only thing that he has to do is, shit back and watch. The honeypot is been used against government so we can expect it to give us some really interesting feedback. Most likely we would see exploits that haven�t yet published, tools that are in total secrecy, and we might see some techniques to detect the existence of a honeypot.</p>
<p>As we can see, honeypots are tools which can provide good analysis of a particular attack, but we must remember that every publicly available tool can be used by all the people, so the question created is, honeypots help investigators or hackers? The power that a hacker can gain using the previous technique can make him/her almost untouchable; no one would want to hack into his/her system to do investigation since the only thing that they will achieve is to give more knowledge �out�.</p>
<h3>Honeypots &amp; Worms</h3>
<p>Worms are small entities, which spread �around� using well-known vulnerabilities, with a main purpose to intrude inside a system and be able to attack from that host others and spread [http://www.securityfocus.com/infocus/1740]. Worms can �Damage� or do �Good�, depended the way you use them. Mostly written by computer hackers and researchers, although many times antivirus companies create them for the obvious reason to make money. In order to find out how a honeypot will be useful against a worm, we need to know the most known characteristic of a network reaction during an attack. When a worm is lunched we can observe aggressive flow of traffic and bandwidth reduction. The first hint that a worm is �around� is observed, now we can watch for a specific steps usually a known worm does, for example, if we have an attempt on port 135 of our system and the particular packet is giving known signatures of MSBlast we can be sure what is going on and send the worm to a controlled honeypot or honeynet to observe how this worm works and at the same time secure our network from the attack.</p>
<p>The previous example is known as a defender honeypot and is based on gateway, which is acting once as a firewall and then as IDS. We have content analysis, traffic analysis, and source code analysis and port alarms. It is obvious from what we saw above that a system like that can work in case a worm is known and predictable, which in most cases will work, but during the attack of a new and unknown worm a honeypot might do damage instead, and send the worm inside our secure network. This confusion can be caused also from worms which are using encryption and/or polymorphism so it is really difficult for a honeypot to be sure if there is a worm attack or just e.g. a network problem. In a situation like that it is better to use a scheme called Sacrificial Lamb. We have to sacrifice a system in our network and leave the worm infect it. In this system we had previously created virtual hosts (using honeyd for example) in a very simple �topology � and big in number, so we could simulate 10.000 hosts, and see how the worm is moving inside that virtual network. 10.000 hosts is probably a good number to identify all the possible signatures of the worm and be able to update our honeypot-gateway/anti virus/firewall or IDS.</p>
<h3>Catch information thieves using honeytokens</h3>
<p>Some times the concept of honeypot needs to be applied to a specific information or collection of information instead of a system. In order to make this statement more clearly we can use a real life example [http://lwn.net/Articles/40925]. Lets say that you want to check if a service you are using in the internet is selling your personal information to a third party or spammers. The only way to do that is to give them some fault information and be able to confirm them.</p>
<p>An easy way to do that is, by having a different email address for every registering you are doing to different services. First you need to have your own domain name in order to do it easier, then enable email forwarding, so every email address you create under you domain name will send the emails to your main email address.</p>
<p>Let say that we want to open a user account with Amazon.com, during the registration process amazon will ask for a valid email address, this is where we will put our honeytoken , instead of using our main email address we put in this field : amazon.com@mydomain.com.</p>
<p>Now every time we receive an email, which is having as recipient amazon.com@mydomain.com we know that the information came out of amazon.</p>
<p>Another example is the Management�s emails. In this scenario we need to know if someone is trying to have access to a company�s high confidential information, which for example can be transferred via email. In order to achieve that we do the following: We create an email, which is having fake information about a server we are having online and this server is full of top-secret data.</p>
<pre>For example: 

Dear manager ,

These are the informations about the company�s
private server :
Server : TopSecret.company.com
Username : Manager1
Password : Password1

Regards ISDepartment</pre>
<p>This email is a real trap, we are sure that if someone will login into the system TopSecret.company.com will be an attacker. Then we can track him/her down easily. As we can see from the previous examples, honeytokens can be really helpful, although this technique is not new, especially in information intelligence world.</p>
<h3>Track Spammers with honeypots</h3>
<p>One of the biggest problems created using the fundamental tools of web is spamming. It is difficult to catch a spammer since the mailing system itself is not secure enough. Spammers usually use �open� (open relay) mail servers in order to do their attack. Although it is well known problem, many companies and ISPs don�t take any countermeasures to avoid a usage of their servers as a spam tool because they mostly don�t know that is happening, until it is very late and they get blacklisted.</p>
<p>We mentioned earlier Open Relay, this is an option in mail servers, which lets anyone in the Internet use your mail server and deliver emails. Although this service at the beginning of the Internet revolution had a reason of existence, now it seems like the good tool for spammers to deliver their �goods� [http://www.honeypots.net]. The main technique of spammers is to do an IP scanning combined with Service scanners in order to identify any mail servers for a given IP range. The next step is to check the found servers for an Open relay service; the usual way of doing the check is by sending an email to your self, using the server under �analysis�. The formal name for these tests is known as Relay Test message [http://www.tracking-hackers.com/solutions/sendmail.html].</p>
<p>Since we know the way that spammers work, we can place a honeypot and make it work as a Relay mail server, when the attacker will find that server, he will send the Relay Test message, now the honeypot knows that there is something wrong, but it will keep work as relay server and will return the relay test message. Now the spammer is sure that the server is open and he will try to lunch spamming attack. Our honeypot will be programmed to pretend that it sends all the emails the spammer delivers, in the meantime we will be able to do a research in the spammers Identity, for example find his IP, Location and ISP. Even if the attacker uses a proxy to do the work, we can track the proxy servers and inform the administrators about the misuse of their system.</p>
<p>This is a general idea on how we can use honeypots against spammers, more practical details on how to do that visit: http://fightrelayspam.homestead.com/files/antispam06132002.htm</p>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F12%2F12%2Fapplied-honeypots%2F&amp;title=Applied+Honeypots" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2005/12/12/applied-honeypots/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Cipher challenge</title>
		<link>http://www.cipher.org.uk/read/2005/05/02/cipher-challenge/</link>
		<comments>http://www.cipher.org.uk/read/2005/05/02/cipher-challenge/#comments</comments>
		<pubDate>Mon, 02 May 2005 18:12:07 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Challenges]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2005/05/02/cipher-challenge/</guid>
		<description><![CDATA[This is an experimental area in which I&#8217;ll post  some Cipher Challenges for you to solve , at the moment  it will not be anything fancy , retrieve the plaintext from  the following ciphertext and email it to me :

Challenge .1


FUKPGCZHZCI MVZKOC, QBH ZW DTS KR QGBW GM TCIDZTN  MVXCWLGAZ QHDSK [...]]]></description>
			<content:encoded><![CDATA[<p><img src="http://www.cipher.org.uk/images/cipherchallenge.gif" /></p>
<p>This is an experimental area in which I&#8217;ll post  some Cipher Challenges for you to solve , at the moment  it will not be anything fancy , retrieve the plaintext from  the following ciphertext and <a href="http://www.cipher.org.uk/index.php?p=cipher/contact.cipher">email</a> it to me :</p>
<dl>
<dt>Challenge .1</dt>
<dt>
</dt>
<dd>FUKPGCZHZCI MVZKOC, QBH ZW DTS KR QGBW GM TCIDZTN  MVXCWLGAZ QHDSK YP RMKDL RYUTSPQ  KDPC NSAGDKHZO PX CYRQDCK AQ AG IBZ P GRIU VBMQ CAK  PVOHLBZS WDM RWSDIFAYVX VCKL ABM RHOZGIS !  ST FRDP WQUG. PK UTH STBA INCS PK PT RPRQU UCT   CL Z WEBW AYPW XBAOREM JGGUH PS RUO WNM ZRTWDMC  BZWDPVRCG PA ZSI PGPV. HSPX SFVI W RFA TTYG NFICKQYKH</dd>
<dd>
</dd>
<dd>
</dd>
<dt>Hint 1 : <a href="http://www.picasso.fr/">here</a></dt>
<dt> </dt>
<dt> </dt>
</dl>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2005%2F05%2F02%2Fcipher-challenge%2F&amp;title=Cipher+challenge" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2005/05/02/cipher-challenge/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Phising Techniques</title>
		<link>http://www.cipher.org.uk/read/2004/07/22/phising-techniques/</link>
		<comments>http://www.cipher.org.uk/read/2004/07/22/phising-techniques/#comments</comments>
		<pubDate>Thu, 22 Jul 2004 12:44:30 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[phising]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2004/07/22/phising-techniques/</guid>
		<description><![CDATA[ Many Techniques exist on how to scam people  using email or websites. This is a list of these kind of scams so you can see them and recognise them.
(have your eyes open)
URL Obscurity
Using Password fields:
http://username:password@www.example.com/ 

Ex.
http://www:microsoft.com/download/@www.cipher.org.uk
This link will lead to cipher.org.uk and not Microsoft

Using different Base:
Dword Format
http://dword format
Generalised formula to convert to dword [...]]]></description>
			<content:encoded><![CDATA[<p> Many Techniques exist on how to scam people  using email or websites. This is a list of these kind of scams so you can see them and recognise them.</p>
<p>(have your eyes open)<br />
URL Obscurity</p>
<pre>Using Password fields:
http://username:password@www.example.com/ 

Ex.
http://www:microsoft.com/download/@www.cipher.org.uk
This link will lead to cipher.org.uk and not Microsoft

Using different Base:
Dword Format
http://dword format
Generalised formula to convert to dword format
Let say that we have a url http://a.b.c.d
DwordURL=((((a*256)+b)*255+c)*256+d)
so now we have http://((((a*256)+b)*255+c)*256+d)

Octal Format
http://octal
Generalised formula to convert to Octal
Let say that we have a url http://a.b.c.d
OctalURL= 0Base8(a).0Base8(b).0Base8(c).0Base8(d)
You need at least one leading zero.

Hex Format
http://hex
Generalised formula to convert to Hex
Let say that we have a url http://a.b.c.d
HexURL = Base16(a).Base16(b).Base16(c).Base16(d)
or
HexURL = Base16(a.b.c.d)

Using Redirection
Lets say that IBM use a script which can load another
webpage inside their main website :
e.g. :http://www.IBM.com/url?p=http://www.google.com.
You can use that to exploit trust.

Using Cross Site Scripting
Reported vulns on different web applications provide
crossscripting gateway for the Phiserman.

-Via Search engine
 Be sure that the search engine in your organisation
 doesnt accepts JavaScript,VBScript,HTML,JSP or
 any active content injection.
 Type that
 <javascript>alert(&#8217;css&#8217;)</javascript>
 if this doesnt work , go to a Hex converter and
 convert that into Hex. Then paste it in the
 search engine field and press search.
(If it is vuln attacker can use popup window
to gain trust)

Typographical domain Mistakes
Instead of paypal.com,paypai.com,paypa1.com
Gain trust exploiting human vision.

Visual spoofing
Is possble if :
You create a popup window which you set it not
to have scroll bars,status bar etc. You reporgram
the interface with javascript and you add SSL lock. 

Browser Bugs
Using different browser bugs you can fake
url or a Certificate :

-Extensive amount of characters can disable
 status bar view of a link
-Using <a href="http://www.cipher.org.uk/index.php?p=advisories/Certificate_Stealing_Phising_IE_30-04-2004.advisory">this</a> You can gain trust using someone else&#8217;s
Certificate and URL.(new bugs come every day)

Proxying
Fake direct session using proxy. Provide a link
to a legitimate website,using any of the previous
bugs, load the legal website via you proxy. SSL
certificate,forms,webpages &#8230;everything will be
real but everything will be passed to the victim
via your proxy , so you can sniff the communication.

Historical Phising Example
http://www.math.org.il/pic.gif</pre>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F07%2F22%2Fphising-techniques%2F&amp;title=Phising+Techniques" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2004/07/22/phising-techniques/feed/</wfw:commentRss>
		</item>
		<item>
		<title>NetBSD on Cobalt RAQ1</title>
		<link>http://www.cipher.org.uk/read/2004/03/18/netbsd-on-cobalt-raq1/</link>
		<comments>http://www.cipher.org.uk/read/2004/03/18/netbsd-on-cobalt-raq1/#comments</comments>
		<pubDate>Thu, 18 Mar 2004 14:54:50 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[cobalt]]></category>

		<category><![CDATA[netbsd]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2004/03/18/netbsd-on-cobalt-raq1/</guid>
		<description><![CDATA[ 
Install NetBSD on Cobalt RAQ1 Why install netbsd on a Cobalt RAQ ? cause the restore OS they provide is  so old and unsupported it can be considered Dead, plus NetBSD is cool.
After I got my own small and pretty RAQ1

I had a big problem on which OS to install. Although the obvious [...]]]></description>
			<content:encoded><![CDATA[<p id="main"> <img src="http://www.cipher.org.uk/images/netbsdlogo.jpg" /><br />
Install NetBSD on Cobalt RAQ1 Why install netbsd on a Cobalt RAQ ? cause the restore OS they provide is  so old and unsupported it can be considered Dead, plus NetBSD is cool.</p>
<p>After I got my own small and pretty RAQ1<br />
<img src="http://www.cipher.org.uk/images/raq_cobalt.jpg" /><br />
I had a big problem on which OS to install. Although the obvious route was Cobalt OS restore CD (a very old debian) it had many problems, it supports only a very limited number of ethernet cards both in desktops and laptops and  it has many outdated or unpatched services. The best choice to my opinion(and not only) is NetBSD which has a port for Cobalt (MIPS)  and almost for any other machine with hard drive and memory on the planet.</p>
<p>So what do you need to do that ?</p>
<ul>
<li>Download an iso from  	<a href="ftp://ftp.netbsd.org/pub/NetBSD/arch/cobalt/restore-cd/1.6.1">here </a> 	and download this file :image_raq1.iso.gz . Create an ISO cd and we are almost done.</li>
<li>Have another working machine ready to act as the host for the net-installation.</li>
<li>X-over cable or a hub with only these 2 machines connected on.</li>
</ul>
<p>Put the cd inside your destkop/laptop and boot it up from the cdrom (set your bios). Wait until the instructions screen come up. After that press &#8216;q&#8217; and login as &#8216;root&#8217; . There is no password so don&#8217;t worry. As soon you are &#8220;shelled&#8221; type &#8216;ifconfig -a&#8217; and if your nic card is recognised you can  start preparing the space on your desk for you RAQ (Otherwise find another computer  and do the same).</p>
<p>Now connect your RAQ with the desktop/laptop with an X-over cable or via a hub.  Since we want to install the OS via ethernet we need to inform the RAQ that we  need it to start in Net Boot mode.</p>
<ul>
<li>Power UP</li>
<li>Press both Left and Right cursor buttons on the front Panel</li>
</ul>
<p>You will now see the Net Boot on the LCD Screen , after that you just see different operations that the installer is doing. After the machine reboots, thats it, ready to go.</p>
<p><center><img src="http://www.cipher.org.uk/images/myraq1.jpg" /></center>  Advices as soon as you login into the server :</p>
<pre>passwd root
passwd toor
useradd -m username
passwd username
add your self in the wheel user group so you can use 'su'.
vi /etc/ifconfig.tlp0 (set your IP address and the subnet)
vi /etc/rc.conf (disable/enable services)
	+ configure /etc/rc.conf to something like
			hostname="servername"
			dhclient=NO
			nfs_client=NO
			paneld=YES
			inetd=NO
			sshd=YES
reboot</pre>

<span class="slashdigglicious">
<a href="http://slashdot.org/bookmark.pl?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1" title="Slashdot It!"><img src="http://slashdot.org/favicon.ico" height="16" width="16" alt="[Slashdot]" /></a>
<a href="http://digg.com/submit?phase=2&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1" title="Digg This Story"><img src="http://digg.com/favicon.ico" width="16" height="16" alt="[Digg]" /></a>
<a href="http://reddit.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1" title="Reddit"><img src="http://reddit.com/favicon.ico" width="16" height="16" alt="[Reddit]" /></a>
<a href="http://del.icio.us/post?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1" title="Save to del.icio.us" onclick="window.open('http://del.icio.us/post?v=4&amp;noui&amp;jump=close&amp;url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1', 'delicious', 'toolbar=no,width=700,height=400'); return false;"><img src="http://del.icio.us/favicon.ico" width="16" height="16" alt="[del.icio.us]" /></a>
<a href="http://www.facebook.com/share.php?u=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F" title="Share on Facebook"><img src="http://www.facebook.com/favicon.ico" width="16" height="16" alt="[Facebook]" /></a>
<a href="http://technorati.com/faves?add=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F" title="Add to my Technorati Favorites"><img src="http://technorati.com/favicon.ico" width="16" height="16" alt="[Technorati]" /></a>
<a href="http://www.google.com/bookmarks/mark?op=edit&amp;output=popup&amp;bkmk=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1" title="Save to Google Bookmarks"><img src="http://www.google.com/favicon.ico" width="16" height="16" alt="[Google]" /></a>
<a href="http://www.stumbleupon.com/submit?url=http%3A%2F%2Fwww.cipher.org.uk%2Fread%2F2004%2F03%2F18%2Fnetbsd-on-cobalt-raq1%2F&amp;title=NetBSD+on+Cobalt+RAQ1" title="Stumble it!"><img src="http://www.stumbleupon.com/favicon.ico" width="16" height="16" alt="[StumbleUpon]" /></a>
</span>]]></content:encoded>
			<wfw:commentRss>http://www.cipher.org.uk/read/2004/03/18/netbsd-on-cobalt-raq1/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Cryptographers Complete List</title>
		<link>http://www.cipher.org.uk/read/2003/12/07/cryptographers-complete-list/</link>
		<comments>http://www.cipher.org.uk/read/2003/12/07/cryptographers-complete-list/#comments</comments>
		<pubDate>Sun, 07 Dec 2003 20:01:09 +0000</pubDate>
		<dc:creator>EK</dc:creator>
		
		<category><![CDATA[Articles]]></category>

		<category><![CDATA[cryptography]]></category>

		<category><![CDATA[people]]></category>

		<guid isPermaLink="false">http://www.cipher.org.uk/2003/12/07/cryptographers-complete-list/</guid>
		<description><![CDATA[ This list contains 510 of the most important names in Information Security.
A

Ross Anderson
Martin Abadi
Tuomas Aura
Jose Abad-Peiro
Alessandro Acquisti
 Leonard Adleman [bio]
Gordon Agnew
N. Asokan
Derek Atkins
Stefan Axelsson
Michel Ferreira  Abdalla
Gordon Agnew
Jee Hea  An
Nadarajah Asokan
Giuseppe Ateniese
Tuomas Aura

B

Adam Back
Don Beaver
Mihir Bellare
Steve Bellovin
Philippe Béguin
Josh Benaloh (formerly Cohen)
D. J. Bernstein
John R. Black
Joan F. Boyar (formerly Joan  Plumstead)
Colid Boyd
Gilles  [...]]]></description>
			<content:encoded><![CDATA[<p id="main"> This list contains 510 of the most important names in Information Security.<br />
<font color="black">A</font></p>
<ul>
<li><a href="http://www.cl.cam.ac.uk/users/rja14/">Ross Anderson</a></li>
<li><a href="http://www.research.digital.com/SRC/personal/Martin_Abadi/home.html">Martin Abadi</a></li>
<li><a href="http://saturn.hut.fi/html/staff/tuomas.html">Tuomas Aura</a></li>
<li><a href="http://www.zurich.ibm.com/%7Ejla/">Jose Abad-Peiro</a></li>
<li><a href="http://www.sims.berkeley.edu/%7Eacquisti/">Alessandro Acquisti</a></li>
<li> Leonard Adleman <a href="http://vip.hotwired.com/wired/3.08/features/molecular.html">[bio]</a></li>
<li><a href="http://www.ece.uwaterloo.ca/www_info/people/faculty/agnew.html">Gordon Agnew</a></li>
<li><a href="http://vcard.acm.org/%7Easokan/">N. Asokan</a></li>
<li><a href="http://www.mit.edu:8001/people/warlord/home_page.html">Derek Atkins</a></li>
<li><a href="http://www.ce.chalmers.se/staff/sax/">Stefan Axelsson</a></li>
<li><a href="http://www-cse.ucsd.edu/users/mabdalla/">Michel Ferreira  Abdalla</a></li>
<li><a href="http://www.ece.uwaterloo.ca/www_info/people/faculty/agnew.html">Gordon Agnew</a></li>
<li><a href="http://www-cse.ucsd.edu/users/jeehea/">Jee Hea  An</a></li>
<li><a href="http://vcard.acm.org/%7Easokan">Nadarajah Asokan</a></li>
<li><a href="http://www.cs.jhu.edu/%7Eateniese/">Giuseppe Ateniese</a></li>
<li><a href="http://saturn.hut.fi/html/staff/tuomas.html">Tuomas Aura</a></li>
</ul>
<p><font color="black">B</font></p>
<ul>
<li><a href="http://www.cypherspace.net/%7Eadam/">Adam Back</a></li>
<li><a href="http://www.transarc.com/afs/transarc.com/public/beaver/html/Home.html">Don Beaver</a></li>
<li><a href="http://www-cse.ucsd.edu/users/mihir/">Mihir Bellare</a></li>
<li><a href="http://www.research.att.com/%7Esmb">Steve Bellovin</a></li>
<li><a href="http://www.dmi.ens.fr/equipes/grecc/Membres/beguin/index.html">Philippe Béguin</a></li>
<li><a href="http://www.research.microsoft.com/crypto/benaloh/">Josh Benaloh (formerly Cohen)</a></li>
<li><a href="http://cr.yp.to/djb.html">D. J. Bernstein</a></li>
<li><a href="http://www.cs.unr.edu/%7Ejrb">John R. Black</a></li>
<li><a href="http://www.imada.sdu.dk/%7Ejoan/">Joan F. Boyar</a> (formerly Joan  Plumstead)</li>
<li><a href="http://www.fit.qut.edu.au/%7Eboyd/">Colid Boyd</a></li>
<li><a href="http://www.iro.umontreal.ca/%7Ebrassard/">Gilles  Brassard</a></li>
<li><a href="http://chem.leeds.ac.uk/ICAMS/people/jon/">Jon Baber</a></li>
<li><a href="http://www.eit.com/%7Eali/">Alireza Bahreman</a></li>
<li><a href="http://www.counterpane.com/researchers.html">Shahram Bakhtiari</a></li>
<li><a href="http://www.cs.utexas.edu/users/achou/FRIEND/doug.html">Doug Barnes</a> [<a href="http://www.communities.com/foo/">foo</a>, another page, of sorts]</li>
<li><a href="http://maga.di.unito.it/fb/">Francesco Bergadano</a></li>
<li><a href="http://www.anagram.com/berson/">Tom Berson</a></li>
<li><a href="http://mercurio.sm.dsi.unimi.it/%7Ebertino/">Elisa Bertino</a></li>
<li><a href="http://www.ira.uka.de/I3V_HTML/MITARBEITER/12">Thomas Beth</a></li>
<li><a href="http://www.uni-giessen.de/%7Egcb6/">Albrecht Beutelspacher</a></li>
<li><a href="http://www.cs.technion.ac.il/%7Ebiham/">Eli Biham</a></li>
<li><a href="http://kubarb.phsx.ukans.edu/%7Etbird">Tina Bird</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Ealbi/">Alex Biryukov</a></li>
<li><a href="http://seclab.cs.ucdavis.edu/%7Ebishop/">Matt Bishop</a></li>
<li><a href="http://www.cs.unr.edu/%7Ejrb/">John Black</a></li>
<li><a href="http://www.cs.rhbnc.ac.uk/%7Esimonb/">Simon Blackburn</a></li>
<li><a href="ftp://ftp.research.att.com/dist/mab/">Matt Blaze</a> [<a href="http://www.research.att.com/info/mab/">corparate drivel</a>]</li>
<li><a href="http://www.bell-labs.com/user/bleichen/">Daniel Bleichenbacher</a></li>
<li><a href="http://http.cs.berkeley.edu/%7Eblum/">Manuel Blum</a></li>
<li><a href="http://www.unisa.it/carblu.dir/start.html">Carlo Blundo</a></li>
<li><a href="http://www.cs.princeton.edu/%7Edabo/">Dan Boneh</a></li>
<li><a href="http://www.cs.berkeley.edu/%7Enikitab">Nikita Borisov</a></li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Ebosselae/">Antoon Bosselaers</a></li>
<li><a href="http://www.fit.qut.edu.au/%7Eboyd/">Colin Boyd</a></li>
<li><a href="http://www.xs4all.nl/%7Ebrands/">Stefan Brands</a></li>
<li><a href="http://www.iro.umontreal.ca/%7Ebrassard/">Gilles Brassard</a></li>
<li><a href="http://www.adfa.edu.au/%7Elpb/">Lawrie Brown</a></li>
<li><a href="http://idea.sec.dsi.unimi.it/STAFF/danilo.html">Danilo Bruschi</a></li>
<li><a href="http://www.informatik.th-darmstadt.de/TI/Mitarbeiter/buchmann.html">Johannes Buchmann</a></li>
<li><a href="http://www.cs.fsu.edu/%7Eburmeste/">Mike Burmester</a></li>
<li><a href="http://www.di.ens.fr/%7Ebaudron/">Olivier Baudron</a></li>
<li><a href="http://www.cs.bgu.ac.il/%7Ebeimel/">Amos Beimel</a></li>
<li><a href="http://www.certicom.com/research/people/bwilson.html">Simon Blake-Wilson</a></li>
<li><a href="http://www.cs.cmu.edu/People/avrim/">Avrim L. Blum</a></li>
<li><a href="http://www-cse.ucsd.edu/users/aboldyre/">Alexandra   Boldyreva</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Eboyko/">Victor Boyko</a></li>
<li><a href="http://www.di.ens.fr/%7Ebresson/">Emmanuel Bresson  </a></li>
</ul>
<p><font color="black">C</font></p>
<ul>
<li><a href="http://www.cl.cam.ac.uk/%7Echc1001/">Che-Hao (Albert) Chang</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Ecc/">Christian Cachin</a></li>
<li><a href="http://www.brics.dk/%7Ecamenisch/">Jan Camenisch</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Ecanetti/">Ran Canetti</a></li>
<li><a href="http://www-rocq.inria.fr/codes/Anne.Canteaut/">Anne Canteaut</a></li>
<li><a href="http://www.tik.ee.ethz.ch/%7Ecaronni">Germano Caronni</a></li>
<li><a href="http://www.ens.fr/%7Echabaud/">Florent Chabaud</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/chc1001">C-H Chang</a></li>
<li><a href="http://www.digicash.com/digicash/people/david.html">David Chaum</a></li>
<li><a href="http://www.ee.cityu.edu.hk/%7Elcheng">L.M. Cheng</a></li>
<li><a href="http://cm.bell-labs.com/who/ches/">Bill Cheswick</a></li>
<li><a href="http://www.cs.technion.ac.il/%7Ebiham/cgi-bin/faculty.cgi?Chor.Benny">Benny Chor</a></li>
<li><a href="http://www.cs.herts.ac.uk/is/rooms/LB201.html">Bruce Christianson</a></li>
<li><a href="mailto:scc1000@cl.cam.ac.uk">Shaw Chuang</a></li>
<li><a href="http://www.primarykey.co.uk/Andy/ajcmain.HTM">Andy Clark</a></li>
<li><a href="http://www.obscura.com/%7Eloki">Lance Cottrell</a></li>
<li><a href="http://www.minrank.org/%7Ecourtois/myresearch.html">Nicolas Courtois</a></li>
<li><a href="http://www.cse.ogi.edu/%7Ecrispin">Crispin Cowan</a></li>
<li><a href="http://www.cs.mcgill.ca/%7Ecrepeau/">Claude Crépeau</a></li>
<li><a href="http://www.ccrc.wustl.edu/%7Elorracks/">Lorrie Cranor</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/bc201">Bruno Crispo</a></li>
<li><a href="http://www.research.ibm.com/people/c/copper/">Don Coppersmith</a></li>
<li><a href="http://www.brics.dk/%7Ecramer/">Ronald Cramer</a></li>
</ul>
<p><font color="black">D</font></p>
<ul>
<li><a href="http://www.comp.nus.edu.sg/%7Edingcs">Cunsheng Ding</a></li>
<li><a href="http://www.ruhr-uni-bochum.de/itsc/englisch/index.html">Hans Dobbertin</a></li>
<li><a href="http://www-isl.stanford.edu/people/fahn/crypto.html">Paul Fahn</a></li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Erijmen/daemen.html">Joan Daemen</a></li>
<li><a href="http://www.ic.unicamp.br/%7Erdahab/">Ricardo Dahab</a></li>
<li><a href="http://www.daimi.aau.dk/DAIMI/ScientificStaffProfiles/ivan.html">Ivan Damgård</a></li>
<li><a href="http://www.eskimo.com/%7Eweidai/">Wei Dai</a></li>
<li><a href="http://www.cs.uwm.edu/faculty/davida/">George Davida</a></li>
<li><a href="http://world.std.com/%7Edtd/">Don Davis</a></li>
<li><a href="http://www.unisa.it/ads.dir/index.htm">Alfredo De Santis</a></li>
<li><a href="http://www.cipher.org.uk/www.i2r.a-star.edu.sg/icsd/staff/Robert/">Robert Deng</a></li>
<li><a href="http://www.cosc.georgetown.edu/%7Edenning/">Dorothy Denning</a></li>
<li><a href="http://www.cs.uwm.edu/faculty/desmedt">Yvo Desmedt</a></li>
<li><a href="http://www.dice.ucl.ac.be/%7Edhem/">Jean-François Dhem</a></li>
<li><a href="http://www-cse.ucsd.edu/users/giovanni/">Giovanni Di Crescenzo</a></li>
<li> Whit Diffie <a href="http://research.sun.com/people/diffie/">[Sun Site]</a></li>
<li><a href="http://techunix.technion.ac.il/%7Eorrd/">Orr Dunkelman</a></li>
<li><a href="http://www.daimi.au.dk/%7Eivan">Ivan Damgård</a></li>
<li><a href="http://www.stanford.edu/%7Edaswani/">Neil K. Daswani</a></li>
<li><a href="http://www.fit.qut.edu.au/DataComms/About/people/ed_dawson.html">Ed Dawson</a></li>
<li><a href="http://www.dice.ucl.ac.be/crypto/delos/delos.html">Olivier Delos</a></li>
<li><a href="http://www-cse.ucsd.edu/users/adesai/">Anand Desai</a></li>
<li><a href="http://www.dice.ucl.ac.be/crypto/dhem/dhem.html">Jean-Francois Dhem</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Eyevgen/">Yevgeniy Dodis</a></li>
<li><a href="http://www.cs.huji.ac.il/%7Edolev/">Danny Dolev</a></li>
<li><a href="http://vipe.technion.ac.il/%7Eorrd/me/index.html">Orr  Dunkelman</a></li>
<li><a href="http://theory.stanford.edu/%7Egdurf/">Glenn Durfee</a></li>
<li><a href="http://www.brics.dk/%7Estefand/">Stefan Dziembowski</a></li>
</ul>
<p><font color="black">E</font></p>
<ul>
<li><a href="http://www.pobox.com/%7Ecme/">Carl Ellison</a></li>
</ul>
<p><font color="black">F</font></p>
<ul>
<li><a href="http://www.fish.com/%7Ezen/">Dan Farmer</a></li>
<li><a href="http://www.isse.gmu.edu/%7Epfarrell/">Pat Farrell</a></li>
<li><a href="http://www.research.att.com/%7Ejf">Joan Feigenbaum</a></li>
<li><a href="http://www.cs.princeton.edu/%7Efelten/">Edward Felten</a></li>
<li><a href="http://niels.ferguson.net/">Niels Ferguson</a></li>
<li><a href="http://www-rocq.inria.fr/codes/Eric.Filiol/English/">Eric Filiol</a></li>
<li><a href="http://www.rain.org/%7Ehal">Hal Finney</a></li>
<li><a href="http://www.mi.informatik.uni-frankfurt.de/people/marc/marc.html">Marc Fischlin</a></li>
<li><a href="http://www.cs.unibo.it/%7Efocardi">Riccardo Focardi</a></li>
<li><a href="http://www.cs.sandia.gov/%7Eyair">Yair Frankel</a></li>
<li><a href="http://www.parc.xerox.com/csl/members/franklin/">Matt Franklin</a></li>
<li><a href="http://ssie.binghamton.edu/%7Ejirif/">Jiri Fridrich</a></li>
<li><a href="http://www.law.miami.edu/%7Efroomkin/">Michael Froomkin</a></li>
<li><a href="http://www.brics.dk/%7Efehr/index.html">Serge Fehr</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Efeige/">Uriel Feige</a></li>
<li><a href="http://www.mi.informatik.uni-frankfurt.de/people/fischlin/roger.html">Roger Fischlin</a></li>
<li><a href="http://www.crypto.ethz.ch/%7Efitzi/">Matthias Fitzi</a></li>
<li><a href="http://www.lri.fr/%7Ecaroline/">Caroline Fontaine</a></li>
<li><a href="http://www.di.ens.fr/%7Efouque/">Pierre-Alain  Fouque</a></li>
</ul>
<p><font color="black">G</font></p>
<ul>
<li><a href="http://www.isg.rhul.ac.uk/%7Esdg/index.html">Steven Galbraith</a></li>
<li><a href="http://www.cs.berkeley.edu/%7Etalg/">Tal Garfinkel</a></li>
<li><a href="http://www.cs.unm.edu/%7Egemmell/">Peter Gemmell</a></li>
<li><a href="http://www.research.ibm.com/people/r/rosario/">Rosario Gennaro</a></li>
<li><a href="http://www.cygnus.com/%7Egnu/">John Gillmore</a></li>
<li><a href="http://fp.gladman.plus.com/">Brian Gladman</a></li>
<li><a href="http://www.ece.umd.edu/%7Egligor/">Virgil Gligor</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Eoded/">Oded Goldreich</a> (or <a href="http://theory.lcs.mit.edu/%7Eoded/">here temporarily</a>)</li>
<li><a href="http://theory.lcs.mit.edu/%7Eshafi/">Shafi Goldwasser</a></li>
<li><a href="http://www.cs.berkeley.edu/%7Eiang">Ian Goldberg</a></li>
<li><a href="http://www.fit.qut.edu.au/DataComms/About/people/jovan_golic.html">Jovan Golic</a></li>
<li><a href="http://www.csl.sri.com/gong/public_html/home.html">Li Gong at SRI</a> or <a href="http://java.sun.com/people/gong/">at JavaSoft</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/adg/">Andrew Gordon</a></li>
<li><a href="http://www.math.ias.edu/%7Egoresky/home.html">Mark Goresky</a></li>
<li><a href="http://www.cs.auckland.ac.nz/%7Epgut001/">Peter Gutmann</a></li>
<li><a href="http://www.cs.columbia.edu/%7Egalil/">Zvi Galil</a></li>
<li><a href="http://www.bell-labs.com/user/garay/">Juan A. Garay</a></li>
<li><a href="http://www.dia.unisa.it/lg.dir/">Luisa Gargano</a></li>
<li><a href="http://www.cs.technion.ac.il/%7Egilboa/">Niv Gilboa</a></li>
<li><a href="http://crypto.stanford.edu/%7Epgolle/">Philippe Golle</a></li>
<li><a href="http://www.research.microsoft.com/users/dgollmann/dgollmann.htm">Dieter Gollman</a></li>
<li><a href="http://www.cenapad.ufmg.br/%7Ejvdg/">Jeroen van de Graaf</a></li>
<li><a href="http://www.di.ens.fr/%7Egranboul/">Louis  Granboulan</a></li>
<li><a href="http://www.crypto.ruhr-uni-bochum.de/mitarbeiter/guajardo.html">Jorge Guajardo           </a></li>
</ul>
<p><font color="black">H</font></p>
<ul>
<li><a href="http://theory.lcs.mit.edu/%7Eshaih/">Shai Halevi</a></li>
<li><a href="http://www-inf.enst.fr/%7Eresearch/theses/handschuh.gb.html">Helena Handschuh</a></li>
<li><a href="http://www.cap-lore.com/">Norm Hardy</a></li>
<li><a href="http://www.isi.ee.ethz.ch/%7Eharpes/">Carlo Harpes</a></li>
<li><a href="http://www.nada.kth.se/%7Ejohanh/">Johan Hastad</a></li>
<li><a href="http://amir.herzberg.name/">Amir Herzberg</a></li>
<li><a href="ftp://ftp.avian.org/">*Hobbit*</a></li>
<li><a href="http://www.seas.gwu.edu/faculty/hoffman/">Lance Hoffman</a></li>
<li><a href="http://www.citi.umich.edu/u/honey/">Peter Honeyman</a></li>
<li><a href="http://www.users.zetnet.co.uk/hopwood/">David Hopwood</a></li>
<li><a href="http://www.network.com/hughes">James Hughes</a></li>
<li><a href="http://www.ulb.ac.be/di/scsi/defscsi.html">Frederic Huygens</a></li>
<li><a href="http://www.xs4all.com/%7Eitsme/">Willem Jan Hengeveld</a></li>
<li><a href="http://www.star-lab.com/stuart/">Stuart Haber</a></li>
<li><a href="http://www.cstp.umkc.edu/%7Eharn/">Lein Harn</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Etzvi/">Tzvika  Hartman</a></li>
<li><a href="ftp://isl.stanford.edu/pub/hellman/reports/">Martin Hellman</a></li>
<li><a href="http://www-cse.ucsd.edu/users/ahevia/">Alejandro Hevia</a></li>
<li><a href="http://www.engr.mun.ca/%7Ehoward/">Howard Heys</a></li>
<li><a href="http://www.crypto.ethz.ch/%7Ehirt/">Martin Hirt</a></li>
<li><a href="http://crypto.stanford.edu/%7Ehorwitz/">Jeremy Horwitz</a></li>
<li><a href="http://www.research.ibm.com/security">Nick Howgrave-Graham</a></li>
<li><a href="http://www.nada.kth.se/%7Ejohanh/">Johan H�stad</a></li>
</ul>
<p><font color="black">I</font></p>
<ul>
<li><a href="http://imailab-www.iis.u-tokyo.ac.jp/Members/imai-e.html">Hideki Imai</a></li>
<li><a href="http://www-cse.ucsd.edu/users/russell/">Russell Impagliazzo</a></li>
<li><a href="http://www.cs.bu.edu/%7Eitkis/">Gene Itkis</a></li>
</ul>
<p><font color="black">J</font></p>
<ul>
<li><a href="http://hideki.iis.u-tokyo.ac.jp/Members/imai-e.html">Hideki Imai</a></li>
<li><a href="http://www-cse.ucsd.edu/users/russell/">Russell Impagliazzo</a></li>
<li><a href="http://www.cs.nps.navy.mil/people/faculty/irvine/index.html">Cynthia Irvine</a></li>
<li><a href="http://www.chiark.greenend.org.uk/%7Eijackson/">Ian Jackson</a></li>
<li><a href="http://www.eecs.umich.edu/%7Ejaegert">Trent Jaeger</a></li>
<li><a href="http://www.isse.gmu.edu/%7Ecsis/faculty/jajodia.html">Sushil Jajodia</a></li>
<li><a href="http://www.mat.dtu.dk/persons/Jakobsen_Thomas/">Thomas Jakobsen</a></li>
<li><a href="http://www.markus-jakobsson.com/">Markus Jakobsson</a> (or,<a href="http://www.rsasecurity.com/rsalabs/staff/bios/mjakobsson/">here</a>)</li>
<li><a href="http://www.zurich.ibm.com/%7Epj/">Philippe Janson</a></li>
<li><a href="http://ourworld.compuserve.com/homepages/bob_jenkins">Bob Jenkins</a></li>
<li><a href="http://www.patriot.net/users/johnson/html/neil/index.htm">Neil Johnson</a> [<a href="http://osf1.gmu.edu/%7Enjohnso5/">old</a>]</li>
<li><a href="http://www.dmi.ens.fr/equipes/grecc/Membres/joux/pub.html">Antoine Joux</a></li>
<li><a href="http://www.geocities.com/MarcJoye/">Marc Joye</a></li>
<li><a href="http://www.rsalabs.com/staff/ajuels/">Ari Juels</a></li>
<li><a href="http://www.scs.carleton.ca/%7Ejust/">Mike Just</a></li>
<li><a href="http://www.cs.umanitoba.ca/%7Ejacobs/">Michael Jacobson</a></li>
<li><a href="http://www.research.microsoft.com/%7Emariuszj/">Mariusz H.Jakubowski</a> (<a href="http://www.cs.princeton.edu/%7Emj/">alt</a>)</li>
<li><a href="http://www.star-lab.com/sjarecki/index.html">Stanislaw Jarecki</a> (<a href="http://theory.lcs.mit.edu/%7Estasio/">MIT</a>)</li>
</ul>
<p><font color="black">K</font></p>
<ul>
<li><a href="http://www.comp.nus.edu.sg/%7Elamky/">Lam Kwok-Yan</a></li>
<li><a href="http://www.qualcomm.com/people/pkarn/">Phil Karn</a></li>
<li><a href="http://www.cis.upenn.edu/%7Eangelos/home.html">Angelos Keromytis</a></li>
<li><a href="mailto:ak247@cl.cam.ac.uk">Abida Khattak</a></li>
<li><a href="http://vega.icu.ac.kr/%7Ekkj/">Kwangjo Kim</a></li>
<li><a href="http://dosan.skku.ac.kr/%7Esjkim">Seung-Joo Kim</a></li>
<li><a href="http://students.cs.byu.edu/%7Edon/">Don Kitchen</a></li>
<li><a href="http://al.cs.engr.uky.edu/%7Eklapper/andy.html">Andy Klapper</a></li>
<li><a href="http://www.ii.uib.no/%7Elarsr/">Lars Knudsen</a></li>
<li><a href="http://www.cryptography.com/paul/">Paul Kocher</a></li>
<li><a href="http://www.dice.ucl.ac.be/%7Efkoeune/koeune.html">François Koeune</a></li>
<li><a href="http://www.cc.gatech.edu/%7Eok">Oleg Kolesnikov</a></li>
<li><a href="http://dasan.sejong.ac.kr/%7Etkwon">Taekyoung Kwon</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/mgk25">Markus Kuhn</a></li>
<li><a href="http://tsk-www.ss.titech.ac.jp/%7Ekurosawa/index.html">Kaoru Kurosawa</a></li>
<li><a href="http://www.cs.technion.ac.il/%7Eeyalk/">Eyal Kushilevitz</a></li>
<li><a href="http://www.rsalabs.com/staff/kaliski.html">Burt Kaliski</a></li>
<li><a href="http://www.cs.columbia.edu/%7Ejkatz/">Jonathan Katz</a></li>
<li><a href="http://www.cse.uconn.edu/%7Eakiayias/">Aggelos Kiayias</a></li>
<li><a href="http://www.neci.nj.nec.com/neci-website/bios/kilian.html">Joe Kilian</a></li>
<li><a href="http://www.math.washington.edu/People/faculty.html#K">Neil Koblitz</a></li>
<li><a href="http://www.crypto.ethz.ch/%7Ekohlas/">Reto Kohlas</a></li>
<li><a href="http://www-cse.ucsd.edu/users/tkohno/">Tadayoshi Kohno </a></li>
<li><a href="http://www.brics.dk/%7Emkoprow/">Maciej Koprowski</a></li>
<li><a href="http://www.scs.carleton.ca/%7Ekranakis/">Evangelos Kranakis</a></li>
<li><a href="http://fsinfo.cs.uni-sb.de/%7Esanta/">Klaus Kursawe  </a></li>
</ul>
<p><font color="black">L</font></p>
<ul>
<li><a href="http://wooly.postech.ac.kr/user/pjl/">Pil Joong Lee</a></li>
<li><a href="http://www.comp.nus.edu.sg/%7Elamky/">Kwok-Yan Lam</a></li>
<li><a href="http://www-swiss.ai.mit.edu/%7Ebal/">Brian LaMacchia</a></li>
<li><a href="http://www.research.digital.com/SRC/staff/lamport/bio.html">Leslie Lamport</a></li>
<li><a href="http://www.research.microsoft.com/lampson/Publications.html">Butler Lampson</a></li>
<li><a href="http://www.cs.umass.edu/%7Elandau/">Susan Landau</a></li>
<li><a href="http://cryptomathic.dk/addressbook.htmL">Peter Landrock</a></li>
<li><a href="http://www.apache-ssl.org/ben.html">Ben Laurie</a></li>
<li><a href="http://wooly.postech.ac.kr/user/pjl/">Pil-Joong Lee</a></li>
<li><a href="ftp://ftp.bellcore.com/pub/lenstra">Arjen Lenstra</a></li>
<li><a href="http://lix.polytechnique.fr/%7Elercier/">Reynald Lercier</a></li>
<li><a href="http://atropos.c2.net/%7Eraph/index.html">Raph Levien</a></li>
<li><a href="http://crypt.future.co.kr/%7Echlim/">C-H Lim</a></li>
<li><a href="http://www.polito.it/%7Ecat/">Antonio Lioy</a></li>
<li><a href="http://home.cyber.ee/helger/">Helger Lipmaa</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/tmal/">Mark Lomas</a></li>
<li><a href="http://www.icsi.berkeley.edu/%7Eluby/">Mike Luby</a></li>
<li><a href="http://rooster.stanford.edu/%7Eben/">Ben Lynn</a></li>
<li><a href="http://th.informatik.uni-mannheim.de/m/lucks/">Stefan Lucks</a></li>
<li><a href="http://www.farcaster.com/">Brian A. LaMacchia</a></li>
<li><a href="http://home.cyber.ee/peeter/">Peeter Laud</a></li>
<li><a href="http://www.cryptosavvy.com/">Arjen K. Lenstra</a></li>
<li><a href="http://crypt.future.co.kr/%7Echlim/">Chae Hoon Lim</a></li>
<li><a href="http://www.research.ibm.com/people/l/lindell/">Yehuda Lindell</a></li>
<li><a href="http://www.icsi.berkeley.edu/%7Eluby/">Michael Luby</a></li>
<li><a href="http://www.cs.brown.edu/people/anna/">Anna Lysyanskaya</a> (<a href="http://theory.lcs.mit.edu/%7Eanna/">old MIT</a>)</li>
</ul>
<p><font color="black">M</font></p>
<ul>
<li><a href="http://cm.bell-labs.com/who/philmac/">Philip MacKenzie</a></li>
<li><a href="http://www.systems.caltech.edu/EE/Faculty/rjm/">Robert J. McEliece</a></li>
<li><a href="http://zeus.math.fau.edu/spyros/">Spyros Magliveras</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/cm213/">Charalampos Manifavas</a></li>
<li><a href="http://hplbwww.hpl.hp.com/people/wm/">Wenbo Mao</a></li>
<li><a href="http://www.isg.rhul.ac.uk/%7Emartin/default.html">Keith Martin</a></li>
<li><a href="http://www-ir.inf.ethz.ch/research/elek/signalverarbeitung/massey.proj_overview">James Massey</a></li>
<li><a href="http://www.mlab.dnj.ynu.ac.jp/mlab/tsutomu.html">Tsutomu Matsumoto</a></li>
<li><a href="http://www.maths.uq.oz.au/%7Ekrm/">Keith Matthews</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/vm206/">Vaclav Matyas Jr.</a></li>
<li><a href="http://www.inf.ethz.ch/personal/maurer/">Ueli Maurer</a></li>
<li><a href="http://www.bell-labs.com/user/alain/">Alain Mayer</a></li>
<li><a href="http://www.jaist.ac.jp/%7Ekouhou/FP/e/is/miyaji.html">Atsuko Miyaji</a> (also <a href="http://www.jaist.ac.jp/%7Esinkou/thisyear/soe/00058soe.html">here</a>)</li>
<li><a href="http://www.cs.umass.edu/%7Elmccarth/">Lewis McCarthy</a></li>
<li><a href="http://www.swcp.com/%7Emccurley/index.html">Kevin McCurley</a></li>
<li><a href="http://www.systems.caltech.edu/EE/Faculty/rjm/">Robert McEliece</a></li>
<li><a href="http://www.mindspring.com/%7Edmcgrew/dam.htm">David McGrew</a></li>
<li><a href="http://www.cs.pdx.edu/%7Emchugh/">John McHugh</a></li>
<li><a href="http://www.itd.nrl.navy.mil/ITD/5540/personnel/mclean.html">John McLean</a></li>
<li><a href="http://www.itd.nrl.navy.mil/ITD/5540/projects/crypto.html">Catherine Meadows</a></li>
<li><a href="http://www.dms.auburn.edu/faculty/menezes.html">Alfred Menezes</a></li>
<li><a href="http://merkle.com/merkle">Ralph Merkle</a></li>
<li><a href="http://www.geopages.com/CapitolHill/1148/">David Merriman</a></li>
<li><a href="mailto:mezzalama@polito.it">Marco Mezzalama</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Emiccianc/">Daniele Micciancio</a></li>
<li><a href="http://www.avana.net/%7Erayburn/">David Miller</a></li>
<li><a href="http://www.gregmiller.net/">Greg Miller</a></li>
<li><a href="http://www.students.uiuc.edu/%7Ejwthomp/">Mithrandir</a></li>
<li><a href="http://fermat.ma.rhbnc.ac.uk/%7Efauzan/">Fauzan Mirza</a></li>
<li><a href="http://isg.rhbnc.ac.uk/cjm/Chris_Mitchell.htm">Chris Mitchell</a></li>
<li><a href="http://www.math.ucalgary.ca/%7Eramollin/">Richard Mollin</a></li>
<li><a href="http://www.yokohama.tao.or.jp/shiho/">Shiho Moriai</a></li>
<li><a href="http://www.catalog.com/mrm/">Marianne Mueller</a></li>
<li><a href="http://www.cs.rhbnc.ac.uk/%7Esean/">Sean Murphy</a></li>
<li><a href="http://www.cs.huji.ac.il/%7Edalia/">Dahlia Malkhi</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Etal/">Tal Malkin</a> (<a href="http://www.research.att.com/info/tal">AT&amp;T</a>)</li>
<li><a href="http://www.stanford.edu/%7Emikeym/">Mike Malkin</a></li>
<li><a href="http://www.std.org/%7Emsm/">Mark Manasse</a></li>
<li><a href="http://www.cl.cam.ac.uk/%7Ecm213/">Harry Manifavas</a></li>
<li><a href="http://www.mi.informatik.uni-frankfurt.de/people/merkle/merkle.html">Johannes Merkle</a></li>
<li><a href="http://www.geocities.com/CapeCanaveral/Lab/8983/">Markus Michels</a></li>
<li><a href="http://www-cse.ucsd.edu/users/sminer/">Sara Miner</a></li>
<li><a href="http://www.mironov.org/">Ilya Mironov</a></li>
<li><a href="http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/moeller.html">Bodo M�ller</a></li>
<li><a href="http://lecturer.ukdw.ac.id/vmueller/">Volker M�ller</a></li>
<li><a href="http://ultralix.polytechnique.fr/Labo/Francois.Morain/">Fran�ois Morain</a></li>
<li>David M&#8217;Ra�hi (<a href="http://www.gemplus.com/smart/r_d/publi_crypto/index.html">pubs</a>)</li>
</ul>
<p><font color="black">N</font></p>
<ul>
<li><a href="http://www.isi.edu/people/bcn/">Clifford Neumann</a></li>
<li><a href="http://www.nada.kth.se/%7Ematsn/matsn_homepage/research.html">Mats Näslund</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/people/homepages/naor/index.html">Moni Naor</a></li>
<li><a href="http://www.iinform.oeaw.ac.at/Niederreiter.html">Harald Niederreiter</a></li>
<li><a href="http://www.uwasa.fi/%7Evni/">Valtteri Niemi</a></li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Enakahara">Jorge Nakahara</a></li>
<li><a href="http://www.research.microsoft.com/research/cambridge/needham/needham.htm">Roger Needham</a></li>
<li><a href="http://www.engarde.com/%7Emcn/">Mike Neuman</a></li>
<li><a href="http://vcard.acm.org/%7Easokan">Asokan N.</a></li>
<li>David Naccache (<a href="http://www.gemplus.com/smart/r_d/publi_crypto/index.html">pubs</a>)</li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Enakahara/">Jorge   Nakahara Jr.</a></li>
<li><a href="http://www.di.ens.fr/%7Epnguyen/">Phong Nguyen</a></li>
<li><a href="http://www.brics.dk/%7Ebuus/">Jesper Buus Nielsen</a></li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Esnikova/">Svetla Iordanova  Nikova</a></li>
<li><a href="http://www.cs.huji.ac.il/%7Enoam/">Noam Nisan</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Ekobbi">Kobbi Nissim</a></li>
<li><a href="http://www.nada.kth.se/%7Ematsn/matsn_homepage/research.html">Mats N�slund</a></li>
</ul>
<p><font color="black">O</font></p>
<ul>
<li><a href="http://www.zurich.ibm.com/%7Eoco/">Luke O&#8217;Connor</a></li>
<li><a href="http://www.research.att.com/%7Eamo/">Andrew Odlyzko</a></li>
<li><a href="http://www.ohta.is.uec.ac.jp/k_ohta/">Kazuo Ohta</a></li>
<li><a href="http://www.argreenhouse.com/bios/rafail/">Rafail Ostrovsky</a></li>
<li><a href="http://www.cs.arizona.edu/xkernel/www/people/sean.html">Sean O&#8217;Malley</a></li>
<li><a href="http://info.isl.ntt.co.jp/%7Eohta/index.html">Kazuo Ohta</a></li>
<li><a href="http://www.jaist.ac.jp/%7Ekouhou/FP/Profile_Eng/is/okamoto.html">Eiji Okamoto</a></li>
<li><a href="http://www.princeton.edu/%7Edavido/">David Oppenheimer</a></li>
<li><a href="http://www.cs.arizona.edu/xkernel/www/people/ho.html">Hilarie Orman</a></li>
<li><a href="http://info.isl.ntt.co.jp/%7Eohta/">Kazuo  Ohta</a></li>
<li><a href="http://www.maths.adelaide.edu.au/pure/cokeefe/">Christine O&#8217;Keefe</a></li>
</ul>
<p><font color="black">P</font></p>
<ul>
<li><a href="http://cryptomathic.aau.dk/%7Etpp/">Torben Pryds Pedersen</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Ebennyp/">Benny Pinkas</a></li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Epreneel/">Bart Preneel</a></li>
<li><a href="http://ee.wpi.edu/People/faculty/cxp.html">Christof Paar</a></li>
<li><a href="http://www.cp8.com/sct/uk/partners/page/c_publication.html">Jacques Patarin</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/lcp">Lawrence Paulson</a></li>
<li><a href="http://cryptomathic.aau.dk/%7Etpp/">Torben Pedersen</a></li>
<li><a href="http://www.infocom.cqu.edu.au/Staff/Lyta_Penna/">Lyta Penna</a></li>
<li><a href="http://www.cs.uwm.edu/faculty/peralta/index.html">Rene Peralta</a></li>
<li><a href="http://www.cs.berkeley.edu/%7Eperrig">Adrian Perrig</a></li>
<li><a href="http://www.dia.unisa.it/%7Egiuper">Giuseppe Persiano</a></li>
<li><a href="http://www.dmi.ens.fr/%7Epetersen/">Holger Petersen</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/fapp2/">Fabien Petitcolas</a></li>
<li><a href="http://www.cs.toronto.edu/%7Eerez/">Erez Petrank</a></li>
<li><a href="http://www.informatik.uni-hildesheim.de/FB4/Institute/Informatik/issi/sirene/people/birgit/info.birgit.html">Birgit Pfitzmann</a></li>
<li><a href="http://weber.u.washington.edu/%7Ephantom/index.html">The Phantom</a></li>
<li><a href="http://www.cs.uow.edu.au/people/josef/homepage.html">Josef Pieprzyk</a></li>
<li><a href="http://www.dpmms.cam.ac.uk/%7Ergep/my-home-page.html">Richard Pinch</a></li>
<li><a href="http://cosimo.die.unifi.it/%7Epiva/welcome.html">Alessandro Piva</a></li>
<li><a href="http://www.dmi.ens.fr/%7Epointche/">David Pointcheval</a></li>
<li><a href="http://www.dmi.ens.fr/%7Epornin/index.html.en">Thomas Pornin</a></li>
<li><a href="http://www.dmi.ens.fr/%7Epoupard/">Guillaume Poupard</a></li>
<li><a href="http://www.eecs.umich.edu/%7Eaprakash">Atul Prakash</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/gp200/">Geraint Price</a></li>
<li><a href="http://www.citi.umich.edu/u/provos/">Niels Provos</a></li>
<li><a href="http://www.crypto.ruhr-uni-bochum.de/mitarbeiter/paar.html">Christof Paar</a></li>
<li><a href="http://www-mat.upc.es/%7Ematcpl/">Carles  Padr�</a></li>
<li><a href="http://www-inf.enst.fr/%7Eresearch/theses/paillier.fr.html">Pascal Paillier</a> (<a href="http://www.gemplus.com/smart/r_d/publi_crypto/index.html">alt</a>)</li>
<li><a href="http://www-cse.ucsd.edu/users/apalacio/">Adriana Palacio</a></li>
<li><a href="http://www.cp8.com/sct/uk/partners/page/c_publication.html">Jacques  Patarin</a></li>
<li><a href="http://www.isg.rhul.ac.uk/%7Ekp">Kenny Paterson</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/lcp/">Lawrence C. Paulson</a></li>
<li><a href="http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/sachar.html">Sachar Paulus</a></li>
<li><a href="http://dud.inf.tu-dresden.de/%7Epfitza/index.html">Andreas Pfitzmann</a></li>
<li><a href="http://www.pinkas.net/">Benny  Pinkas </a></li>
<li><a href="http://www.isg.rhul.ac.uk/%7Efpiper/">Fred Piper</a></li>
<li><a href="http://www.di.ens.fr/%7Epornin/">Thomas  Pornin </a></li>
<li><a href="http://www.di.ens.fr/%7Epoupard/">Guillaume  Poupard</a> (<a href="http://guillaume.poupard.free.fr/">alt</a>)</li>
<li><a href="http://www.crypto.ethz.ch/%7Eprzydate/">Bartosz  Przydatek</a></li>
</ul>
<p><font color="black">Q</font></p>
<ul>
<li><a href="http://www.dice.ucl.ac.be/crypto/jjq.html">Jean-Jacques Quisquater</a></li>
</ul>
<p><font color="black">R</font></p>
<ul>
<li><a href="http://theory.lcs.mit.edu/%7Etalr/">Tal Rabin</a></li>
<li><a href="http://www.cs.utoronto.ca/DCS/People/Faculty/rackoff.html">Charles Rackoff</a></li>
<li><a href="http://www.clark.net/pub/mjr/mjr-top.html">Marcus J. Ranum</a></li>
<li><a href="http://mumble.net/jar/">Jonathan Rees</a></li>
<li><a href="http://www.research.att.com/%7Ereeds/index.html">Jim Reeds</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/people/homepages/reingold/main.html">Omer Reingold</a></li>
<li><a href="http://www.research.att.com/%7Ereiter/">Mike Reiter</a></li>
<li><a href="http://www.esat.kuleuven.ac.be/%7Erijmen/">Vincent Rijmen</a></li>
<li><a href="http://www.io.com/%7Eritter/">Terry Ritter</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Erivest/">Ron Rivest</a></li>
<li><a href="http://www.isg.rhul.ac.uk/%7Emrobshaw/">Matt Robshaw</a></li>
<li><a href="http://www.cl.cam.ac.uk/users/mrr/">Michael Roe</a></li>
<li><a href="http://www.cs.ucdavis.edu/%7Erogaway/">Phil Rogaway</a></li>
<li><a href="http://turing.vironix.co.za/public/andrewr/">Andrew Roos</a></li>
<li><a href="http://paganini.sydney.sterling.com:8080/%7Eggr/">Greg Rose</a></li>
<li><a href="http://www.cs.nyu.edu/%7Erubin/">Avi Rubin</a></li>
<li><a href="http://www.cs.cmu.edu/afs/cs.cmu.edu/user/rudich/www/home.html">Steven Rudich</a></li>
<li><a href="http://www.deas.harvard.edu/faculty/rabin.html">Michael Rabin</a></li>
<li><a href="http://theory.lcs.mit.edu/%7Ezulfikar/">Zulfikar  Ramzan</a></li>
<li><a href="http://www.ece.cmu.edu/%7Ereiter/">Michael Reiter</a></li>
<li><a href="http://www.cs.bu.edu/%7Ereyzin/">Leonid Reyzin</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/%7Ealon/">Alon Rosen</a></li>
<li><a href="http://www.semper.org/sirene/people/ahmad/info.ahmad.html">Ahmad-Reza  Sadeghi</a></li>
</ul>
<p><font color="black">S</font></p>
<ul>
<li><a href="http://www.csee.umbc.edu/%7Easelcu1/">Ali Aydin Selcuk </a></li>
<li><a href="http://www.ece.ucdavis.edu/%7Eteshrim/">Tom Shrimpton</a></li>
<li><a href="http://www.math.brown.edu/%7Ejhs">Joseph H. Silverman</a></li>
<li><a href="http://www.cl.cam.ac.uk/%7Efms27/">Frank Stajano</a></li>
<li><a href="http://www.math.jyu.fi/%7Emjos/">Markku-Juhani Saarinen</a></li>
<li><a href="http://hakozaki.csce.kyushu-u.ac.jp/%7Esakurai/index.html">Kouichi Sakurai</a></li>
<li><a href="http://www.list.gmu.edu/%7Esandhu/">Ravi Sandhu</a></li>
<li><a href="http://tsk-www.ss.titech.ac.jp/%7Etsato/index-e.html">Takashi Satoh</a></li>
<li><a href="http://bs.mit.edu:8001/%7Ejis/home.html">Jeff Schiller</a></li>
<li><a href="http://www.counterpane.com/index.html">Bruce Schneier</a></li>
<li><a href="http://www.mi.informatik.uni-frankfurt.de/">Claus-Peter Schnorr</a></li>
<li><a href="http://www.digicash.com/%7Eberry/">Berry Schoenmakers</a></li>
<li><a href="http://www.cs.arizona.edu/xkernel/www/people/rich.html">Rich Schroeppel</a></li>
<li><a href="http://www.cs.uow.edu.au/people/jennie/">Jennifer Seberry</a></li>
<li><a href="http://www.cs.sunysb.edu/%7Esekar/">R. Sekar</a></li>
<li><a href="http://www.csee.umbc.edu/%7Easelcu1/">Ali Selcuk</a></li>
<li><a href="http://hovav.net/">Hovav Shacham</a></li>
<li><a href="http://www.wisdom.weizmann.ac.il/people/generic?shamir">Adi Shamir</a></li>
<li><a href="http://www.cis.upenn.edu/%7Eshap/">Jonathan Shapiro</a></li>
<li><a href="http://www.comp.mq.edu.au/%7Eigor/">Igor Shparlinski</a></li>
<li><a href="http://www.cs.umbc.edu/%7Esherman/">Alan Sherman</a></li>
<li><a href="ftp://ftp.cs.berkeley.edu/ucb/sprite/www/ken.shirriff.html">Ken Shirriff</a></li>
<li><a href="http://www.ecip.tohoku.ac.jp/Shizuya-Lab/index-j.html">Hiroki Shizuya</a> (in <a href="http://www.ecip.tohoku.ac.jp/Shizuya-Lab/index.html">English</a>)</li>
<li><a href="http://www.homeport.org/%7Eadam/">Adam Shostack</a></li>
<li><a href="http://www.cs.wisc.edu/%7Eshoup/">Victor Shoup</a></li>
<li><a href="http://www.math.ohio-state.edu/%7Esilver/">Alice Silverberg</a></li>
<li><a href="http://www.math.brown.edu/%7Ejhs/">Joseph Silverman</a></li>
<li><a href="http://research.microsoft.com/crypto/dansimon/me.htm">Daniel Simon</a></li>
<li><a href="http://www.cs.berkeley.edu/%7Edawnsong">Dawn Song</a></li>
<li><a href="http://www.xcf.berkeley.edu/%7Epaolo/">Paolo Soto</a></li>
<li><a href="http://www.cerias.purdue.edu/homes/spaf/">Eugene Spafford</a></li>
<li><a href="http://www.ubs.com/cgi-bin/framer.pl?/webclub/ubilab/e_index.htm/">Markus Stadler</a></li>
<li><a href="http://www.cl.cam.ac.uk/%7Efms27">Francesco Stajano</a></li>
<li><a href="http://www.zurich.ibm.com/%7Esti/">Michael Steiner</a></li>
<li><a href="http://www.dmi.ens.fr/%7Estern/index.html">Jacques Stern</a></li>
<li><a href="http://crypto.cs.mcgill.ca/%7Estiglic/">Anton Stiglic</a></li>
<li><a href="http://bibd.unl.edu/%7Estinson/">Doug Stinson</a></li>
<li><a href="http://town.hall.org/university/security/stoll/cliff.html">Cliff