<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress.com" -->
<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/"
	>

<channel>
	<title>hash &amp;laquo; WordPress.com Tag Feed</title>
	<link>http://en.wordpress.com/tag/hash/</link>
	<description>Feed of posts on WordPress.com tagged "hash"</description>
	<pubDate>Thu, 26 Nov 2009 16:14:01 +0000</pubDate>

	<generator>http://en.wordpress.com/tags/</generator>
	<language>en</language>

<item>
<title><![CDATA[The Hash]]></title>
<link>http://gonetoguam.wordpress.com/2009/11/24/the-hash/</link>
<pubDate>Tue, 24 Nov 2009 12:30:09 +0000</pubDate>
<dc:creator>gonetoguam</dc:creator>
<guid>http://gonetoguam.wordpress.com/2009/11/24/the-hash/</guid>
<description><![CDATA[Marijuana&#8230;.. Ha. Kidding. The Guam Hash is a running group on island and I had heard about it ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Marijuana&#8230;.. Ha. Kidding.  The Guam Hash is a running group on island and I had heard about it from a few people and was told it was an experience I should definitely have.  And an experience it was.</p>
<p>Hash is different from any other running I&#8217;ve done because its cross-country, not road running.  My lack of coordination and wobbly ankles always made me loathe cross-country running, but I thought I should suck it up for this.  The trails are not up and down grassy hills or on the side of local roads where there should damn well be a sidewalk, but through the jungle, forests, and grassland-ish forests of Guam.  </p>
<p>Each week a different team member marks the track, or should I say tracks.  Whlle there are markers along the way, there are &#8220;checks&#8221; you meat in the trail that are shaped like X&#8217;s, which mean the trail can go any direction.  There are markers on the false trails too, that could lead you far off the trail down to a dead end.  You run up hills down hills, and although we&#8217;d didn&#8217;t last week, even rivers or creeks you have to wade/swim through to get to the other side of the trail.  </p>
<p>It was in the end this guy Matt and his girlfriend Rachel who I ended up going to Hash with.  They told me about one time right at the beginning of the trail there was a puddle that looked about an inch deep that he ran through.  Except, he didn&#8217;t quite make it, because he disappeared completely into the &#8220;puddle&#8221; that was over 5 feet deep.  Sometimes the trail-blazers are cruel, sometimes they make it pretty straight forward.  (This past Saturday&#8217;s was supposedly pretty tame.)  However we did get a BEAUTIFUL view of Haputo beach (see &#8220;The discovery&#8221; post) and the adjacent cove&#8217;s cliffs down to the island.  </p>
<p>So, pretty cool you run through the forest, BUT the most interesting past of the &#8220;definite experience&#8221; I was promised comes after the run.  </p>
<p>At the beginning of the run, they pull the first-timer&#8217;s to the front to explain the trail markings but also to explain hashing.  &#8220;The hash is not a race or competition, we hash to get to the beer at the end of the trail.&#8221;  So you pay 6 dollars to do the race, and that pays for the coolers of water and beer and a big table of snacks at the end.  You then wait for everyone to get back and set up for &#8220;religion&#8221;. </p>
<p>The hash &#8220;tyrant&#8221; and &#8220;RA&#8221; start up the ritualistic hash meeting.  You have to wear any non-hash shirts inside-out to religion.  You can&#8217;t use names (only hash nicknames), and you have to point with your elbow.  If its your first time you have to go up and introduce yourself, tell a joke, sing a song, or show a body part (?!), and drink a beer from the &#8220;sacred vessel&#8221;, which is in fact&#8230;.  a bedpan.  The middle-aged hash members know some pretty ridiculous hash songs that they sing throughout the bonfire.  </p>
<p>Okay, so its pretty much a co-ed fraternity for cross-country runners age 18-70 (though co-ed doesn&#8217;t really accurately represent the 4:1 ratio of guys:girls).  But it was a fun experience and I think I&#8217;ll definitely do the run in the future (religion is always optional), and I met some fun people that I went out with later that night.</p>
<p>Its incredible how many fun groups and activities there are to do on this little speck of land.  Next week is horseback riding!!</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[[REN-ISAC] Notification - URL redirecting to a phishing web page]]></title>
<link>http://referer.wordpress.com/2009/11/22/ren-isac-notification-url-redirecting-to-a-phishing-web-page/</link>
<pubDate>Sun, 22 Nov 2009 10:09:22 +0000</pubDate>
<dc:creator>referer</dc:creator>
<guid>http://referer.wordpress.com/2009/11/22/ren-isac-notification-url-redirecting-to-a-phishing-web-page/</guid>
<description><![CDATA[Hello Gabriel Iovino, http://referer.us/1/UdBiS3 created by our free redirection service (http://ref]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Hello Gabriel Iovino,</p>
<p><span style="text-decoration:underline;"><span style="color:#3366ff;">http://referer.us/1/UdBiS3 </span></span><br />
created by our <a href="http://referer.us/">free redirection service</a> (<a href="http://referer.us/">http://referer.us/</a>) and it redirects to <span style="color:#3366ff;"><span style="text-decoration:underline;">http://planetchiltern.com/phpformgenerator/use/striker/form1.html</span></span><br />
I checked this page and it looks NOT like a phishing webpage, it&#8217;s a sign UP page, not a sign in. Then I checked &#8220;<span style="text-decoration:underline;"><span style="color:#3366ff;">planetchiltern.com</span></span>&#8221; on McAfee SiteAdvisor, it says fine.<!--more--></p>
<p>&#8220;<span style="text-decoration:underline;"><span style="color:#3366ff;">vn27.9hz.com</span></span>&#8221; seems a phishing site according to &#8220;<a href="http://www.phishtank.com/phish_detail.php?phish_id=869455">phishtank.com</a>&#8220;, however, I cannot open it.</p>
<p>Therefor, I will not remove the url or block the site, thank you for your email and understanding.</p>
<p>Best regards,</p>
<p>======= At 2009-11-22, 05:48:49 you wrote: =======</p>
<blockquote><p>&#62;&#8212;&#8211;BEGIN PGP SIGNED MESSAGE&#8212;&#8211;<br />
&#62;Hash: SHA1<br />
&#62;<br />
&#62;Greetings,<br />
&#62;<br />
&#62;The following URL on your network has been identified as redirecting to<br />
&#62;a Phishing webpage:<br />
&#62;<br />
&#62;!!Warning these URL(s) may contain live malware!!<br />
&#62;<br />
&#62;[url]hxxp://referer.us/1/UdBiS3<br />
&#62;<br />
&#62;Path to this URL was seen via these links:<br />
&#62;<br />
&#62;1. hxxp://vn27.9hz.com/<br />
&#62;2. hxxp://referer.us/1/UdBiS3<br />
&#62;3. hxxp://planetchiltern.com/phpformgenerator/use/striker/form1.html<br />
&#62;<br />
&#62;Here is the Phishing email with full mail headers:<br />
&#62;</p>
<blockquote><p>&#62;&#62; Return-Path: &#60;bintsann@staff.pccu.edu.tw&#62;<br />
&#62;&#62; Received: from relays.pccu.edu.tw (relays.pccu.edu.tw [140.137.16.12])<br />
&#62;&#62; by smtp.xxx.edu (8.14.3/8.14.3) with ESMTP id nAKNEtMW017993<br />
&#62;&#62; for &#60;xxx@xxx.xxx.edu&#62;; Fri, 20 Nov 2009 15:14:56 -0800<br />
&#62;&#62; Received: from faculty.pccu.edu.tw (faculty.pccu.edu.tw [140.137.16.1])<br />
&#62;&#62; by relays.pccu.edu.tw (Postfix) with ESMTP id 915E81CAD80;<br />
&#62;&#62; Sat, 21 Nov 2009 07:14:50 +0800 (CST)<br />
&#62;&#62; From: &#8220;bintsann&#8221; &#60;bintsann@staff.pccu.edu.tw&#62;<br />
&#62;&#62; Reply-To: webmaster.team0@live.com<br />
&#62;&#62; Subject: System Administrator<br />
&#62;&#62; Date: Sat, 21 Nov 2009 07:14:50 +0800<br />
&#62;&#62; Message-Id: &#60;20091120231450.M94072@staff.pccu.edu.tw&#62;<br />
&#62;&#62; X-Mailer: OpenWebMail 2.53<br />
&#62;&#62; X-OriginatingIP: 213.255.218.244 (bintsann)<br />
&#62;&#62; MIME-Version: 1.0<br />
&#62;&#62; Content-Type: text/plain;<br />
&#62;&#62; charset=big5<br />
&#62;&#62; To: undisclosed-recipients:;<br />
&#62;&#62; Content-Transfer-Encoding: quoted-printable<br />
&#62;&#62; X-MIME-Autoconverted: from 8bit to quoted-printable by smtp.xxx.edu id nAKNEuee018002<br />
&#62;&#62;<br />
&#62;&#62; Your mailbox has exceeded the storage limit which is 20GB as set by your=20<br />
&#62;&#62; administrator; you are currently running on 20.9GB,<br />
&#62;&#62;<br />
&#62;&#62; You may not be able to send or receive new mail until you re-validate you=<br />
&#62;&#62; r=20<br />
&#62;&#62; mailbox.<br />
&#62;&#62;<br />
&#62;&#62; To re-validate your mailbox please click the link below:<br />
&#62;&#62;<br />
&#62;&#62; hxxp://vn27.9hz.com/<br />
&#62;&#62;<br />
&#62;&#62; If the link above doesn=A1=A6t work please copy and paste the link below =<br />
&#62;&#62; to your=20<br />
&#62;&#62; browser window<br />
&#62;&#62;<br />
&#62;&#62; hxxp://vn27.9hz.com/<br />
&#62;&#62;<br />
&#62;&#62; Thanks Bintsann Staff, =20<br />
&#62;&#62; System Administrator</p></blockquote>
<p>&#62;<br />
&#62;Should you feel you&#8217;ve received this report in error, please let us know.<br />
&#62;<br />
&#62;On behalf of the REN-ISAC Team,<br />
&#62;<br />
&#62;Gabriel Iovino<br />
&#62;Principal Security Engineer, REN-ISAC<br />
&#62;http://www.ren-isac.net<br />
&#62;24&#215;7 Watch Desk +1(317)278-6630<br />
&#62;&#8212;&#8211;BEGIN PGP SIGNATURE&#8212;&#8211;<br />
&#62;Version: GnuPG v1.4.9 (MingW32)<br />
&#62;Comment: Using GnuPG with Mozilla &#8211; http://enigmail.mozdev.org/<br />
&#62;<br />
&#62;iEYEARECAAYFAksItKEACgkQwqygxIz+pTvlggCgsu4RXH6LfyMbZzGqpDxMX3xl<br />
&#62;CqAAn0WytQ9D5&#215;4477RMHUmyOjhnDXxJ<br />
&#62;=i9YP<br />
&#62;&#8212;&#8211;END PGP SIGNATURE&#8212;&#8211;</p></blockquote>
<p>= = = = = = = = = = = = = = = = = = = =</p>
<p>@<a href="http://referer.us/">referer.us</a><br />
2009-11-22</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Skillet Breakfast Hash - A One Pot Wonder]]></title>
<link>http://dishinanddishes.wordpress.com/2009/11/21/skillet-breakfast-hash-a-one-pot-wonder/</link>
<pubDate>Sat, 21 Nov 2009 20:43:16 +0000</pubDate>
<dc:creator>dishinanddishes</dc:creator>
<guid>http://dishinanddishes.wordpress.com/2009/11/21/skillet-breakfast-hash-a-one-pot-wonder/</guid>
<description><![CDATA[A cast iron skillet. My mom gave me this skillet, and I&#8217;m reluctant to post this recipe becaus]]></description>
<content:encoded><![CDATA[A cast iron skillet. My mom gave me this skillet, and I&#8217;m reluctant to post this recipe becaus]]></content:encoded>
</item>
<item>
<title><![CDATA[Trabalho Acadêmico: Robustez da Prova Digital - A Importância do Hash no Processo Judicial]]></title>
<link>http://foren6.wordpress.com/2009/11/20/hash-robustez-da-prova-digital/</link>
<pubDate>Fri, 20 Nov 2009 12:04:23 +0000</pubDate>
<dc:creator>foren6</dc:creator>
<guid>http://foren6.wordpress.com/2009/11/20/hash-robustez-da-prova-digital/</guid>
<description><![CDATA[Compartilho abaixo conteúdo gerado durante o curso de pós-graduação em Computação Forense, oferecido]]></description>
<content:encoded><![CDATA[Compartilho abaixo conteúdo gerado durante o curso de pós-graduação em Computação Forense, oferecido]]></content:encoded>
</item>
<item>
<title><![CDATA[OPHCrack]]></title>
<link>http://darchack.wordpress.com/2009/11/19/ophcrack/</link>
<pubDate>Thu, 19 Nov 2009 13:25:50 +0000</pubDate>
<dc:creator>admin</dc:creator>
<guid>http://darchack.wordpress.com/2009/11/19/ophcrack/</guid>
<description><![CDATA[Shall I compare thee to a Summer&#8217;s day? Thou art more lovely and more temperate, OPHCrack easi]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Shall I compare thee to a Summer&#8217;s day?<br />
Thou art more lovely and more temperate,</p>
<p>OPHCrack easily surpasses William Shakespeare&#8217;s &#8211; Sonnet #18, when compared to a summer&#8217;s day, OPHCrack rules.</p>
<p>What is OPHCrack, well,</p>
<p>If you have ever lost a password, email, twitter, facebook, etc, usually it can be recovered, but it is still a pain, because usually they will send you  a totally (intentionaly) non-memorable password, a*$^jkH13)#, or something of the like.</p>
<p>Well, what happens when you forget you Windows login password, there is no such thing as a, Forgot your passsword?, We&#8217;ll send you an email!</p>
<p>The easiest, <strong>software</strong>, way to get back into your computer is with a lovely piece of <strong>free </strong>software, OPHCrack. Thou art a beautiful Windows Password Recovery Tool, should one ever need the like.</p>
<p>_______________________________________________</p>
<p><!--more--></p>
<p>It&#8217;s an ISO Image. Now, you might be thinking, &#8216;Umm&#8230;Yes&#8230;.Okay&#8230;.How do I work with that?&#8217;</p>
<p>It&#8217;s actually quite simple, ISO Images, are like  disk images, if you&#8217;ve ever run across a pirated piece of software, it may download as an ISO Image, (ISO Images can compress whole folders, somewhat like a .zip file, hence thier moderate use in the computing world), you might then need to &#8220;Mount this image&#8221;, making your computer think this image is in CD or DVD form, and therefore in a drive in the computer, allowing it to install.</p>
<p>There is another thing you can do with ISO images, however, is to actually burn them to a disk. Then, once you do that, you can install your program as if you had actually bought the full disk.</p>
<p>What we are going to be doing though, is burning this image, and then booting off of it.</p>
<p>To do this, we first need to burn this image, you can do this with Nero, or specialized programs.</p>
<p>Remember <strong>not</strong> to extract the ISO, then burn it, but <strong>rather </strong>burn the ISO still in ISO form.</p>
<p>To do this on a mac, view instructions <a href="http://www.macosxhints.com/article.php?story=20060619181010389" target="_blank">here</a></p>
<p>Once burned, put the CD or DVD (should be a CD, one shouldn&#8217;t need a DVD) in your <strong>default </strong>(built-in) CD or DVD drive.</p>
<p>Now, reboot your computer, and as soon as the first screen comes up, <strong>not the one that shows your edition of XP or Vista</strong> (XP Home Edition etc.)</p>
<p>But the one before that, if you can read fast, it shows you your type of BIOS, mine is Phoenix.</p>
<p>Anyways, you need to look up at the top right of your screen (usually), and press the corresponds to &#8220;Boot Menu&#8221;, it will then ask you where you want to boot from, select IDE CD (or DVD) Device, and sit back.</p>
<p>Now, you should see a bunch of information passing down your screen. Ignore it.</p>
<p>When you finally see an Operating System, you need to click &#8220;Save to File&#8221;.</p>
<p>Click, &#8220;Save Session&#8221;</p>
<p>Click on &#8220;tux&#8221;</p>
<p>Click on &#8220;Desktop&#8221;</p>
<p>Save it as something, (default is &#8220;ophcrack.txt&#8221;, this is fine.)</p>
<p>Now, it may crash, so make sure you&#8217;ve done the above process qiuckly.</p>
<p>If it doesn&#8217;t crash, then follow the on screen instructions, then skip down to the section below, ***Shut Down***</p>
<p>When it does crash, you will see a Command Prompt sort of thing, close this.</p>
<p>Then look towards the bottom left of your screen. You should see a black box with a &#8220;&#62;_&#8221; in white, click on this.</p>
<p>It will open up the command prompt thing again.</p>
<p>Type &#8220;ophcrack&#8221; and hit enter.</p>
<p>Click load, or load session, something like that.</p>
<p>Navigate back to the .txt file you saved.</p>
<p>Write down the LM Hash for the user you want to crack.</p>
<p>It should be something like &#8220;1e347e7g7467hyu3837er89&#8243;</p>
<p>Something like that.</p>
<p>***Shut Down***</p>
<p>To shut down, you need to right click on the desktop, (after closing OPHCrack),</p>
<p>and click Logout, which will open a small window, asking you what you want to do, click &#8220;Reboot Computer&#8221;.</p>
<p>Now go to <a href="http://www.objectif-securite.ch/en/products.php" target="_blank">this site</a> and type in you LM Hash, click submit. It should give you your password.</p>
<p>Yay.</p>
<p>admin</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Alcoholics Unanimous / Toys @ 27]]></title>
<link>http://mehtakyakehta.wordpress.com/2009/11/19/alcoholics-unanimous-toys-27/</link>
<pubDate>Thu, 19 Nov 2009 05:17:08 +0000</pubDate>
<dc:creator>Aditya Mehta</dc:creator>
<guid>http://mehtakyakehta.wordpress.com/2009/11/19/alcoholics-unanimous-toys-27/</guid>
<description><![CDATA[Photographs by Poonamshree Kumar &#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;]]></description>
<content:encoded><![CDATA[Photographs by Poonamshree Kumar &#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;]]></content:encoded>
</item>
<item>
<title><![CDATA[Mmmm, salty.]]></title>
<link>http://chimpy.wordpress.com/2009/11/18/mmmm-salty/</link>
<pubDate>Wed, 18 Nov 2009 17:09:00 +0000</pubDate>
<dc:creator>Mr Chimp</dc:creator>
<guid>http://chimpy.wordpress.com/2009/11/18/mmmm-salty/</guid>
<description><![CDATA[So you want a database of users, giving each one a username and password so that they can log into y]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>So you want a database of users, giving each one a username and password so that they can log into your website. There are lots of different ways you can do this. The simpler you make it the simpler it is to hack. So let&#8217;s make it difficult!</p>
<p><strong>The Easy Way</strong><br />
The simplest way to accomplish the above is this:</p>
<ol>
<li>Take the user name and password.</li>
<li>Put it in the database.</li>
<li>When they try to log in do something like this: &#8220;SELECT Count(id) FROM users WHERE username=&#8217;$givenusername&#8217; AND password=&#8217;$givenpassword&#8217;&#8221;</li>
<li>if $row[0] is &#62; 0 then the credentials are valid and the user can be logged in.</li>
</ol>
<p>This seems simple enough. Not very secure though. What if someone gains access to the database? They can instantly look up a user, find out their password and log in as them with no-one being any the wiser. Fair enough, you might think, but if someone&#8217;s looking at my database then there are bigger security problems to worry about than the log in. You&#8217;d have a point. Let&#8217;s say that you have a mate, Dave, who owns the server but doesn&#8217;t run the website. He has access to the database, finds the passwords and decides to be a prankster. Well done, Dave. Very funny. We need some extra security, I think.</p>
<p><strong>A Little Harder.</strong><br />
So, we want to make it so that, even if someone can see what&#8217;s stored in the database, they can&#8217;t use it to log into the site. So what we can do is make a <a href="http://en.wikipedia.org/wiki/Hash_function">hash</a> of the password and store that in the database instead of the plaintext password. A making a hash means taking the original string and applying some algorithm which results in a seemingly random string of characters. This string then <em>cannot</em> be transformed back into the original string. This is also sometimes known as one-way encryption, because it can be encrypted but not decrypted. NOTE: There are a lot of different hash algorithms, many of which are available in PHP. For the following examples I will use the SHA256 algorithm. There are lots of different hash algorithms about, I&#8217;ll let you figure out which one to use (hint: MD5 is pretty weak. SHA1 is probably OK for now, but you may as well use something stronger, it&#8217;s not hard!).</p>
<p>So now our process looks like this:</p>
<ol>
<li>Take the username and hashed password.</li>
<li>Put them in the database.</li>
<li>When someone logs in make a hash of the password.</li>
<li>Do something like this: &#8220;SELECT Count(id) FROM users WHERE username=&#8217;$givenusername&#8217; AND password=&#8217;$hashofgivenpassword&#8217;&#8221;</li>
<li>If $row[0] &#62; 0 then they&#8217;re allowed in.</li>
</ol>
<p>So now people can&#8217;t see the passwords even if they gain access to your database! Brilliant! So now we&#8217;re totally secure, right? Sure, unless the potential hacker has a rainbow table. What&#8217;s a rainbow table? Are you talking to yourself? Yes. Ok.</p>
<p><strong>Rainbow Tables</strong><br />
&#8220;What&#8217;s a rainbow table,&#8221; I hear myself ask. Imagine you wanted an easy way to figure out passwords from their hashes so that you could easily break into websites secured using our method above. What would you do? Well, for a start you could make a lookup table for common hash functions so that you look up the hash and find strings that they are made from. That would make it easy, wouldn&#8217;t it? Yes, it would. Yes, people do it. And, yes, that&#8217;s what a rainbow table is.</p>
<p>So how do we prevent someone from doing that? Well, for practical reasons rainbow tables only exist up to a certain length of input string. Let&#8217;s do some maths to illustrate. Let&#8217;s say we have 26 lower case letters, 26 upper case letters, 10 numeric digits, and 10 special characters from which we can create our password. That&#8217;s 72 characters in all. So for a string of length 1 we have 72 possibilities. For length 2 we have 72&#215;72. Let&#8217;s make PHP work it out for us:</p>
<pre class="brush: php;">
$chars = 72;
$max = 10;
for ($x=1;$x&#60;$max;$x++){
	$result = pow(72, $x);
	echo $x . ' = ' . number_format($result, 2) . '&#60;br&#62;';
}
</pre>
<p>Result:<br />
<code>1 = 72<br />
2 = 5,184<br />
3 = 373,248<br />
4 = 26,873,856<br />
5 = 1,934,917,632<br />
6 = 139,314,069,504<br />
7 = 10,030,613,004,288<br />
8 = 722,204,136,308,736<br />
9 = 51,998,697,814,228,992</code></p>
<p>So, if the password is 9 characters long then there will be several million million possibilities. This means that to store the rainbow table for all these hashes someone would need several petabytes of storage.</p>
<p>So, what? Only allow passwords over 9 characters long? Well that would help security overall, but it&#8217;s not the most elegant solution. For that we&#8217;re gonna need some salt.</p>
<p>At this point, you may be thinking &#8220;Really? Is it worth it?&#8221; and you&#8217;d have a point. Someone would already have to gain access to your database and spend however long it takes finding results in a rainbow table. When all&#8217;s said and done it depends on how secure you want to be. For a personal website you could probably get away with the above. However, if you&#8217;ve got a reasonably big user-base it&#8217;s nice to know that even if someone does hack their way in and has all the data laid out in front of them, they still wouldn&#8217;t be able to figure out the passwords. It doesn&#8217;t take much more to add that extra level of security. It&#8217;s also worth bearing in mind that there are plenty of people out there who would do it just because they can. The fact that your website is boring as hell and only contains information that you are interested in doesn&#8217;t mean that no-one will try and hack it.</p>
<p><strong>Mmmm, Salty: The Hard Way</strong><br />
To make it harder (or, hopefully, impossible) to find the password from the hash we add a <em>salt</em> to the password before we run it through the hash function. In fact, for the best security we use two salts &#8211; one we&#8217;ll keep the same from user to user (we&#8217;ll call this $master_salt) and one which will be generated per-user (we&#8217;ll call this $user_salt).</p>
<p>So what&#8217;s the process now?</p>
<ol>
<li>Take the username and password.</li>
<li>Hash the password.</li>
<li>Create a $user_salt by making a random number and hashing it.</li>
<li>Concatenate them together ($master_salt . $hashed_password . $user_salt). This gives us one very long string of random numbers and letters.</li>
<li>Make a hash of this string.</li>
<li>Store this hash <em>and the user hash</em> in the database.</li>
<li>When the user logs in, look up the user hash.</li>
<li>Make a hash of the given password.</li>
<li>Concatenate these together in the same way as when the password was made.</li>
<li>Try and get a row from the database: &#8220;SELECT Count(id) FROM users WHERE username = &#8216;givenusername&#8217; AND password = &#8216;biglonghashthatwejustmade&#8217;&#8221;</li>
<li>If $row[0] &#62; 1 then they&#8217;re allowed in</li>
</ol>
<p>As you can see there a lot more steps, but once you get your head around what&#8217;s actually happening it&#8217;s not that much more difficult.</p>
<p>Bear in mind that you don&#8217;t have to use the exact method as above, you can always obfuscate it even more. Some people use a hash of the username as the $user_hash. And then add 7. And hash it three more times using different algorithms. And write it backwards. It&#8217;s up to you.</p>
<p>Hopefully that makes some sense. I&#8217;ve now written more on the subject that I did for my entire A-levels, so I hope it was worth it!</p>
<p><strong>Hash Algorithms</strong><br />
PHP includes a lot of different algorithms for hashing. I&#8217;ve written a little script to give you an idea of what they all look like. It&#8217;s also quite useful if you need to make one-off hash by hand.</p>
<pre class="brush: plain;">
&#60;?php
if ($_SERVER['REQUEST_METHOD'] == 'POST'){
	$input = $_POST['input'];
	foreach (hash_algos() as $algo){
		echo '&#60;b&#62;' . $algo . ':&#60;/b&#62; ' . hash($algo, $input) . '&#60;br&#62;';
	}
} ?&#62;
&#60;form action=&#34;#&#34; method=&#34;post&#34;&#62;
	&#60;input type=&#34;text&#34; name=&#34;input&#34;&#62;
	&#60;input type=&#34;submit&#34; name=&#34;submit&#34; value=&#34;submit&#34;&#62;
&#60;/form&#62;
</pre>
<p>Just type a word into the box and you&#8217;ll be a shown a list of all all the hashes available from your PHP installation. Lovely job!</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Turkey Hash Recipe]]></title>
<link>http://erinsawesomeblog.com/2009/11/18/turkey-hash-recipe/</link>
<pubDate>Wed, 18 Nov 2009 14:49:48 +0000</pubDate>
<dc:creator>erinfm</dc:creator>
<guid>http://erinsawesomeblog.com/2009/11/18/turkey-hash-recipe/</guid>
<description><![CDATA[This recipe is a good one from Gourmet. I always love turkey for Thanksgiving, and not so much the d]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p style="text-align:center;"><a href="http://erinlovesdesign.wordpress.com/files/2009/11/re-leftovers-turkeyhash-608.jpg"><img class="size-full wp-image-3044 aligncenter" title="re-leftovers-turkeyhash-608" src="http://erinlovesdesign.wordpress.com/files/2009/11/re-leftovers-turkeyhash-608.jpg" alt="" width="497" height="310" /></a></p>
<p>This recipe is a good one from Gourmet.  I always love turkey for Thanksgiving, and not so much the days after. Here&#8217;s a good way to turn it into a savory breakfast.</p>
<p>Turkey Hash<br />
Serves 4</p>
<p>* Active time:25 min<br />
* Start to finish:1 hr</p>
<p>Thanksgiving turkey makes its way into a breakfast favorite. And we add crisp, fruity Cubanelle peppers, instead of everyday bell peppers, to make this dish really special.</p>
<p>* 1 1/2 lb medium Yukon Gold potatoes<br />
* 7 tablespoons unsalted butter, divided<br />
* 1 medium onion, finely chopped<br />
* 2 Cubanelle peppers (Italian green frying peppers),<br />
* 1 cup shredded cooked turkey (preferably dark meat)<br />
* 4 large eggs<br />
Generously cover potatoes with cold water, then simmer, partially covered, until just tender, 20 to 25 minutes. Drain. Cool slightly, then peel and coarsely grate with a box grater.</p>
<p>While potatoes cool, melt 6 tablespoons butter in a 12-inch nonstick skillet over medium-high heat and cook onion and peppers, stirring occasionally, until golden brown, 8 to 10 minutes.</p>
<p>Add potatoes, turkey, 3/4 teaspoon salt, and 1/2 teaspoon pepper and cook, turning occasionally, until browned in spots, 15 to 20 minutes. Transfer hash to plates.</p>
<p>Fry eggs in remaining tablespoon butter in skillet over medium heat. Serve on top of hash.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[SCCM 2007 clients may report a hash mismatch when we run a package that has been configured to download and run ]]></title>
<link>http://aditan.wordpress.com/2009/11/16/sccm-2007-clients-may-report-a-hash-mismatch-when-we-run-a-package-that-has-been-configured-to-download-and-run/</link>
<pubDate>Mon, 16 Nov 2009 16:23:12 +0000</pubDate>
<dc:creator>Aditi Tandon</dc:creator>
<guid>http://aditan.wordpress.com/2009/11/16/sccm-2007-clients-may-report-a-hash-mismatch-when-we-run-a-package-that-has-been-configured-to-download-and-run/</guid>
<description><![CDATA[When we run a version of the Microsoft SCCM 2007 Advanced Client that is configured to download and ]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>When we run a version of the Microsoft SCCM 2007 Advanced Client that is configured to download and run a package, the SCCM 2007 clients may report a hash mismatch. </p>
<p>We may receive the following 10075 status message on the SCCM console, status messages:<br />
The program for advertisement  has failed because content download for the package &#8211;  has failed.<br />
The download failed because the content downloaded to the client does not match the content specified in the package source.<br />
At the Client computer, we may see the following messages:<br />
1)	in the Execmgr.log file on the Advanced Client computer:<br />
OnContentAvailable program  NOT available, 0&#215;80091007 Fatal error 0&#215;80008602 encountered for program . This program will not retry.<br />
2)	in the Cas.log file on the Advanced Client computer:<br />
Download completed for content package  under context System Hash does not match expected , actual<br />
Download failed for content package  under context System, error 0&#215;80091007 Successfully raised SoftDistHashMismatchEvent event. </p>
<p>Cause:</p>
<p>We may experience this problem when the following events occur in the following order:<br />
1.	The package source is modified.<br />
2.	A new distribution point is added to the package.<br />
3.	The package source is downloaded from the new distribution point before a package update occurs. Note The problem does not occur if an SMS administrator specifies the Use a compressed copy of the source directory option for the package.</p>
<p>Resolution:<br />
1)	Check how the Package has been created on the SCCM 2007 Console.<br />
a)	In our case, a software had already been imported to the library, by giving the source location as D:\Packages\\source.<br />
b)	“This package contains source files” and “Always obtain files from source directory” had been provided at the time of providing the Data Source details.<br />
If the “Use a compressed copy of the source directory” would have been used, this error would not have occurred.<br />
c)	Later, install.bat was added to this location [D:\Packages\\source], and the package had not been updated to the DP, however, an advert had been created using the install.bat.<br />
Always update the DP after modifying the source, and before creating a new Advertisement for the package/program.<br />
d)	Also, this would have worked if the install.bat was placed at another location [not at D:\Packages\\source] and then used to create the Program.<br />
 [Install.bat was used to create the program only, and in our case, it may or maynot be a part of the source.]<br />
A program is updated via a policy in SCCM 2007, and doesn’t need the package to be updated, everytime a new program is created for the package.<br />
2)	If the problem persists, make sure that the directory browsing option is turned on for the SMS_DP_SMSPKG virtual directory in Microsoft Internet Information Services (IIS) Manager. To do this, follow these steps:<br />
a.	Use an account that has administrative credentials to log on to a computer that is acting as the SMS distribution point.<br />
b.	Click Start, point to Administrative Tools, and then click Internet Information Services (IIS) Manager.<br />
c.	Expand the name of the server that is running IIS, expand Web Sites, expand Default Web Site, right-click SMS_DP_SMSPKGC$, and then click Properties.<br />
d.	On the Virtual Directory tab, make sure that the Directory Browsing option is turned on, and then click OK.<br />
e.	Repeat step 4 for each package subfolder in the SMS_DP_SMSPKGC$ virtual directory.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Hash - Not Corned Beef]]></title>
<link>http://dawnieq.wordpress.com/2009/11/16/hash-not-corned-beef/</link>
<pubDate>Mon, 16 Nov 2009 02:42:20 +0000</pubDate>
<dc:creator>dawnieq</dc:creator>
<guid>http://dawnieq.wordpress.com/2009/11/16/hash-not-corned-beef/</guid>
<description><![CDATA[Even So-Cal is getting a bit brisk in the evening, especially since it gets dark at 5:00pm.  I wante]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Even So-Cal is getting a bit brisk in the evening, especially since it gets dark at 5:00pm.  I wanted something homey, and warm, and filling for dinner and my search turned up this totally yummy <a href="http://kblog.lunchboxbunch.com/2009/10/sweet-potato-tofu-hash-vegan-comfort.html" target="_blank">Sweet Potato Tofu Hash</a>.  It was exactly what the doctor ordered, a little sweet, a little smokey and spicy, with the crunch of almonds and a little bit of freshness from the parsley.  It was super easy to throw together in one pot, gotta love those one pot meals; just a little chopping, and stirring and it was done.  Plus the beautiful thing is I have enough leftover for lunch tomorrow and my son can have some for dinner tomorrow (he&#8217;s at his father&#8217;s house tonight so he missed out).  I threw the sweet potato in my daughter&#8217;s oven while I ran to <a href="http://sprouts.com/home.php" target="_blank">Sprouts</a> to pick up some tofu.  Fortunately she lives next door so this wasn&#8217;t out of my way.  While I was there I picked up a carton of <a href="http://www.silksoymilk.com/products/silk-seasonal/pumpkin-spice">Pumpkin Spice Silk</a>, which I thought would make a super delicious pumpkin pie shake/smoothie.  I guess I&#8217;m just in the mood for all the holiday type flavors.  I feel a batch of the Best Pumpkin Muffins from VWAV coming over me.  Stay warm!</p>
<p>(Bad picture, I forgot to throw the battery on the charger so I had to use the old camera again!)</p>
<p><img class="alignnone size-medium wp-image-31" title="scramble" src="http://dawnieq.wordpress.com/files/2009/11/scramble.jpg?w=300" alt="scramble" width="300" height="168" /></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Cannabis Cultuurprijs (cannabis culture award)]]></title>
<link>http://marijuanacannabis.wordpress.com/2009/11/13/cannabis-cultuurprijs-cannabis-culture-award/</link>
<pubDate>Fri, 13 Nov 2009 08:45:11 +0000</pubDate>
<dc:creator>marijuanacannabis</dc:creator>
<guid>http://marijuanacannabis.wordpress.com/2009/11/13/cannabis-cultuurprijs-cannabis-culture-award/</guid>
<description><![CDATA[The Cannabis Cultuurprijs 2009, now in its sixth year, is presented to individuals who have made sig]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><a href="http://www.hashmuseum.com"><img class="size-full wp-image-852 alignnone" title="Cannabis Cultuurprijs 2009" src="http://marijuanacannabis.wordpress.com/files/2009/11/ccp2009en1.gif" alt="Cannabis Cultuurprijs 2009" width="510" height="102" /></a></p>
<p>The Cannabis Cultuurprijs 2009, now in its sixth year, is presented to individuals who have made significant contributions towards the acceptance of cannabis in all its forms and to the reintegration of marihuana and hemp culture into modern society.</p>
<p>At a time when &#8216;zero tolerance&#8217; is replacing the &#8216;tolerance policy&#8217; it is more important than ever to acknowledge those who have made a genuine difference to the perception and use of this unfairly maligned plant.</p>
<p>Though other prizes exist in the sphere of cannabis and hemp, only the <em>Cannabis Cultuurprijs</em> celebrates improvements to quality of life and knowledge in quite this way.</p>
<p>The prize itself promotes the achievements of the winner: a unique exhibit dedicated to each one is created for public viewing. Displays honoring previous winners Jack Herer and Ed Rosenthal are on show in the <a href="http://www.hashmuseum.com/" target="_blank">Hash Marihuana &#38; Hemp Museum. </a>Last year’s winner, the late Simon Vinkenoog, is represented in the Hemp Gallery.</p>
<p>A monetary award of €3000 is also presented. The prize is annually awarded in November. It is independently funded and therefore free from political influence.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[How to crack User Password?]]></title>
<link>http://pramonotunggul.wordpress.com/2009/11/13/how-to-crack-user-password/</link>
<pubDate>Fri, 13 Nov 2009 04:17:38 +0000</pubDate>
<dc:creator>pramonotunggul</dc:creator>
<guid>http://pramonotunggul.wordpress.com/2009/11/13/how-to-crack-user-password/</guid>
<description><![CDATA[Crack other user password is not difficult, it&#8217;s just another interesting stuff to do. What yo]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Crack other user password is not difficult, it&#8217;s just another interesting stuff to do. What you need is<br />
you must have access to another person computer who&#8217;s using linux, once you get the shadow file, you can see the password in plain text.</p>
<p>Shadow File is a File in which password hash is located.<br />
<code><br />
/etc/passwd<br />
</code><br />
<code><br />
/etc/shadow<br />
</code><br />
you can crack them all and see the password in PLAIN text. <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_biggrin.gif' alt=':D' class='wp-smiley' />  </p>
<p><b><br />
John The Ripper<br />
</b></p>
<blockquote><p>
John The Ripper is a tool that specially created for password cracking purpose.
</p></blockquote>
<p><b><br />
How to Crack User Password?<br />
</b></p>
<blockquote><p>
1. Steal Password File</p>
<blockquote><p>
Inside the Password File, there are password hashes of all users in that computer.<br />
The password Hashes will be in MD5 Format (For Ubuntu Hardy and below) and SHA Format (For Ubuntu Jaunty and Karmic)</p>
<p>There are tons of ways to steal the password file, but I will support with my way.<br />
<code><br />
scp [username]@[IP]:/etc/passwd ~/Desktop/<br />
</code><br />
<code><br />
scp [username]@[IP]:/etc/passwd ~/Desktop/<br />
</code></p>
<p>That code will make copies of the password file from the victim computer to your desktop.</p>
</blockquote>
<p>2. John The Ripper in Action</p>
<blockquote><p>
<code><br />
cd ~/Desktop<br />
</code><br />
<code><br />
sudo john --show<br />
</code></p>
<p>And that will show all EASY passwords but if you stiill don&#8217;t get what you want, you will want <i>John The Ripper</i> to work more for you.</p>
<p><code><br />
sudo john<br />
</code></p>
<p>That will make <i>John The Ripper</i> do some attacks to the file.</p>
<p>If you are lucky enough, your attack will last a few seconds, but if the password is veryyy strong, it can take weeks.</p>
</blockquote>
</blockquote>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Zastosowanie hasha]]></title>
<link>http://virtal.wordpress.com/2009/11/12/zastosowanie-hasha/</link>
<pubDate>Thu, 12 Nov 2009 11:23:21 +0000</pubDate>
<dc:creator>virtal</dc:creator>
<guid>http://virtal.wordpress.com/2009/11/12/zastosowanie-hasha/</guid>
<description><![CDATA[Treść to esencja &#8211; informacja w sieci jest najbardziej cenna, a im więcej tych informacji w te]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p style="text-align:justify;">Treść to esencja &#8211; informacja w sieci jest najbardziej cenna, a im więcej tych informacji w tekście tym lepiej.  Jeżeli treść jest unikalna zostaje niemalże natychmiast indeksowana przez wyszukiwarki.  Dobrze dobrany nagłówek i opis artykułu dopełnia daną treść, jeżeli te dwa elementy są adekwatne do treści artykułu to Googlebot indeksując  zawartość danych stron dobrze je ze sobą wiąże.<img title="More..." src="http://www.virtal.pl/wp-includes/js/tinymce/plugins/wordpress/img/trans.gif" alt="" /><!--more--></p>
<p style="text-align:justify;"><strong>Zastosowanie # przed stronicowaniem artykułu</strong></p>
<p style="text-align:justify;">W momencie zwracania wyników wyszukiwania na zapytanie internauty są wyświetlane najbardziej adekwatne wyniki.  Jeżeli treść przykładowo ze strony trzeciej danego artykułu bardziej pasuje do zapytania, to wyświetli właśnie link do tej strony. Gdy zastosujemy # przed stronicowaniem to ta treść nie jest widoczna dla Google i nie zostanie ona wyświetlona w SERPie. Czyli rezygnujemy z pozyskiwania użytkowników. Zazwyczaj za <em>hashem</em> ukrywa się zbędne informacje dla wyszukiwarek aby adresy URL były jak najbardziej czytelne i &#8216;czyste&#8217;.</p>
<p style="text-align:justify;">Jeszcze jeden przykład jaki można  podać to taki, jeżeli internauta uzna daną treść za interesującą i zechciałby się nią podzielić, np. przez umieszczanie do niej linka (a będzie to jedna z kilku stron artykułu) to osoby w niego klikające zostaną odesłane nie do konkretnej strony ale do pierwszej. Może to zostać uznane za niepotrzebne wprowadzanie w błąd ponieważ na pierwszy rzut oka informacje nie będą zawarte tam gdzie powinny.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[bash: string to integer conversion]]></title>
<link>http://brianin3d.wordpress.com/2009/11/11/bash-string-to-integer-conversion/</link>
<pubDate>Wed, 11 Nov 2009 14:25:00 +0000</pubDate>
<dc:creator>brianin3d</dc:creator>
<guid>http://brianin3d.wordpress.com/2009/11/11/bash-string-to-integer-conversion/</guid>
<description><![CDATA[Bash arrays are odd, globally scoped critters which can only be indexed by integer values&#8230; but]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Bash arrays are odd, globally scoped critters which can only be indexed by integer values&#8230; but the values don&#8217;t have to be contiguous so they are sort of like hash maps&#8230; </p>
<p>All you need is something to convert strings to integers, for example:</p>
<pre>
_map_string_to_integer() {
	echo ${*} &#124; od -t u1 &#124; sed 's,[^ ]*,,;s, ,,g;' &#124; tr -d '\n'
	echo
}
</pre>
<p>And you can use it like this:</p>
<pre>
% fun[$(_map_string_to_integer this)]="is neat"
% echo ${fun[$(_map_string_to_integer this)]}
is neat
</pre>
<p>if that is of any use to anyone&#8230;.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[MD5, SHA1 funciones de hash]]></title>
<link>http://seifreed.org/2009/11/10/md5-sha1-funciones-de-has/</link>
<pubDate>Tue, 10 Nov 2009 00:41:38 +0000</pubDate>
<dc:creator>Marc Rivero López</dc:creator>
<guid>http://seifreed.org/2009/11/10/md5-sha1-funciones-de-has/</guid>
<description><![CDATA[Es algo bastante extendido en Internet. MD5 y SHA1 sirve para comprobar la integridad de un fichero.]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Es algo bastante extendido en Internet. MD5 y SHA1 sirve para comprobar la integridad de un fichero.</p>
<p>Es decir si ese fichero<strong> ha podido ser modificado o no</strong>.</p>
<p>Naturalmente es un tema bastante importante ya que, con este tipo de métodos podemos verificar que realmente estamos descargando y usando algo que proviene de la fuente original y no ha sido modificado por terceros.</p>
<p>Empezaremos por MD5 de echo es el más conocido y extendido por Internet.</p>
<p><span style="color:#ff0000;"><strong>Que es MD5?</strong></span></p>
<blockquote><p>Es uno de los algoritmos de reducción criptográficos diseñados por el profesor <a title="Ronald Rivest" href="http://es.wikipedia.org/wiki/Ronald_Rivest">Ronald Rivest</a> del <a title="MIT" href="http://es.wikipedia.org/wiki/MIT">MIT</a> (<em>Massachusetts Institute of Technology</em>, Instituto Tecnológico de Massachusetts). Fue desarrollado en <a title="1991" href="http://es.wikipedia.org/wiki/1991">1991</a> como reemplazo del algoritmo <a title="MD4" href="http://es.wikipedia.org/wiki/MD4">MD4</a> después de que <a title="Hans Dobbertin" href="http://es.wikipedia.org/wiki/Hans_Dobbertin">Hans Dobbertin</a> descubriese su debilidad.A pesar de su amplia difusión actual, la sucesión de problemas de seguridad detectados desde que, en <a title="1996" href="http://es.wikipedia.org/wiki/1996">1996</a>, <a title="Hans Dobbertin" href="http://es.wikipedia.org/wiki/Hans_Dobbertin">Hans Dobbertin</a> anunciase una <a title="Colisión (hash)" href="http://es.wikipedia.org/wiki/Colisi%C3%B3n_%28hash%29">colisión de <em>hash</em></a> plantea una serie de dudas acerca de su uso futuro.</p></blockquote>
<p>Como comentaba antes, MD5 es el sistema más utilizado.</p>
<p><span style="color:#ff0000;"><strong>Comprobando MD5 en Windows</strong></span></p>
<p>Veamos un ejemplo:</p>
<p>Nos queremos descargar una ISO de Debian, por ejemplo vamos a la página de descargas.</p>
<p><a href="http://cdimage.debian.org/debian-cd/5.0.3/i386/iso-cd/" target="_blank">Pagina de descargas de Debian</a></p>
<p>Nos descargamos la ISO.</p>
<p>La página de descargas ya nos ofrece un fichero para comprobar las firmas que es este:</p>
<p><a href="http://cdimage.debian.org/debian-cd/5.0.3/i386/iso-cd/MD5SUMS" target="_blank">Fichero MD5</a></p>
<p>Vamos a sacar el MD5 de la imagen del CD de Debian en Windows. Yo lo he echo con el programa MD5SUM.</p>
<p>Lo podemos descargar de aqui:</p>
<p><a href="http://www.etree.org/md5com.html" target="_blank">MD5SUM</a></p>
<p>Después de descargarlo y probarlo nos sale esto:</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/comprobar_md51.png"><img class="aligncenter size-full wp-image-1813" title="comprobar_md5" src="http://seifreed.wordpress.com/files/2009/11/comprobar_md51.png" alt="comprobar_md5" width="500" height="143" /></a></p>
<p>Como veis nos da el hash, ahora vamos a comprobarlo con el hash que nos ofrecen:</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/md5_comprobado.png"><img class="aligncenter size-full wp-image-1814" title="md5_comprobado" src="http://seifreed.wordpress.com/files/2009/11/md5_comprobado.png" alt="md5_comprobado" width="497" height="24" /></a></p>
<p>Si miráis en la web que os he pasado antes la de <a href="http://cdimage.debian.org/debian-cd/5.0.3/i386/iso-cd/MD5SUMS" target="_blank">Fichero MD5</a>. Podemos ver que la firma ofrecida y la que hemos comprobado <strong>son iguales</strong>. Es decir, la ISO que tenemos es <strong>totalmente original</strong>.</p>
<p><strong><span style="color:#ff0000;">Comprobando MD5 en Ubuntu:</span></strong></p>
<p>Primero de todo instalaremos un paquete que nos hace falta:</p>
<blockquote><p>sudo apt-get install sleuthkit</p></blockquote>
<p>Instalamos el paquete y ya podemos comprobar la integridad del fichero.</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/md5_ubuntu.png"><img class="aligncenter size-full wp-image-1815" title="md5_ubuntu" src="http://seifreed.wordpress.com/files/2009/11/md5_ubuntu.png" alt="md5_ubuntu" width="500" height="120" /></a></p>
<p>Con esto obtenemos el hash MD5 en Ubuntu</p>
<p><span style="color:#ff0000;"><strong>Comprobando MD5 en MAC OS X</strong></span></p>
<p>En MAC utilizaremos una herramienta que nos comprueba el hash, lo podemos encontrar aquí:</p>
<p><a href="http://www.apple.com/downloads/macosx/networking_security/md5_eternalstormssoftware.html" target="_blank">MD5</a></p>
<p>Lo utilizamos y calculamos el hash MD5 que queramos:</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/md5_mac_os_x.png"><img class="aligncenter size-full wp-image-1816" title="MD5_mac_os_x" src="http://seifreed.wordpress.com/files/2009/11/md5_mac_os_x.png" alt="MD5_mac_os_x" width="500" height="161" /></a></p>
<p>Ahora vamos por el SHA1.</p>
<p>Aunque no tan utilizado como el MD5, se tiende a migrar ya hacia el SHA1.</p>
<blockquote><p>es un sistema de <a title="Función hash" href="http://es.wikipedia.org/wiki/Funci%C3%B3n_hash">funciones <em>hash</em></a> criptográficas relacionadas de la <a title="Agencia de Seguridad Nacional de los Estados Unidos" href="http://es.wikipedia.org/wiki/Agencia_de_Seguridad_Nacional_de_los_Estados_Unidos">Agencia de Seguridad Nacional de los Estados Unidos</a> y publicadas por el <em>National Institute of Standards and Technology</em> (NIST). El primer miembro de la familia fue publicado en <a title="1993" href="http://es.wikipedia.org/wiki/1993">1993</a> es oficialmente llamado <strong>SHA</strong>. Sin embargo, hoy día, no oficialmente se le llama <strong>SHA-0</strong> para evitar confusiones con sus sucesores. Dos años más tarde el primer sucesor de SHA fue publicado con el nombre de <strong>SHA-1</strong>. Existen cuatro variantes más que se han publicado desde entonces cuyas diferencias se basan en un diseño algo modificado y rangos de salida incrementados: <strong>SHA-224</strong>, <strong>SHA-256</strong>, <strong>SHA-384</strong>, y <strong>SHA-512</strong> (llamándose <strong>SHA-2</strong> a todos ellos).</p></blockquote>
<p>Vamos a ver como podemos comprobar la firma SHA1.</p>
<p>En la misma imagen de Debian.</p>
<p>Primero vemos como la página nos ofrece las firmas de hash</p>
<p><a href="http://cdimage.debian.org/debian-cd/5.0.3/i386/iso-cd/SHA1SUMS" target="_blank">Hashes SHA1</a></p>
<p>Comprobando firmas sha1 en Windows</p>
<p>Para hacer la comprobación de sha1 nos tenemos que descargar el ejecutable, lo podemos encontrar aqui:</p>
<p><a href="ftp://ftp.gnupg.org/gcrypt/binary/sha1sum.exe" target="_blank">Sha1sum</a></p>
<p>Lo ejecutamos y comprobamos la firma</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/sha1_windows.png"><img class="aligncenter size-full wp-image-1817" title="sha1_windows" src="http://seifreed.wordpress.com/files/2009/11/sha1_windows.png" alt="sha1_windows" width="500" height="35" /></a></p>
<p>Ya tenemos nuestra firma SHA1 que podemos comprobar con nuestro fichero.</p>
<p><span style="color:#ff0000;"><strong>Comprobando Sha1 en Ubuntu.</strong></span></p>
<p>Con el paquete que instalamos antes no haría falta instalar nada más.</p>
<p>Miremos como se hace:</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/sha1_ubuntu.png"><img class="aligncenter size-full wp-image-1818" title="sha1_ubuntu" src="http://seifreed.wordpress.com/files/2009/11/sha1_ubuntu.png" alt="sha1_ubuntu" width="500" height="52" /></a></p>
<p>Ya tenemos nuestra firma en sha1.</p>
<p>Comprobando Sha1 en MAC OS X</p>
<p>Por último en mac, para hacerlo utilizaremos la librería de openssl +sha1</p>
<p>veamos el comando sería así:</p>
<blockquote><p>/usr/bin/openssl sha1 fichero</p></blockquote>
<p>Asi que veamos un ejemplo:</p>
<p><a href="http://seifreed.wordpress.com/files/2009/11/sha1_mac_osx.png"><img class="aligncenter size-full wp-image-1819" title="sha1_mac_osx" src="http://seifreed.wordpress.com/files/2009/11/sha1_mac_osx.png" alt="sha1_mac_osx" width="447" height="51" /></a></p>
<p>Y hasta aquí todo, espero que desde ahora vigiléis lo que os bajais.</p>
<p>&#160;</p>
<p>Saludos</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Recipe: Soyrizo Hash]]></title>
<link>http://bayarearefugee.wordpress.com/2009/11/09/recipe-soyrizo-hash/</link>
<pubDate>Tue, 10 Nov 2009 00:05:26 +0000</pubDate>
<dc:creator>bayarearefugee</dc:creator>
<guid>http://bayarearefugee.wordpress.com/2009/11/09/recipe-soyrizo-hash/</guid>
<description><![CDATA[Just for fun, I thought it would be good to look up what is actually considered a &#8220;hash&#8221;]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><img class="aligncenter size-medium wp-image-359" title="potats5" src="http://bayarearefugee.wordpress.com/files/2009/11/potats5.jpg?w=300" alt="potats5" width="300" height="225" />Just for fun, I thought it would be good to look up what is actually considered a &#8220;hash&#8221; in the popular lexicon. As any person of my generation would obviously do, I went straight to Wikipedia for the accepted definition.</p>
<blockquote><p><strong>Hash</strong> is an <a title="Cuisine of the United States" href="http://en.wikipedia.org/wiki/Cuisine_of_the_United_States">American</a> dish consisting of a mixture of <a title="Beef" href="http://en.wikipedia.org/wiki/Beef">beef</a> (often <a title="Corned beef" href="http://en.wikipedia.org/wiki/Corned_beef">corned beef</a> or <a title="Roast beef" href="http://en.wikipedia.org/wiki/Roast_beef">roast beef</a>), <a title="Onion" href="http://en.wikipedia.org/wiki/Onion">onions</a>, <a title="Potato" href="http://en.wikipedia.org/wiki/Potato">potatoes</a>, and <a title="Spice" href="http://en.wikipedia.org/wiki/Spice">spices</a> that are mashed together into a coarse, chunky <a title="Paste" href="http://en.wikipedia.org/wiki/Paste">paste</a>, and then cooked, either alone, or with other ingredients. Occasionally, the term can be used to refer to any mixture of finely chopped ingredients.</p></blockquote>
<p>With that in my pocket, I feel pretty safe calling this dish a &#8220;hash.&#8221; It&#8217;s about as simple a recipe as any I&#8217;ve shared, and probably one of the cheapest, to boot. If you&#8217;re patient, you can get a real nice crisp on the hash, which mixes wonderfully with the subtle spice of this meat-imitation. Toss a couple over-medium eggs on top and throw in some corn tortillas and I promise you&#8217;ll have happy faces all around. This recipe is really meant for two, so do some math if you need more.</p>
<h3><!--more--><img class="alignleft size-medium wp-image-364" title="potats1" src="http://bayarearefugee.wordpress.com/files/2009/11/potats11.jpg?w=300" alt="potats1" width="216" height="162" /><img class="alignleft size-medium wp-image-365" title="potats2" src="http://bayarearefugee.wordpress.com/files/2009/11/potats21.jpg?w=300" alt="potats2" width="216" height="162" />Ingredients</h3>
<ul>
<li>Four or five yukon gold potatoes, diced</li>
<li>One green onion stalk, diced</li>
<li>1/4 &#8211; 1/3 tube of soyrizo-like product</li>
<li>2 tbsp canola oil</li>
<li>4 eggs</li>
<li>6 corn tortillas</li>
</ul>
<h3>Instructions</h3>
<p><img class="aligncenter size-medium wp-image-370" title="potats3" src="http://bayarearefugee.wordpress.com/files/2009/11/potats3.jpg?w=300" alt="potats3" width="300" height="225" />In a heavy bottom frying pan, preferably cast-iron, heat the oil. Add the potatoes and allow to cook through, making sure to stir occasionally to keep from burning. This will probably take close to 10 minutes. Once the potatoes are cooked, but not soft, add the onions. Season to taste.</p>
<p><img class="aligncenter size-medium wp-image-371" title="potats4" src="http://bayarearefugee.wordpress.com/files/2009/11/potats4.jpg?w=300" alt="potats4" width="300" height="225" />Add the soyrizo-like product, forming an even layer. After a couple minutes, give it a good stir. Form another even layer and press done in order to give it a solid crisp. In the meantime, it&#8217;s good to start prepping those eggs.</p>
<p><strong>How much this will set you back: </strong>half a pound of soyrizo-like product $1 ($.50 a serving); 2 lbs yukon gold potatoes $1 ($.50); 4 eggs, $.70 ($.35); miscellaneous items, $.50 ($.25). Total: $3.20 ($1.60)</p>
<p><strong>How long this will take:</strong> 15 minutes.</p>
<p>&#160;</p>
<ul></ul>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Timetraveling with GIT]]></title>
<link>http://aslakjohansen.wordpress.com/2009/11/08/timetraveling-with-git/</link>
<pubDate>Sun, 08 Nov 2009 16:50:00 +0000</pubDate>
<dc:creator>aslakjohansen</dc:creator>
<guid>http://aslakjohansen.wordpress.com/2009/11/08/timetraveling-with-git/</guid>
<description><![CDATA[or checking out a specific commit. First, one has to locate the hash of the commit. This can be done]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>or checking out a specific commit.</p>
<p>First, one has to locate the hash of the commit. This can be done by:</p>
<ol>
<li>Scanning the log by running &#8220;<tt>git log</tt>&#8221; (press <b>q</b> to quit). Look for lines labeled <em>commit</em>.</li>
<li>
    Scanning the log in <a href="http://live.gnome.org/giggle">giggle</a>. Look for the SHA-line. Example:<br />
    <a href="http://aslakjohansen.wordpress.com/files/2009/11/screenshot-home-aslak-vcs-git-masterthesis-giggle.png"><img src="http://aslakjohansen.wordpress.com/files/2009/11/screenshot-home-aslak-vcs-git-masterthesis-giggle.png" alt="Screenshot of Giggle, click to enlarge" title="Screenshot of Giggle, click to enlarge" width="450" height="256" class="aligncenter size-full wp-image-203" border="0" /></a>
  </li>
</ol>
<p>In this case our hash is <tt>7f8d2051582dd030e3c07ded70010af033461e31</tt>.</p>
<p>Then, come up with a name for a branch to refer the this specific revision. For this example we will use <em>old-branch</em>.</p>
<p>Last, set up the branch by running:<br />
<tt><br />
git checkout -b old-branch 7f8d2051582dd030e3c07ded70010af033461e31<br />
</tt></p>
<p><b>Syntax:</b> The general syntax is: &#8220;<tt>git checkout -b BRANCHNAME HASH</tt>&#8220;</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[ser.t.]]></title>
<link>http://bipolarizzando.wordpress.com/2009/11/05/sert/</link>
<pubDate>Thu, 05 Nov 2009 20:03:43 +0000</pubDate>
<dc:creator>falsefat</dc:creator>
<guid>http://bipolarizzando.wordpress.com/2009/11/05/sert/</guid>
<description><![CDATA[che cos&#8217;è il Ser.T. Il SerT è un servizio interdisciplinare nel quale lavorano medici, psicolo]]></description>
<content:encoded><![CDATA[che cos&#8217;è il Ser.T. Il SerT è un servizio interdisciplinare nel quale lavorano medici, psicolo]]></content:encoded>
</item>

</channel>
</rss>
