<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.theiphonewiki.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jmh9072</id>
	<title>The iPhone Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.theiphonewiki.com/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jmh9072"/>
	<link rel="alternate" type="text/html" href="https://www.theiphonewiki.com/wiki/Special:Contributions/Jmh9072"/>
	<updated>2026-06-09T06:49:45Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.31.14</generator>
	<entry>
		<id>https://www.theiphonewiki.com/w/index.php?title=Talk:NCK_Brute_Force&amp;diff=15852</id>
		<title>Talk:NCK Brute Force</title>
		<link rel="alternate" type="text/html" href="https://www.theiphonewiki.com/w/index.php?title=Talk:NCK_Brute_Force&amp;diff=15852"/>
		<updated>2011-02-05T04:52:50Z</updated>

		<summary type="html">&lt;p&gt;Jmh9072: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Permanent unlock? ==&lt;br /&gt;
Is this method usable to permanently unlock the iPhone (like IPSF) aka upgrade resistant and not needing a software like signal.app (and being able to use SIM PIN Code)?&lt;br /&gt;
This would allowed to have the &amp;quot;official&amp;quot; unlock (except activation)?&lt;br /&gt;
&lt;br /&gt;
== Time calculations ==&lt;br /&gt;
&lt;br /&gt;
How long would it take to search the 15 digit one?&lt;br /&gt;
&lt;br /&gt;
Geohots NCKBF program could do around 100,000 keys/second which would produce a hit in many years, or complete a search in 317 years.&lt;br /&gt;
&lt;br /&gt;
To get to a point where this is actually doable we would need many orders of magnitude of improvement. Even if you use a PSP3 or special hardware (within 1,000 US$ range) you will only get an improvement of 20-100 times.. which doesn't help much. - Deco&lt;br /&gt;
&lt;br /&gt;
I assume in the article there's something wrong regarding time calculation. It states that for 8 bit you need 5 mins and we have 15 bit. That would mean 128 fold more or only 11 hours with a PC two years old. That must be wrong. -- [[User:Http|http]] 08:26, 24 July 2010 (UTC)&lt;br /&gt;
&lt;br /&gt;
It's clear now. We are talking about decimal digits, not bits! So it takes 10&amp;lt;sup&amp;gt;(15-8)&amp;lt;/sup&amp;gt; times longer, or about 95 years. -- [[User:Http|http]] 21:53, 5 August 2010 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Cloud project ==&lt;br /&gt;
&lt;br /&gt;
Using a system like BOINC ( known for seti @ home) would not help to distribute the load ?&lt;br /&gt;
&lt;br /&gt;
If Apple sold 10 Million devices, and lets say maybe 10k to 100k people participated, &lt;br /&gt;
we should be able to reduce that time from, lets say 200 years to a maximum of 2 weeks to 2 months.&lt;br /&gt;
&lt;br /&gt;
Now we would just need someone to create a modified client, manage the calculated packages and provide the packages which would need to be calculated/crunched.&lt;br /&gt;
&lt;br /&gt;
Just an idea.&lt;br /&gt;
&lt;br /&gt;
Chris&lt;br /&gt;
&lt;br /&gt;
And you'll end up with exactly ''one'' unlocked iPhone. Better off selling the machine hours. ~geohot&lt;br /&gt;
&lt;br /&gt;
But with such a project you could compare the results of every calculation not only with one iPhone, but with a list of all iPhones that have registered in the project. That's the advantage of brute force attack. So it would still be possible I think - assuming we could create such a network. But it could also arise legal problems. -- [[User:Http|http]] 08:33, 24 July 2010 (UTC)&lt;br /&gt;
&lt;br /&gt;
== Brute force master key ==&lt;br /&gt;
&lt;br /&gt;
Is it not possible to brute force the key that apple uses and then use that to unlock all iPhones?&lt;br /&gt;
&lt;br /&gt;
if we get say 1 million computers then how long would it theoretically take to generate one key? 1 million isn't that impossible given that 3 million iPhone 3Gs have been sold of most geeks have more than one computer. Assuming that on average everyone contributes 2 computers then we only need 500000 people to reach 1 million. subtract the speed of networking and the fact that some people will turn their computers off every so often and we should be able to generate 5 or 6 keys a day? this is kinda pathetic for just a proof of concept but just proving that we can generate code and can harness this much power would be a massive psychological blow to apple. also i would assume that we would need some main server to control all the computers which probably doesn't exist :P&lt;br /&gt;
&lt;br /&gt;
blog.iphone-dev.org had 276,688 unique visitors on July 20th (PwnageTool release 2.0/2.0.1), so I would assume that number is the sort of participants we would get. I think 2 computers from each person is also optimistic, it would probably be less than 1 on average as most people won't run it 24/7.&lt;br /&gt;
&lt;br /&gt;
== Mirror ==&lt;br /&gt;
Does anyone have a mirror for the Multithreaded NCK Brute Forcer I think the link is down.--[[User:Bob|Bob]] 14:49, 22 August 2008 (UTC)&lt;br /&gt;
&lt;br /&gt;
Reply: done --[[User:Zuezuo|Zuezuo]] 10:32, 9 March 2010 (UTC)&lt;br /&gt;
&lt;br /&gt;
The link doesn't appear to be active anymore. I have an interest in this code, and maybe porting it to some faster machines. Does it still exist, or did someone erase it/stop hosting it? ---[[User:Unrstuart|Unrstuart]] 15:10, 24 July 2010 (PDT)&lt;br /&gt;
&lt;br /&gt;
I have updated the page with a valid link to a blog discussing geohot's Multithreaded NCK Brute Forcer. This page contains a link to the source code and a Windows binary. --[[User:Jmh9072|Jmh9072]] Feb 4, 2011, 23:52 (EST)&lt;br /&gt;
&lt;br /&gt;
== RSA attack ==&lt;br /&gt;
&lt;br /&gt;
Some researches recently published this paper:&lt;br /&gt;
&amp;quot;Fault-Based Attack of RSA Authentication&amp;quot; - http://www.eecs.umich.edu/~valeria/research/publications/DATE10RSA.pdf&lt;br /&gt;
&lt;br /&gt;
Could that be useful in this NCK attack?&lt;br /&gt;
--[[User:Zuezuo|Zuezuo]] 10:32, 9 March 2010 (UTC)&lt;/div&gt;</summary>
		<author><name>Jmh9072</name></author>
		
	</entry>
	<entry>
		<id>https://www.theiphonewiki.com/w/index.php?title=NCK_Brute_Force&amp;diff=15851</id>
		<title>NCK Brute Force</title>
		<link rel="alternate" type="text/html" href="https://www.theiphonewiki.com/w/index.php?title=NCK_Brute_Force&amp;diff=15851"/>
		<updated>2011-02-05T04:50:08Z</updated>

		<summary type="html">&lt;p&gt;Jmh9072: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is a theoretical exploit which involves brute forcing the NCK from the [[seczone]] the CHIPID and the NORID. So far no one has made public an instance of NCK discovery using this theoretical approach.&lt;br /&gt;
&lt;br /&gt;
==Credit==&lt;br /&gt;
[[gray]], [[User:Geohot|geohot]]&lt;br /&gt;
&lt;br /&gt;
==Feasibility==&lt;br /&gt;
Given that [[NCK]]s are 15 digits long, the keyspace is 10&amp;lt;sup&amp;gt;15&amp;lt;/sup&amp;gt; (about 2&amp;lt;sup&amp;gt;50&amp;lt;/sup&amp;gt;). This would be searchable if all the cryptography used was symmetric. But the algorithm is TEA(RSA(token), [[NCK]]+[[CHIPID]]+[[NORID]]) [[wikipedia:Tiny Encryption Algorithm|TEA]]. So that inside [[wikipedia:RSA|RSA]] has to be done. A modern machine can search the 8 digit keyspace in about 5 minutes, which means we need a couple orders of magnitude speed increase to consider 15 digit.&lt;br /&gt;
&lt;br /&gt;
==Implementation==&lt;br /&gt;
[http://george.insideiphone.com/index.php/2007/12/16/brute-force-on-nck-is-impossible/ Multithreaded NCK Brute Forcer] discussion and link to download.&lt;br /&gt;
&lt;br /&gt;
[[Category:Baseband]]&lt;br /&gt;
[[Category:Unlocking Methods]]&lt;/div&gt;</summary>
		<author><name>Jmh9072</name></author>
		
	</entry>
</feed>