Skip to content

Commit 9fb08af

Browse files
committed
fix location of some of the tables
this fixes the last open issue of #54
1 parent 2d3a921 commit 9fb08af

1 file changed

Lines changed: 6 additions & 5 deletions

File tree

doc/crypt.tex

Lines changed: 6 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@
88
\usepackage{graphicx}
99
\usepackage{layout}
1010
\usepackage{fancyhdr}
11+
\usepackage{float}
1112
\def\union{\cup}
1213
\def\intersect{\cap}
1314
\def\getsrandom{\stackrel{\rm R}{\gets}}
@@ -2523,7 +2524,7 @@ \subsection{Hash Registration}
25232524
The following hashes are provided as of this release within the LibTomCrypt library:
25242525
\index{Hash descriptor table}
25252526

2526-
\begin{figure}[h]
2527+
\begin{figure}[H]
25272528
\begin{center}
25282529
\begin{tabular}{|c|c|c|}
25292530
\hline \textbf{Name} & \textbf{Descriptor Name} & \textbf{Size of Message Digest (bytes)} \\
@@ -3627,7 +3628,7 @@ \subsection{Example}
36273628
will return \textbf{CRYPT\_OK} if the PRNG was found and removed. Otherwise, it returns \textbf{CRYPT\_ERROR}.
36283629

36293630
\subsection{PRNGs Provided}
3630-
\begin{figure}[h]
3631+
\begin{figure}[H]
36313632
\begin{center}
36323633
\begin{small}
36333634
\begin{tabular}{|c|c|l|}
@@ -5166,7 +5167,7 @@ \chapter{Digital Signature Algorithm}
51665167
\textit{group\_size} the more difficult a forgery becomes upto a limit. The value of $group\_size$ is limited by
51675168
$15 < group\_size < 1024$ and $modulus\_size - group\_size < 512$. Suggested values for the pairs are as follows.
51685169

5169-
\begin{figure}[h]
5170+
\begin{figure}[H]
51705171
\begin{center}
51715172
\begin{tabular}{|c|c|c|}
51725173
\hline \textbf{Bits of Security} & \textbf{group\_size} & \textbf{modulus\_size} \\
@@ -6666,7 +6667,7 @@ \subsection{Asymmetric Ciphers}
66666667

66676668
Note that $n$ is not the bit-length but the magnitude. For example, for a 1024-bit key $n = 2^{1024}$. The work required
66686669
is:
6669-
\begin{figure}[h]
6670+
\begin{figure}[H]
66706671
\begin{center}
66716672
\begin{tabular}{|c|c|}
66726673
\hline RSA/DH Key Size (bits) & Work Factor ($log_2$) \\
@@ -6686,7 +6687,7 @@ \subsection{Asymmetric Ciphers}
66866687

66876688
The work factor for ECC keys is much higher since the best attack is still fully exponential. Given a key of magnitude
66886689
$n$ it requires $\sqrt n$ work. The following table summarizes the work required:
6689-
\begin{figure}[h]
6690+
\begin{figure}[H]
66906691
\begin{center}
66916692
\begin{tabular}{|c|c|}
66926693
\hline ECC Key Size (bits) & Work Factor ($log_2$) \\

0 commit comments

Comments
 (0)