浏览代码

Naming.

Standardizing names at chapter/parts layer. Still to define schemas on subsections.
Queuing neboltai's image from bettercrypto, will decide later whether to add it or not.
Michele Orrù 11 年之前
父节点
当前提交
d281908de0
共有 6 个文件被更改,包括 20 次插入7 次删除
  1. 1 1
      book/dixon.tex
  2. 1 1
      book/fermat.tex
  3. 3 2
      book/math_prequisites.tex
  4. 二进制
      book/neboltai.png
  5. 14 2
      book/question_authority.tex
  6. 1 1
      book/wiener.tex

+ 1 - 1
book/dixon.tex

@@ -1,4 +1,4 @@
-\chapter{Dixon {\texttt{\small{[insert random buzzword here]}}} method\label{chap:dixon}}
+\chapter{Dixon's factorization method\label{chap:dixon}}
 
 
 ~\cite{dixon} describes a class of ``probabilistic algorithms'' for finding a
 ~\cite{dixon} describes a class of ``probabilistic algorithms'' for finding a
 factor of any composite number, at a sub-exponential cost. They basically
 factor of any composite number, at a sub-exponential cost. They basically

+ 1 - 1
book/fermat.tex

@@ -1,4 +1,4 @@
-\chapter{Fermat's Factorization Algorithm \label{chap:fermat}}
+\chapter{Fermat's factorization method \label{chap:fermat}}
 
 
 Excluding the trial division, Fermat's method is the oldest known systematic
 Excluding the trial division, Fermat's method is the oldest known systematic
 method for factorizing integers. Even if its algorithmic complexity is not
 method for factorizing integers. Even if its algorithmic complexity is not

+ 3 - 2
book/math_prequisites.tex

@@ -1,4 +1,5 @@
-\chapter{Mathematical prequisites \label{chap:preq}}
+%% in homage to sir Isacc Newton
+\chapter{Mathematical Principles\label{chap:preq}}
 
 
 In this chapter we formalize the notation used in the rest of the thesis, and
 In this chapter we formalize the notation used in the rest of the thesis, and
 furthermore attempt to discuss and study the elementary functions on which the
 furthermore attempt to discuss and study the elementary functions on which the
@@ -279,7 +280,7 @@ complexity, we believe that adopting the one of Dijkstra has lead to a
 pragmatic, substantial performance improvement.
 pragmatic, substantial performance improvement.
 
 
 
 
-\section{RSA Cipher \label{sec:preq:rsa}}
+\section{The RSA Cipher \label{sec:preq:rsa}}
 
 
 The RSA cryptosystem, invented by Ron Rivest, Adi Shamir, and Len Adleman
 The RSA cryptosystem, invented by Ron Rivest, Adi Shamir, and Len Adleman
 ~\cite{rsa}, was first published in August 1977's issue of
 ~\cite{rsa}, was first published in August 1977's issue of

二进制
book/neboltai.png


+ 14 - 2
book/question_authority.tex

@@ -148,14 +148,26 @@
   \includegraphics[width=80pt]{kopimi.png}
   \includegraphics[width=80pt]{kopimi.png}
 \end{figure}
 \end{figure}
 
 
+\cleardoublepage
+
+\markboth{}{}
+% move this epigraph to a fitting place. I don't see why it fits here inside of
+% the begin figure env. ~~ AK
+%\epigraph{``[...] be conservative in what you do, be liberal in what
+%you accept from others.''}{The robustness priciple or ``Postel's
+%Law''~\cite{rfc761}}
+%{\centering
+%  \includegraphics[width=.9\textwidth]{neboltai.png}\par
+%  \vbox{\emph{Do not talk unencrypted}}
+%}
 
 
 \include{preface}
 \include{preface}
 
 
-\part{Prequisites}
+\part{Prolegomena}
 \include{ssl_prequisites}
 \include{ssl_prequisites}
 \include{math_prequisites}
 \include{math_prequisites}
 
 
-\part{Factorization Methods}
+\part{Questions}
 \include{fermat}
 \include{fermat}
 \include{wiener}
 \include{wiener}
 \include{pollard-1}
 \include{pollard-1}

+ 1 - 1
book/wiener.tex

@@ -1,4 +1,4 @@
-\chapter{Wiener's Attack \label{chap:wiener}}
+\chapter{Wiener's cryptanalysis method \label{chap:wiener}}
 
 
 Wiener's attack was first published in 1989 as a result of cryptanalysis on the
 Wiener's attack was first published in 1989 as a result of cryptanalysis on the
 use of short RSA secret keys ~\cite{wiener}. It exploited the fact that it is
 use of short RSA secret keys ~\cite{wiener}. It exploited the fact that it is