<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Local-Search on unordered</title>
		<link>https://unorde.red/categories/local-search/</link>
		<description>Recent content in Local-Search on unordered</description>
		<generator>Hugo</generator>
		<language>en-US</language>
		
		
		
		
			<lastBuildDate>Fri, 29 Sep 2017 00:00:00 +0000</lastBuildDate>
		
			<atom:link href="https://unorde.red/categories/local-search/feed.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Hashwalk</title>
				<link>https://unorde.red/hashwalk/</link>
				<pubDate>Fri, 29 Sep 2017 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/hashwalk/</guid>
				<description>&lt;p&gt;&lt;a href=&#34;https://github.com/avanpo/hashwalk&#34;&gt;Hashwalk&lt;/a&gt; is an exercise in futility. It&#xA;attempts to mount a preimage attack on a cryptographic hash function by using&#xA;local search. This is essentially a poor man&amp;rsquo;s differential cryptanalysis.&lt;/p&gt;&#xA;&lt;p&gt;A good, general purpose cryptographic hash function should exhibit the avalanche&#xA;effect. This means that a small change in the input (e.g. a single bit flip)&#xA;results in a large change in the output (e.g. approximately half of the bits&#xA;being flipped). In other words, the function should be psuedorandom. A hash&#xA;function that isn&amp;rsquo;t psuedorandom is unsuitable for many cryptographic use cases,&#xA;since it may leak information on the data being hashed.&lt;/p&gt;</description>
			</item>
			<item>
				<title>Particle swarm optimization</title>
				<link>https://unorde.red/particle-swarm-optimization/</link>
				<pubDate>Wed, 15 Jul 2015 00:00:00 +0000</pubDate>
				<guid>https://unorde.red/particle-swarm-optimization/</guid>
				<description>&lt;p&gt;Particle swarm optimization (PSO) is a local search metaheuristic. It was initially developed by Kennedy, Eberhart and Shi in the late 1990s, and was meant to simulate social behaviour such as birds flocking to a promising position in a multi-dimensional space. A simplified version of the algorithm was found to perform optimization, which led to its adoptation as a local search algorithm.&lt;/p&gt;&#xA;&lt;p&gt;The algorithm is easy to implement, and makes very few assumptions about the problem. PSO can be applied to a wide range of optimization problems, as it does not use the objective function&amp;rsquo;s gradient and therefore does not require the objective function to be differentiable.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
