<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.explainxkcd.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=70.24.167.3</id>
		<title>explain xkcd - User contributions [en]</title>
		<link rel="self" type="application/atom+xml" href="https://www.explainxkcd.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=70.24.167.3"/>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php/Special:Contributions/70.24.167.3"/>
		<updated>2026-04-17T03:20:20Z</updated>
		<subtitle>User contributions</subtitle>
		<generator>MediaWiki 1.30.0</generator>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=Talk:920:_YouTube_Parties&amp;diff=49829</id>
		<title>Talk:920: YouTube Parties</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=Talk:920:_YouTube_Parties&amp;diff=49829"/>
				<updated>2013-09-30T23:26:56Z</updated>
		
		<summary type="html">&lt;p&gt;70.24.167.3: Added a comment.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Oh god, is this what other people do to me when I'm showing a video at a youtube party? Gaaaah. '''[[User:Davidy22|&amp;lt;u&amp;gt;{{Color|purple|David}}&amp;lt;font color=green size=3px&amp;gt;y&amp;lt;/font&amp;gt;&amp;lt;/u&amp;gt;&amp;lt;font color=indigo size=4px&amp;gt;²²&amp;lt;/font&amp;gt;]]'''[[User talk:Davidy22|&amp;lt;tt&amp;gt;[talk]&amp;lt;/tt&amp;gt;]] 09:26, 9 March 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
Is a YouTube party a real thing?  I've never heard of one.  [[Special:Contributions/70.24.167.3|70.24.167.3]] 23:26, 30 September 2013 (UTC)&lt;/div&gt;</summary>
		<author><name>70.24.167.3</name></author>	</entry>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=Talk:573:_Parental_Trolling&amp;diff=49828</id>
		<title>Talk:573: Parental Trolling</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=Talk:573:_Parental_Trolling&amp;diff=49828"/>
				<updated>2013-09-30T23:24:18Z</updated>
		
		<summary type="html">&lt;p&gt;70.24.167.3: Added a comment.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Given the other places [[:Category:Comics featuring Cueball|Cueball]] is identified, Dad here is [[Cueball]], yes? [[User:Markhurd|Mark Hurd]] ([[User talk:Markhurd|talk]]) 10:02, 14 April 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
Having read Aldous Huxley's &amp;quot;Brave New World&amp;quot;, how hard would it be to achieve this conditioning?  [[Special:Contributions/70.24.167.3|70.24.167.3]] 23:24, 30 September 2013 (UTC)&lt;/div&gt;</summary>
		<author><name>70.24.167.3</name></author>	</entry>

	<entry>
		<id>https://www.explainxkcd.com/wiki/index.php?title=Talk:936:_Password_Strength&amp;diff=49773</id>
		<title>Talk:936: Password Strength</title>
		<link rel="alternate" type="text/html" href="https://www.explainxkcd.com/wiki/index.php?title=Talk:936:_Password_Strength&amp;diff=49773"/>
				<updated>2013-09-30T13:27:52Z</updated>
		
		<summary type="html">&lt;p&gt;70.24.167.3: Added a comment.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;You still have to vary the words with a bit of capitalization, punctuation and numbers a bit, or hackers can just run a dictionary attack against your string of four words. '''[[User:Davidy22|&amp;lt;u&amp;gt;{{Color|purple|David}}&amp;lt;font color=green size=3px&amp;gt;y&amp;lt;/font&amp;gt;&amp;lt;/u&amp;gt;&amp;lt;font color=indigo size=4px&amp;gt;²²&amp;lt;/font&amp;gt;]]'''[[User talk:Davidy22|&amp;lt;tt&amp;gt;[talk]&amp;lt;/tt&amp;gt;]] 09:12, 9 March 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
No you don't.  Hackers cannot run a dictionary attack against a string of four randomly picked words.&lt;br /&gt;
Look at the number of bits displayed in the image: 11 bits for each word.&lt;br /&gt;
That means he's assuming a dictionary of 2048 words, from which each word is picked randomly.&lt;br /&gt;
The assumption is that the cracker knows your password scheme.&lt;br /&gt;
[[Special:Contributions/86.81.151.19|86.81.151.19]] 20:17, 28 April 2013 (UTC)&lt;br /&gt;
Willem&lt;br /&gt;
&lt;br /&gt;
Sometimes this is not possible. (I'm looking at you, local banks with 8-12 character passwords and PayPal) If I can, I use a full sentence. A compound sentence for the important stuff. This adds the capitalization, punctuation and possibly the use of numbers while it's even easier to remember then Randall's scheme. I think it might help against the keyloggers too, if your browser/application autofills the username filed, because you password doesn't stand out from the feed with being gibberish. [[Special:Contributions/195.56.58.169|195.56.58.169]] 09:01, 30 August 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
The basic concept can be adapted to limited-length passwords easily enough: memorize a phrase and use the first letter of each word. It'll require about a dozen words (you're only getting 4.7 bits per letter at best, actually less because first letters of words are not truly random, though they are weakly if at all correlated with their neighbors -- based on the frequencies of first letters of words in English, and assuming no correlation between each first letter and the next, I calculate about 4 bits per character of Shannon entropy). SteveMB 18:35, 30 August 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
Followup: The results of extracting the first letters of words in sample texts (the {{w|Project_Gutenberg|Project Gutenberg}} texts of ''The Adventures of Huckleberry Finn'', ''The War of the Worlds'', and ''Little Fuzzy'') and applying a {{w|Entropy_(information_theory)|Shannon entropy calculation}} were 4.07 bits per letter (i.e. first letter in word) and 8.08 bits per digraph (i.e. first letters in two consecutive words). These results suggest that first-letter-of-phrase passwords have approximately 4 bits per letter of entropy. --[[User:SteveMB|SteveMB]] ([[User talk:SteveMB|talk]]) 14:21, 4 September 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
Addendum: The above test was case-insensitive (all letters converted to lowercase before feeding them to the [[http://millikeys.sourceforge.net/freqanalysis.html frequency counter]]). Thus, true-random use of uppercase and lowercase would have 5 bits per letter of entropy, and any variation in case (e.g. preserving the case of the original first letter) would fall between 4 and 5 bits per letter. --[[User:SteveMB|SteveMB]] ([[User talk:SteveMB|talk]]) 14:28, 4 September 2013 (UTC)&lt;br /&gt;
&lt;br /&gt;
I just have RANDOM.ORG print me ten pages of 8-character passwords and tape it to the wall, then highlight some of them and use others (say two down and to the right or similar) for my passwords, maybe a given line a line a little jumbled for more security.    [[Special:Contributions/70.24.167.3|70.24.167.3]] 13:27, 30 September 2013 (UTC)&lt;/div&gt;</summary>
		<author><name>70.24.167.3</name></author>	</entry>

	</feed>