<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/css" href="skins/rss_style.css" ?>
<rss version="2.0" >
 <channel>
   <title>DC949 News</title>
   <link>http://www.dc949.org/news.php</link>
   <language>en-us</language>
   <description></description>
<!-- <docs>This is an RSS 2.0 file intended to be viewed in a newsreader or syndicated to another site. For more information on RSS check : http://www.feedburner.com/fb/a/aboutrss</docs> -->
   <generator>CuteNews</generator>
<item>
<title><![CDATA[Kwanza meeting]]></title>
<link>http://www.dc949.org/news.php?subaction=showfull&amp;id=1230332749&amp;archive=</link>
<description><![CDATA[We'll be meeting tonight, the first day of Kwanza.&nbsp; We didn't have a meeting yesterday since it was x-mas, Chipotle's was closed, it was raining, and it seemed like everyone was busy anyway.<br><br>BTW, we'll probably have some tech stuff tonight.&nbsp; I'll also explain some differences between XFS and EXT2/3/4 so people can make the most of their hardware.&nbsp; I'm also curious as to how many people currently support XFS.<br><br>Yeah, I know the notice if pretty late (4 hours before the meeting), but I think word crept through IRC and then via the grapevine to the regulars.<br>

]]></description>
<guid isPermaLink="false">1230332749</guid>
<pubDate>Fri, 26 Dec 2008 15:05:49 -0800</pubDate>
</item><item>
<title><![CDATA[RSA 256-bit pwnage, large keys... not so much]]></title>
<link>http://www.dc949.org/news.php?subaction=showfull&amp;id=1226650357&amp;archive=</link>
<description><![CDATA[I gave a little demo of how to derive a private RSA key from someone's 256-bit public RSA key a while back.&nbsp; If one takes this exercise to the next level and attempts to break a 512-bit key, they should get a feel for how things scale.<br><br>A 1024-bit key is not going to be broken in a reasonable amount of time on standard computers.&nbsp; There are the paranoid people who think that even 4096-bit keys are easily broken by "the government."&nbsp; I haven't seen any proof, and it would either take a very large amount of CPU power (i.e. quantum computers, and other things which haven't become a reality yet) and/or a revolutionary algorithm which has eluded all mathimatitions for literally thousands of years.&nbsp; In thier defense though, it wouldn't be public knowledge if someone did find a way.&nbsp; And it's better to error on the safe side.<br><br><a href="http://www.schneier.com/blog/archives/2008/06/kaspersky_labs.html" target="_self">Bruce Schneier's take</a><br><a href="http://slashdot.org/it/01/02/05/1911258.shtml" target="_self">Not even slashdot says it's feasible</a><br><a href="http://stason.org/TULARC/security/pgp/3-5-Has-RSA-ever-been-cracked-publicly-What-is-RSA-129.html" target="_self">426-bit key broken in 5000 MIPS-years</a><br><br>I hope the skeptics continue to support encryption; without it we know we're wide open for any MiM to take the data; with it we at least have a chance at gaining some privacy.&nbsp; At a minimum it would severely limit the number of people who could read the encrypted message, and isn't that worth the trouble of clicking the encrypt button and entering your passphrase?<br><br>The files from my demo:<a href="http://www.dc949.org/dc949_rsa_cracking.tar.bz2" target="_self">&nbsp; dc949_rsa_cracking.tar.bz2</a><br>

]]></description>
<guid isPermaLink="false">1226650357</guid>
<pubDate>Fri, 14 Nov 2008 00:12:37 -0800</pubDate>
</item><!-- News Powered by CuteNews: http://cutephp.com/ --></channel></rss>