<?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"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Reality tunnels &#187; security</title>
	<atom:link href="http://blog.superadditive.com/category/security/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.superadditive.com</link>
	<description>Pseudo-random thoughts by Juan M. Bello Rivas</description>
	<lastBuildDate>Mon, 27 Jun 2011 07:32:24 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
		<item>
		<title>Mathematics, cryptography, and the real world</title>
		<link>http://blog.superadditive.com/2007/09/06/mathematics-cryptography-and-the-real-world/</link>
		<comments>http://blog.superadditive.com/2007/09/06/mathematics-cryptography-and-the-real-world/#comments</comments>
		<pubDate>Thu, 06 Sep 2007 19:28:33 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[mathematics]]></category>
		<category><![CDATA[security]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2007/09/06/mathematics-cryptography-and-the-real-world/</guid>
		<description><![CDATA[Among the many reactions to Neil Koblitz&#8217; article on modern cryptography in the Notices of the AMS the most interesting reply I&#8217;ve read is this one by Steven Bellovin: Mathematicians have known since Euclid that axioms are important. Security, though, is math embedded in the real world, and that matters. Put another way, Euclidean geometry [...]]]></description>
			<content:encoded><![CDATA[<p>Among the many reactions to <a href="http://www.ams.org/notices/200708/tx070800972p.pdf">Neil Koblitz&#8217; article on modern cryptography in the Notices of the AMS</a> the most interesting reply I&#8217;ve read is <a href="http://marc.info/?l=cryptography&#038;m=118895427410007&#038;w=2">this one by Steven Bellovin</a>:</p>
<blockquote><p>
Mathematicians have known since Euclid that axioms are important. Security, though, is math embedded in the real world, and that matters.  Put another way, Euclidean geometry is completely valid as a pure mathematical system.  But that doesn&#8217;t mean it applies in a relativistic universe.  Sure, we live far from any space-warping masses, so we can pretend that the angles in our triangles add up to 180 degrees.  In the security world, though, the attacker will toss a black hole at us to warp the space around our provably-secure triangular encryptor.  Was that proof of security flawed?  Ask Riemann or Lobachevsky.
</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2007/09/06/mathematics-cryptography-and-the-real-world/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Internet topology modeling</title>
		<link>http://blog.superadditive.com/2005/08/16/internet-topology-modeling/</link>
		<comments>http://blog.superadditive.com/2005/08/16/internet-topology-modeling/#comments</comments>
		<pubDate>Tue, 16 Aug 2005 20:29:06 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[mathematics]]></category>
		<category><![CDATA[security]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2005/08/16/internet-topology-modeling/</guid>
		<description><![CDATA[In this lecture, Walter Willinger goes into the difficulties of Internet topology modeling (on the IP level). Accurate models of how the Internet works give insight into where its weakest links are located and how to simulate the network&#8217;s behavior under certain circumstances. Part of the lecture&#8217;s data was acquired using traceroute and thorny technical [...]]]></description>
			<content:encoded><![CDATA[<p>In <a href="http://angelina.msri.org/VMath/VMathVideos/VideoInfo/2098/show_video">this lecture</a>, <a href="http://www.research.att.com/~walter/">Walter Willinger</a> goes into the difficulties of Internet topology modeling (on the IP level).</p>
<p>Accurate models of how the Internet works give insight into where its weakest links are located and how to simulate the network&#8217;s behavior under certain circumstances.</p>
<p>Part of the lecture&#8217;s data was acquired using <tt>traceroute</tt> and thorny technical details like detecting aliased IPs and load balancers were skipped.</p>
<p>Some highlights of the talk are:</p>
<ol>
<li>Usage of economic models and current technological constraints to model the network (the resulting topology should be efficient).</li>
<li>Pitfalls of paying too much attention to power laws.</li>
<li>Differences between the real Internet and scale-free networks.</li>
</ol>
<p>I believe some of the points the author makes could be applied as well to overlay (P2P) networks.</p>
<p>Further links:</p>
<ul>
<li><a href="http://www.cds.caltech.edu/~alderd/papers/sigcomm04_abstract.html">A First-Principles Approach to Understanding the Internet&#8217;s Router-Level Topology</a></li>
<li><a href="http://arxiv.org/abs/cond-mat/0501169">Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (Extended Version)</a></li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2005/08/16/internet-topology-modeling/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How do I use nmap XML?</title>
		<link>http://blog.superadditive.com/2004/11/29/how-do-i-use-nmap-xml/</link>
		<comments>http://blog.superadditive.com/2004/11/29/how-do-i-use-nmap-xml/#comments</comments>
		<pubDate>Mon, 29 Nov 2004 23:07:48 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[security]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2004/11/29/how-do-i-use-nmap-xml/</guid>
		<description><![CDATA[Recently, in the nmap-dev mailing list, Fyodor asked: In what ways do you use the Nmap XML output? Do you parse it from within a higher level program, transform it to HTML with XSLT, use it to populate a database, use XPath to parse the results from the command-line in a way that is as [...]]]></description>
			<content:encoded><![CDATA[<p>Recently, in <a href="http://seclists.org/nmap-dev/2004/Oct-Dec/0070.html">the nmap-dev mailing list</a>, Fyodor asked:</p>
<blockquote><p>In what ways do you use the Nmap XML output?  Do you parse it from within a higher level program, transform it to HTML with XSLT, use it to populate a database, use XPath to parse the results from the command-line in a way that is as easy as awk/sec/cut/etc. on the normal output, or something else entirely?</p></blockquote>
<p>I&#8217;ll share here my approach to nmap output parsing.</p>
<p>For my automated scans I use a combination of Python, Bash and AWK scripts.  I always keep nmap scans in XML even if these will be used by some Bash/Awk scripts.</p>
<p>With Python I just parse the XML with <a href="http://xmlsoft.org">libxml&#8217;s</a> Python bindings.</p>
<p>With Bash and/or AWK I transform the XML output into PYX format with a custom made utility called <a href='http://blog.superadditive.com/wp-content/uploads/2004/11/xmltopyx.c'>xmltopyx</a>.</p>
<p>For those not familiar with PYX, it is a way of converting XML documents into a more grep/AWK friendly format.  More information about it can be found <a href="http://www.xml.com/pub/a/2000/03/15/feature/">here</a> and <a href="http://gnosis.cx/publish/programming/xml_matters_17.html">here</a>.</p>
<p>An example of xmltopyx + AWK usage:</p>
<pre>$ xmltopyx nmap-sample-tcpudp-portscan.xml | awk -f getports
tcp 21 open ftp
tcp 22 open ssh
tcp 53 open domain
udp 53 open|filtered domain
tcp 111 open rpcbind
udp 111 open|filtered rpcbind
udp 608 open|filtered sift-uft
tcp 611 open npmp-gui
udp 636 open|filtered
tcp 639 open
udp 664 open|filtered
udp 667 open|filtered
tcp 670 open
tcp 953 open rndc
tcp 2049 open nfs
udp 2049 open|filtered nfs
tcp 3128 open squid-http
udp 3130 open|filtered squid-ipc
udp 3401 open|filtered squid-snmp
udp 4827 open|filtered squid-htcp
udp 32768 open|filtered omad
udp 32771 open|filtered sometimes-rpc6</pre>
<p>Then, using <a href="http://paste.lisp.org/+2MVH">getports</a> together with a <code>while read proto port state service; do ... ; done </code>loop in Bash is very simple.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2004/11/29/how-do-i-use-nmap-xml/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Colossus rebuilt</title>
		<link>http://blog.superadditive.com/2004/06/02/colossus-rebuilt/</link>
		<comments>http://blog.superadditive.com/2004/06/02/colossus-rebuilt/#comments</comments>
		<pubDate>Wed, 02 Jun 2004 08:02:35 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[security]]></category>
		<category><![CDATA[science]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2004/06/02/colossus-rebuilt/</guid>
		<description><![CDATA[Colossus, the world&#8217;s first working computer, was used at Bletchley Park during World War II to break enemy codes. A replica has been rebuilt by veterans according to this article.]]></description>
			<content:encoded><![CDATA[<p>Colossus, the world&#8217;s first working computer, was used at Bletchley Park during<br />
World War II to break enemy codes. A replica has been rebuilt by veterans<br />
according to <a href="http://news.bbc.co.uk/1/hi/technology/3754887.stm">this article</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2004/06/02/colossus-rebuilt/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Keyboard eavesdropping</title>
		<link>http://blog.superadditive.com/2004/05/13/keyboard-eavesdropping/</link>
		<comments>http://blog.superadditive.com/2004/05/13/keyboard-eavesdropping/#comments</comments>
		<pubDate>Thu, 13 May 2004 08:02:36 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[security]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2004/05/13/keyboard-eavesdropping/</guid>
		<description><![CDATA[Funny thing. A technique for eavesdropping keyboards based on the sound they produce has been published: Each key on computer keyboards, telephones and even ATM machines makes a unique sound as each key is depressed and released, according to a paper entitled &#8220;Keyboard Acoustic Emanations&#8221; presented Monday by IBM research scientist Dmitri Asonov. All that [...]]]></description>
			<content:encoded><![CDATA[<p>Funny thing. A technique for eavesdropping keyboards based on the sound they produce has been <a href="http://searchsecurity.techtarget.com/originalContent/0,289142,sid14_gci963348,00.html">published:</a></p>
<blockquote><p>Each key on computer keyboards, telephones and even ATM machines makes a unique sound as each key is depressed and released, according to a paper entitled &#8220;Keyboard Acoustic Emanations&#8221; presented Monday by IBM research scientist Dmitri Asonov. All that is needed is about $200 worth of microphones and sound processing and PC neural networking software. Today&#8217;s keyboard, telephone keypads, ATM machines and even door locks have a rubber membrane underneath the keys. &#8220;This membrane acts like a drum, and each key hits the drum in a different location and produces a unique frequency or sound that the neural networking software can decipher,&#8221; said Asonov.</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2004/05/13/keyboard-eavesdropping/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Computational linguistics help uncover government secrets</title>
		<link>http://blog.superadditive.com/2004/05/11/computational-linguistics-help-uncover-government-secrets/</link>
		<comments>http://blog.superadditive.com/2004/05/11/computational-linguistics-help-uncover-government-secrets/#comments</comments>
		<pubDate>Tue, 11 May 2004 08:02:35 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[security]]></category>
		<category><![CDATA[science]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2004/05/11/computational-linguistics-help-uncover-government-secrets/</guid>
		<description><![CDATA[This article from yesterday&#8217;s news talks about a program for revealing blacked-out words in documents. They used it against a memorandum from the USA Dept. of Defense yielding interesting results: They said that although the name of a country had been blacked out in that memorandum, their software showed that it was highly likely the [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://news.com.com/2100-7348_3-5209016.html?tag=nefd.top">This article</a> from yesterday&#8217;s news talks about a program for revealing blacked-out words in documents.  They used it against a memorandum from the USA Dept. of Defense yielding interesting results:</p>
<blockquote>
<div>They said that although the name of a country had been blacked out in that memorandum, their software showed that it was highly likely the document named South Korea as having helped the Iraqis.</div>
</blockquote>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2004/05/11/computational-linguistics-help-uncover-government-secrets/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Adi Shamir&#8217;s three laws of security</title>
		<link>http://blog.superadditive.com/2004/05/11/adi-shamirs-three-laws-of-security/</link>
		<comments>http://blog.superadditive.com/2004/05/11/adi-shamirs-three-laws-of-security/#comments</comments>
		<pubDate>Tue, 11 May 2004 08:02:35 +0000</pubDate>
		<dc:creator>jmbr</dc:creator>
				<category><![CDATA[security]]></category>

		<guid isPermaLink="false">http://blog.superadditive.com/2004/05/11/adi-shamirs-three-laws-of-security/</guid>
		<description><![CDATA[Computerworld informs about the on-line availability of the lectures given by Rivest, Shamir and Adleman when they received the 2002 ACM Turing Award. I want to highlight Shamir&#8217;s three laws of security: Absolutely secure systems do not exist To halve your vulnerability, you have to double your expenditure Cryptography is typically bypassed, not penetrated The [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.computerworld.com.au/index.php?id=1406778897&amp;fp=16&amp;fpid=0">Computerworld</a> informs about the on-line availability of the lectures given by <a href="http://www.rsasecurity.com">Rivest, Shamir and Adleman</a> when they received the 2002 ACM Turing Award.</p>
<p>I want to highlight Shamir&#8217;s <a href="http://www.acm.org/awards/turing_lectures_project/turing/S/s-pp/shamir_1files_files/TextOnly/Slide8.html">three laws of security</a>:</p>
<ul>
<li>Absolutely secure systems do not exist</li>
<li>To halve your vulnerability, you have to double your expenditure</li>
<li>Cryptography is typically bypassed, not penetrated</li>
</ul>
<p>The first two points show the importance of effective risk assessment while the third one emphasizes the fact that implementation flaws (opposed to algorithm design flaws) are usually the reason why systems using cryptography are subject to security breaches.</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.superadditive.com/2004/05/11/adi-shamirs-three-laws-of-security/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

