<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss 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/" xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" version="2.0">

<channel>
	<title>gkomninos.com</title>
	
	<link>http://gkomninos.com</link>
	<description />
	<lastBuildDate>Thu, 12 Jan 2012 15:46:33 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
		<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/gkomninos/TSVw" /><feedburner:info uri="gkomninos/tsvw" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><item>
		<title>Index Calculus algorithm</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/xg2kL7Kd2ro/</link>
		<comments>http://gkomninos.com/141/programming/index-calculus-algorithm/#comments</comments>
		<pubDate>Thu, 12 Jan 2012 15:41:14 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=141</guid>
		<description><![CDATA[Here is an implementation in python of the Index Calculus Algorithm for solving the Discrete Logarithm Problem . There is a bug in the method def _solve_modulo_prime(A, B, n): »&#8217; Return the solution to Ax = B modulo n , where n i prime »&#8217; try: return (modMatInv(A,n) * B.T) % n except : return [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/141/programming/index-calculus-algorithm/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/141/programming/index-calculus-algorithm/</feedburner:origLink></item>
		<item>
		<title>Compute Discrete Logarithms with Chinese Remainder and pollard rho</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/YpdqT_cTHts/</link>
		<comments>http://gkomninos.com/132/programming/compute-discrete-logarithms-chinese-remainder-pollard-rho/#comments</comments>
		<pubDate>Wed, 28 Dec 2011 01:26:25 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=132</guid>
		<description><![CDATA[I have implemented in python another algorithm for solving the discrete logarithm problem ( DLP ) using the Chinese Remainder Theorem and Pollard&#8217;s rho algorithm. This algororithm factors the order n of the Group and computes the discrete log for each factor and combine the solutions using the Chinese Remainder Theorem.]]></description>
		<wfw:commentRss>http://gkomninos.com/132/programming/compute-discrete-logarithms-chinese-remainder-pollard-rho/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		<feedburner:origLink>http://gkomninos.com/132/programming/compute-discrete-logarithms-chinese-remainder-pollard-rho/</feedburner:origLink></item>
		<item>
		<title>Pollard’s rho algorithm for computing dicrete logarithms</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/aMFDqRGtQKQ/</link>
		<comments>http://gkomninos.com/127/programming/pollards-rho-algorithm-computing-dicrete-logarithms/#comments</comments>
		<pubDate>Sun, 25 Dec 2011 00:09:52 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[number theory]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=127</guid>
		<description><![CDATA[Here is an implementation in python of Pollard&#8217;s rho method for computing the discrete logarithm. This algorithm computes the dicrete logarithm of an element B in a group Zp with prime order n and generator alpha. Unfortunately this algorith runs in exponential time 2^(n/2). A faster algorithm ( subexponential ) is the Index Calculus algorithm. [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/127/programming/pollards-rho-algorithm-computing-dicrete-logarithms/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		<feedburner:origLink>http://gkomninos.com/127/programming/pollards-rho-algorithm-computing-dicrete-logarithms/</feedburner:origLink></item>
		<item>
		<title>Fermat’s factorization method in python</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/kEfdtvFeWmA/</link>
		<comments>http://gkomninos.com/121/programming/fermats-factorization-method-python/#comments</comments>
		<pubDate>Sat, 26 Nov 2011 19:43:14 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[cryptography]]></category>
		<category><![CDATA[fermat]]></category>
		<category><![CDATA[number theory]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=121</guid>
		<description><![CDATA[Few days ago I had to find the prime factors of a very big number N = 23360947609 . Fermat proposed a method for finding the factors of positive odd integers. His method is not very efficiently and in general you cannot compute the factors in polynomial time ( this assumption are based many cryptography [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/121/programming/fermats-factorization-method-python/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/121/programming/fermats-factorization-method-python/</feedburner:origLink></item>
		<item>
		<title>ns 2.35 network simulator on Ubuntu 10.04</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/DRepXoSjzK0/</link>
		<comments>http://gkomninos.com/112/programming/ns-2-35-network-simulator-ubuntu-10-04/#comments</comments>
		<pubDate>Sat, 26 Nov 2011 18:03:52 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[tutorials]]></category>
		<category><![CDATA[network simulation]]></category>
		<category><![CDATA[ns]]></category>
		<category><![CDATA[ubuntu]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=112</guid>
		<description><![CDATA[UPDATE: Just add /usr/lib to TCL_LIB Here is a step by step guide installing ns 2.35 on ubuntu 10.04 LTS. First download the package: wget http://downloads.sourceforge.net/project/nsnam/allinone/ns-allinone-2.35/ns-allinone-2.35.tar.gz?r=http%3A%2F%2Fwww.isi.edu%2Fnsnam%2Fns%2Fns-build.html&#038;ts=1322330697&#038;use_mirror=dfn second unzip in some folder: unzip ns-allinone-2.35 -d /home/giorgos Then make sure you have some important packages: sudo apt-get install build-essential autoconf automake libxmu-dev Then cd ns-allinone-2.35 and run [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/112/programming/ns-2-35-network-simulator-ubuntu-10-04/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/112/programming/ns-2-35-network-simulator-ubuntu-10-04/</feedburner:origLink></item>
		<item>
		<title>AES explained in a comic</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/6IQmJcerzNM/</link>
		<comments>http://gkomninos.com/108/tutorials/aes-explained-comic/#comments</comments>
		<pubDate>Thu, 10 Nov 2011 00:52:32 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[tutorials]]></category>
		<category><![CDATA[AES]]></category>
		<category><![CDATA[cryptography]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=108</guid>
		<description><![CDATA[The guy has done a nice job with this comic! http://www.moserware.com/2009/09/stick-figure-guide-to-advanced.html]]></description>
		<wfw:commentRss>http://gkomninos.com/108/tutorials/aes-explained-comic/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/108/tutorials/aes-explained-comic/</feedburner:origLink></item>
		<item>
		<title>Version Control and code sharing</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/UZDgtUJD8CY/</link>
		<comments>http://gkomninos.com/106/uncategorized/version-control-code-sharing/#comments</comments>
		<pubDate>Sat, 24 Sep 2011 20:09:33 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[uncategorized]]></category>
		<category><![CDATA[mercurial]]></category>
		<category><![CDATA[vcs]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=106</guid>
		<description><![CDATA[I never used version control systems. I realized that all serious developers use them. I have used in my job SVN but after a research and some trials I decided to use Mercurial. From now on I will host all the code I write ti bitbucket so it will be available to everyone ( including [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/106/uncategorized/version-control-code-sharing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/106/uncategorized/version-control-code-sharing/</feedburner:origLink></item>
		<item>
		<title>Notes about mysql indexes</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/5E8yEcIH8rg/</link>
		<comments>http://gkomninos.com/102/programming/mysql-indexes-work/#comments</comments>
		<pubDate>Tue, 20 Sep 2011 20:28:49 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[perfomance]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[cardinality]]></category>
		<category><![CDATA[indexes]]></category>
		<category><![CDATA[mysql]]></category>
		<category><![CDATA[tuning]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=102</guid>
		<description><![CDATA[Look at this answer on how mysql indexes work on stackoverflow. Basically an index on a table works like an index in a book (that&#8217;s where the name came from): Let&#8217;s say you have a book about databases and you want to find some information about, say, storage. Without an index (assuming no other aid, [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/102/programming/mysql-indexes-work/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/102/programming/mysql-indexes-work/</feedburner:origLink></item>
		<item>
		<title>Sudoku Solver in Python with Recursion – Maybe a Solution</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/-f5G8DRZt1c/</link>
		<comments>http://gkomninos.com/100/programming/sudoku-solver-python-recursion-solution/#comments</comments>
		<pubDate>Wed, 17 Aug 2011 22:46:52 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[sudoku solver]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=100</guid>
		<description><![CDATA[Continue from here. I managed to find a solution which worked for 2 puzzles I checked. I am sure it will not work always, but I like the solution. It is clear and without much code. I find all the possible numbers that can be inserted in each cell. If the cell has only one [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/100/programming/sudoku-solver-python-recursion-solution/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		<feedburner:origLink>http://gkomninos.com/100/programming/sudoku-solver-python-recursion-solution/</feedburner:origLink></item>
		<item>
		<title>Sudoku Solver in Python part 3</title>
		<link>http://feedproxy.google.com/~r/gkomninos/TSVw/~3/DCtcLESJ4Uc/</link>
		<comments>http://gkomninos.com/96/programming/sudoku-solver-python-part-3/#comments</comments>
		<pubDate>Sat, 13 Aug 2011 16:36:22 +0000</pubDate>
		<dc:creator>Giorgos</dc:creator>
				<category><![CDATA[programming]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[sudoku solver]]></category>

		<guid isPermaLink="false">http://gkomninos.com/?p=96</guid>
		<description><![CDATA[Previous post here I continued my try to solve Sudoku with Python. Actually I have never solve a Sudoku puzzle myself Here is the updated code # -*- coding: utf-8 -*- &#34;&#34;&#34; Created on Wed Aug 11 18:22:44 2011 &#160;@author: gkomninos &#34;&#34;&#34; from Position import Position &#160;class Puzzle(object): &#160;&#160;&#160;&#160;errors_number = 0 &#160;&#160;&#160;&#160;'''A Sudoku puzzle''' &#160;&#160;&#160;&#160;def [...]]]></description>
		<wfw:commentRss>http://gkomninos.com/96/programming/sudoku-solver-python-part-3/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		<feedburner:origLink>http://gkomninos.com/96/programming/sudoku-solver-python-part-3/</feedburner:origLink></item>
	</channel>
</rss>

