From ba04d6f3794a974e41a2cbe44ebd44d1ba7659e3 Mon Sep 17 00:00:00 2001
From: Jan Vales <jan@jvales.net>
Date: Sat, 3 May 2014 22:31:30 +0200
Subject: [PATCH] some textbf
---
report1/content.tex | 16 ++++++++--------
1 file changed, 8 insertions(+), 8 deletions(-)
diff --git a/report1/content.tex b/report1/content.tex
index c4a7624..bd53268 100644
--- a/report1/content.tex
+++ b/report1/content.tex
@@ -53,23 +53,23 @@ f14a5968e96f12102a9e6c44d7736c4ebc703881db0fe18797446db0db4f9a3e}
On my machine/setup I can probe for 18 passwords per second.\\
\subsection{How much time is needed for brute forcing different password lengths and character sets?}
-\subsubsection{using a 4-digit-password}
+\subsubsection{using a 4-character-password}
Numeric passwords have only 10 possible states with one digit.\\
-With a 4 digit password it would take at max (10**4) 10000 operations or 555 seconds (or 9.2 minutes) to bruteforce such a password.\\
+With a 4 digit password it would take at max (10**4) 10000 operations or 555 seconds (\textbf{or 9.2 minutes}) to bruteforce such a password.\\
If we add lowercase characters, we get 36 possible states with one digit.\\
-With a 4 digit password it would take at max (36**4) 1679616 operations or 93312 seconds (or 25.92 hours) to bruteforce such a password.\\
+With a 4 character password it would take at max (36**4) 1679616 operations or 93312 seconds (\textbf{or 25.92 hours}) to bruteforce such a password.\\
If we add uppercase letters, we get 62 possible states with one digit.\\
-With a 4 digit password it would take at max (62**4) 14776336 operations or 820907 seconds (or 228.02 hours) to bruteforce such a password.\\
+With a 4 character password it would take at max (62**4) 14776336 operations or 820907 seconds (\textbf{or 228.02 hours}) to bruteforce such a password.\\
We can add non-alphanumeric characters to get even more possible states with one digit.\\
-\subsubsection{using a 6-digit-password}
+\subsubsection{using a 6-character-password}
Numeric passwords have only 10 possible states with one digit.\\
-With a 6 digit password it would take at max (10**6) 1000000 operations or 55555 seconds (or 15.43 hours) to bruteforce such a password.\\
+With a 6 digit password it would take at max (10**6) 1000000 operations or 55555 seconds (\textbf{or 15.43 hours}) to bruteforce such a password.\\
If we add lowercase characters, we get 36 possible states with one digit.\\
-With a 6 digit password it would take at max (36**6) 2176782336 operations or 120932352 seconds (or 3.83 years) to bruteforce such a password.\\
+With a 6 character password it would take at max (36**6) 2176782336 operations or 120932352 seconds (\textbf{or 3.83 years}) to bruteforce such a password.\\
If we add uppercase letters, we get 62 possible states with one digit.\\
-With a 6 digit password it would take at max (62**6) 56800235584 operations or 3155568643 seconds (or 99.99 years) to bruteforce such a password.\\
+With a 6 character password it would take at max (62**6) 56800235584 operations or 3155568643 seconds (\textbf{or 99.99 years}) to bruteforce such a password.\\
We can add non-alphanumeric characters to get even more possible states with one digit.\\
--
2.43.0