So I'm trying to make up a little presentation about password security (for no particular reason), and I've got two questions:
First, when I am calculating the total number of possible passwords given some parameters (e.g. -- 4 characters, alphabetic-only), would the formula be: password length to the number of possible characters' power (4^26 = 4503599627370496), or vice versa -- number of possible characters to the length power (26^4 = 456976). I'm thinking it would be the latter, but not sure. I wish I had paid closer attention in my probability and stats courses over the years.
Also, are there any figures available for how many possibilities are tried per second for a program like 'John the Ripper,' on a decent machine (e.g. -- 1.2GHz, 448MB SDRAM; I am assuming the program performance is machine-dependent). I just pulled a guess of 250 attempts per second out of nowhere, b/c I couldn't find any figures. I have no idea how realistic that is.
Thanks for your input.
			
			First, when I am calculating the total number of possible passwords given some parameters (e.g. -- 4 characters, alphabetic-only), would the formula be: password length to the number of possible characters' power (4^26 = 4503599627370496), or vice versa -- number of possible characters to the length power (26^4 = 456976). I'm thinking it would be the latter, but not sure. I wish I had paid closer attention in my probability and stats courses over the years.
Also, are there any figures available for how many possibilities are tried per second for a program like 'John the Ripper,' on a decent machine (e.g. -- 1.2GHz, 448MB SDRAM; I am assuming the program performance is machine-dependent). I just pulled a guess of 250 attempts per second out of nowhere, b/c I couldn't find any figures. I have no idea how realistic that is.
Thanks for your input.
 
				
		 
			 
 
		 
 
		 
 
		 
 
		 
 
		 
 
		
 Facebook
Facebook Twitter
Twitter