<?xml version='1.0' encoding='UTF-8'?><rss xmlns:atom='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' version='2.0'><channel><atom:id>tag:blogger.com,1999:blog-11628489</atom:id><lastBuildDate>Wed, 27 Aug 2008 14:19:03 +0000</lastBuildDate><title>TELCOM 2820: Cryptography</title><description/><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/</link><managingEditor>noreply@blogger.com (Prashant)</managingEditor><generator>Blogger</generator><openSearch:totalResults>9</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-8648582133229621528</guid><pubDate>Wed, 27 Aug 2008 14:17:00 +0000</pubDate><atom:updated>2008-08-27T07:19:03.473-07:00</atom:updated><title>Welcome: Fall 2008</title><description>Hi everyone. Welcome to TELCOM 2820/INFSCI 2170: Cryptography. For ease of use, I will refer to this course simply as TELCOM 2820. The first class is on Tuesday, August 27th, 2008 at 3.00 p.m. in Room IS 406. This blog will be used to point you to articles and news items of interest to this course. Please use an RSS aggregator/news reader (such as &lt;a href="http://www.newsgator.com/"&gt;Netnewswire Lite&lt;/a&gt;) for notification of updates and/or check this page regularly. Please look at previous posts to this blog. Some of the articles are still relevant.&lt;br /&gt;&lt;br /&gt;As you may notice, there have been few posts since 2006. I encourage students to send me articles of interest which I can post for others to see.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2008/08/welcome-fall-2008.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-115634192398646793</guid><pubDate>Wed, 23 Aug 2006 13:59:00 +0000</pubDate><atom:updated>2008-08-27T07:17:05.875-07:00</atom:updated><title>Welcome: Fall 2006</title><description>Hi everyone. Welcome to TELCOM 2820/INFSCI 2170: Cryptography. For ease of use, I will refer to this course simply as TELCOM 2820. The first class is on Tuesday, August 29th, 2006 at 3.00 p.m. in Room IS 404. This blog will be used to point you to articles and news items of interest to this course. Please use an RSS aggregator/news reader (such as &lt;a href="http://www.newsgator.com/"&gt;Netnewswire Lite&lt;/a&gt;) for notification of updates and/or check this page regularly. Please look at previous posts to this blog. Some of the articles are still relevant.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2006/08/welcome-fall-2006.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-114850374237328124</guid><pubDate>Wed, 24 May 2006 20:44:00 +0000</pubDate><atom:updated>2006-05-24T13:49:02.390-07:00</atom:updated><title>Cracking WEP/WPA</title><description>&lt;a href="http://docs.lucidinteractive.ca/index.php/Cracking_WEP_and_WPA_Wireless_Networks"&gt;This webpage&lt;/a&gt; (more a wiki) was Furled by 18 members today. For those not familiar with Furl, Furl.net is a site similar to del.icio.us - a social bookmarking site. The webpage in question provides detailed instructions on how to crack WEP using Aircrack, Kismet and a few other tools. Please do not abuse this information. This posting is for education purposes only.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2006/05/cracking-wepwpa.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-114831009119856542</guid><pubDate>Mon, 22 May 2006 14:59:00 +0000</pubDate><atom:updated>2006-05-22T08:01:31.200-07:00</atom:updated><title>Zfone from Zimmermann</title><description>The man who created PGP is back with Zfone, a software tool for encryption Voice over IP (VoIP) conversations. The New York Times today has an article about how this may affect phone tapping - you need to register with New York Times to access the article. &lt;a href="http://www.philzimmermann.com/EN/zfone/index.html"&gt;Here is a link&lt;/a&gt; to Zimmermann's page.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2006/05/zfone-from-zimmermann.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-114830988402085447</guid><pubDate>Mon, 22 May 2006 14:53:00 +0000</pubDate><atom:updated>2006-05-22T07:58:04.036-07:00</atom:updated><title>TELCOM 2820 in Fall 2006</title><description>TELCOM 2820/INFSCI 2170: Cryptography will be taught in Fall 2006 on Tuesdays from 3.00 - 5.50 p.m. The web page for this course is &lt;a href="http://www.sis.pitt.edu/%7Eprashant/tel2820"&gt;here&lt;/a&gt;. You can take this course if you are willing to do some algebra (no calculus here), you are familiar with the modulo operation and XOR, and can do C/Java/C# programming.  Cryptography is &lt;span style="font-weight: bold;"&gt;required&lt;/span&gt; for a &lt;a href="http://www.sis.pitt.edu/%7Elersais"&gt;security certification&lt;/a&gt; from the school.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2006/05/telcom-2820-in-fall-2006.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-111401829261294151</guid><pubDate>Wed, 20 Apr 2005 17:29:00 +0000</pubDate><atom:updated>2005-04-20T10:36:23.276-07:00</atom:updated><title>Identification and Two-factor Authentication</title><description>Here are the recent new items and articles related to this topic.&lt;br /&gt;&lt;ol&gt;   &lt;li&gt;Bruce Schneier's &lt;a href="http://www.schneier.com/blog/archives/2005/04/more_on_twofact.html"&gt;blog&lt;/a&gt;.&lt;/li&gt;   &lt;li&gt;The &lt;a href="http://www.counterpane.com/two-factor.pdf"&gt;PDF&lt;/a&gt; of Bruce Schneier's article in the &lt;span style="font-style: italic;"&gt;Communications of the ACM&lt;/span&gt;.&lt;/li&gt;   &lt;li&gt;&lt;a href="http://www.computing.co.uk/news/1161914"&gt;Report&lt;/a&gt; on a safer ID scheme in Microsoft's next OS version.&lt;/li&gt;&lt;li&gt;&lt;a href="http://www.nwfusion.com/columnists/2005/040405faceoff-rsa.html"&gt;Face-off&lt;/a&gt; in Network World Fusion.&lt;span class="down" style="display: block;" id="formatbar_CreateLink" title="Link" onmouseover="ButtonHoverOn(this);" onmouseout="ButtonHoverOff(this);" onmousedown="CheckFormatting(event);FormatbarButton('richeditorframe', this, 8);ButtonMouseDown(this);"&gt;&lt;/span&gt;  &lt;/li&gt;  &lt;/ol&gt;</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2005/04/identification-and-two-factor.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-111160773567314920</guid><pubDate>Wed, 23 Mar 2005 19:52:00 +0000</pubDate><atom:updated>2005-03-23T11:59:20.030-08:00</atom:updated><title>Crypto-gram</title><description>&lt;span style="font-weight: bold;"&gt;Cryptogram&lt;/span&gt; is a free newsletter that is written monthly by Bruce Schneier, well known security expert and author of &lt;span style="font-style: italic;"&gt;Applied  Cryptography&lt;/span&gt;. In the March 15th, 2005 issue, the newsletter talks about SHA-1 being broken and also has an essay on two-factor authentication. You can find cryptogram &lt;a href="http://www.schneier.com/crypto-gram.html"&gt;here&lt;/a&gt; and also subscribe to it if you wish. There is also an &lt;a href="http://www.computerworld.com/securitytopics/security/story/0,10801,95343,00.html"&gt;opinion piece&lt;/a&gt; by the same author in ComputerWorld about how successful cryptanalysis of popular hash functions like MD5 and SHA imply that there is now need for a new standard to replace them.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2005/03/crypto-gram.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-111157861568647344</guid><pubDate>Wed, 23 Mar 2005 11:47:00 +0000</pubDate><atom:updated>2005-03-23T03:50:15.690-08:00</atom:updated><title>Tutorial on Elliptic Curve Cryptography</title><description>Certicom has an online tutorial on &lt;span style="font-style: italic;"&gt;Elliptic Curve Cryptography &lt;/span&gt;with a Java applet showing how the shape and nature of an elliptic curve changes. You can find the tutorial &lt;a href="http://www.certicom.com/index.php?action=ecc_tutorial,home"&gt;here&lt;/a&gt;.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2005/03/tutorial-on-elliptic-curve.html</link><author>noreply@blogger.com (Prashant)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-11628489.post-111152459475742163</guid><pubDate>Tue, 22 Mar 2005 20:43:00 +0000</pubDate><atom:updated>2005-03-22T12:49:54.756-08:00</atom:updated><title>Primality Testing</title><description>&lt;a href="http://www.sciencenews.org/articles/20021026/bob9.asp"&gt;Here is an article&lt;/a&gt; about how a group of researchers in India have discovered a quick and accurate way of determining whether or not a number is prime. The article is dated October 2002. At the end of this article are references to the original paper that is available &lt;a href="http://www.cse.iitk.ac.in/primality.pdf"&gt;here&lt;/a&gt;.</description><link>http://www.sis.pitt.edu/~prashant/tel2820/blog/2005/03/primality-testing.html</link><author>noreply@blogger.com (Prashant)</author></item></channel></rss>
