Package: libtomcrypt
Version: 1.17-6
Severity: serious
libtomcrypt fails to build because of LaTeX errors. (Note that a new
LaTeX entered unstable recently.)
It seems you cannot use "[here]" anymore to indicate float placement;
the correct usage is "[h]", as documented e.g. here:
https://en.wikibooks.org/wiki/LaTeX/Floats,_Figures_and_Captions
I sent an email to the LaTeX maintainers asking if this change was
intentional, but let's assume it is.
Below is a patch.
Martin
> sbuild (Debian sbuild) 0.64.1 (13 Oct 2013) on m400-c2n1.hlinux.usa.hp.com
...
> [39] [40]
> Chapter 4.
> [41] [42] [43] [44]
>
> ! LaTeX Error: Unknown float option `e'.
>
> See the LaTeX manual or LaTeX Companion for explanation.
> Type H <return> for immediate help.
> ...
>
> l.2064 \begin{figure}[here]
>
> ?
> ! Emergency stop.
> ...
>
> l.2064 \begin{figure}[here]
>
> Output written on crypt.dvi (50 pages, 150880 bytes).
> Transcript written on crypt.log.
--
Martin Michlmayr
Linux for HP Helion OpenStack, Hewlett-Packard
Description: LaTeX build fix
Author: Martin Michlmayr
--- libtomcrypt-1.17.orig/crypt.tex
+++ libtomcrypt-1.17/crypt.tex
@@ -2056,7 +2061,7 @@ int unregister_hash(const struct _hash_d
The following hashes are provided as of this release within the LibTomCrypt library:
\index{Hash descriptor table}
-\begin{figure}[here]
+\begin{figure}[h]
\begin{center}
\begin{tabular}{|c|c|c|}
\hline \textbf{Name} & \textbf{Descriptor Name} & \textbf{Size of Message Digest (bytes)} \\
@@ -2920,7 +2925,7 @@ descriptor twice, and will return the in
will return \textbf{CRYPT\_OK} if the PRNG was found and removed. Otherwise, it returns \textbf{CRYPT\_ERROR}.
\subsection{PRNGs Provided}
-\begin{figure}[here]
+\begin{figure}[h]
\begin{center}
\begin{small}
\begin{tabular}{|c|c|l|}
@@ -4085,7 +4090,7 @@ The variable \textit{prng} is an active
\textit{group\_size} the more difficult a forgery becomes upto a limit. The value of $group\_size$ is limited by
$15 < group\_size < 1024$ and $modulus\_size - group\_size < 512$. Suggested values for the pairs are as follows.
-\begin{figure}[here]
+\begin{figure}[h]
\begin{center}
\begin{tabular}{|c|c|c|}
\hline \textbf{Bits of Security} & \textbf{group\_size} & \textbf{modulus\_size} \\
@@ -4301,7 +4306,7 @@ LTC_SET_ASN1(sequence, x++, LTC_ASN1_NUL
\end{verbatim}
\end{small}
-\begin{figure}[here]
+\begin{figure}[h]
\begin{center}
\begin{small}
\begin{tabular}{|l|l|}
@@ -5042,7 +5047,7 @@ e^{1.923 \cdot ln(n)^{1 \over 3} \cdot l
Note that $n$ is not the bit-length but the magnitude. For example, for a 1024-bit key $n = 2^{1024}$. The work required
is:
-\begin{figure}[here]
+\begin{figure}[h]
\begin{center}
\begin{tabular}{|c|c|}
\hline RSA/DH Key Size (bits) & Work Factor ($log_2$) \\
@@ -5062,7 +5067,7 @@ is:
The work factor for ECC keys is much higher since the best attack is still fully exponential. Given a key of magnitude
$n$ it requires $\sqrt n$ work. The following table summarizes the work required:
-\begin{figure}[here]
+\begin{figure}[h]
\begin{center}
\begin{tabular}{|c|c|}
\hline ECC Key Size (bits) & Work Factor ($log_2$) \\
