\relax 
\citation{GG03:Modern}
\citation{B85:Fast}
\citation{AHU74:Design}
\citation{CSB96:Algebraic}
\citation{P76:Implementation}
\@writefile{toc}{\contentsline {section}{\numberline {I}Introduction}{2}}
\@writefile{toc}{\contentsline {section}{\numberline {II}Mathematical background}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {II-A}Finite Fields}{2}}
\newlabel{sec:finite}{{II-A}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {II-B}Discrete Fourier Transform (DFT)}{2}}
\newlabel{ch3:sec:dft}{{II-B}{2}}
\newlabel{ch3_2:def2}{{1}{2}}
\newlabel{ch3_2:def1}{{3}{2}}
\citation{P76:Implementation}
\citation{B85:Fast}
\newlabel{ch3_2:eqn1}{{1}{3}}
\newlabel{ch1:cor1}{{1}{3}}
\@writefile{lot}{\contentsline {table}{\numberline {I}{\ignorespaces Parameters of NNT for $2^{3}-1 \leq q \leq 2^{16}+1$ }}{4}}
\newlabel{ch2_2:tab1}{{I}{4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {II-C}Multi-dimensional DFTs}{4}}
\newlabel{sec:multi}{{II-C}{4}}
\newlabel{arith:eqn3}{{3}{4}}
\citation{L76:Simplified}
\citation{WJM96:Efficient}
\citation{Z99:Efficient}
\citation{Z99:Efficient}
\@writefile{toc}{\contentsline {section}{\numberline {III}S-hash Arithmetic}{5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {III-A}The field $GF(17)$}{5}}
\newlabel{ch5_2:eqn1}{{5}{5}}
\citation{B85:Fast}
\citation{N82:Fast}
\citation{A01:Public}
\@writefile{lot}{\contentsline {table}{\numberline {II}{\ignorespaces The cost of CPA (Sklansky parallel-prefix adder).}}{6}}
\newlabel{ch5_1:table1}{{II}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {III-B}The Fast Fourier Transform}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {III-C}The field $GF(2^4)$}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {III-C.1}Addition}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {III-C.2}Multiplication}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {III-C.3}Inversion}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {III-C.4}Affine transformation}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {III-D}SRC (shift row \& column)}{7}}
\@writefile{toc}{\contentsline {subsection}{\numberline {III-E}Component-wise operations}{7}}
\@writefile{toc}{\contentsline {section}{\numberline {IV}Specral Hashing Algorithm}{8}}
\newlabel{ch:s_hash}{{IV}{8}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Classical Merkle-Damgard hash scheme}}{8}}
\newlabel{des:fig0}{{1}{8}}
\newlabel{des:alg1}{{1}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {IV-A}Initialization}{8}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces State Prism}}{9}}
\newlabel{des:fig1}{{2}{9}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Permutation Prims}}{9}}
\newlabel{des:fig2}{{3}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {IV-B}Compression function}{9}}
\newlabel{sec2:eqn1}{{6}{9}}
\citation{N94:Differentially}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Swap control planes (sc-planes) on the s-prism}}{10}}
\newlabel{des:fig5}{{4}{10}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Three dimensional DFT can be realized by row-column method: applying 1-dimensional DFTs to the state prism through $k, j$ and $i$ axis successively}}{11}}
\newlabel{des:fig3}{{5}{11}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Swap control planes (sc-planes) on the s-prism. (*) 1st sc-plane is computed by XORing these two)}}{12}}
\newlabel{des:fig4}{{6}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces 1st and 2nd swappings on the vectors of p-plane}}{12}}
\newlabel{des:fig5a}{{7}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces 3rd and 4th swappings on the vectors of p-plane}}{13}}
\newlabel{des:fig5b}{{8}{13}}
\newlabel{sec2:eqn2}{{7}{13}}
\newlabel{sec2:eqn2}{{IV-B}{13}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Rubics rotations on p-prism}}{14}}
\newlabel{des:fig6}{{9}{14}}
\newlabel{ch3_7:alg2}{{2}{14}}
\newlabel{ch3_7:alg2}{{3}{14}}
\@writefile{toc}{\contentsline {subsection}{\numberline {IV-C}Hash generation}{15}}
\@writefile{lot}{\contentsline {table}{\numberline {III}{\ignorespaces 128-bit hash generation. }}{15}}
\newlabel{des:tab1}{{III}{15}}
\@writefile{lot}{\contentsline {table}{\numberline {IV}{\ignorespaces 224-bit hash generation. }}{15}}
\newlabel{des:tab2}{{IV}{15}}
\@writefile{lot}{\contentsline {table}{\numberline {V}{\ignorespaces 256-bit hash generation. }}{15}}
\newlabel{des:tab3}{{V}{15}}
\bibstyle{IEEEbib}
\bibdata{my}
\bibcite{B85:Fast}{1}
\bibcite{AHU74:Design}{2}
\bibcite{P76:Implementation}{3}
\@writefile{lot}{\contentsline {table}{\numberline {VI}{\ignorespaces 384-bit hash generation. }}{16}}
\newlabel{des:tab4}{{VI}{16}}
\@writefile{lot}{\contentsline {table}{\numberline {VII}{\ignorespaces 512-bit hash generation. }}{16}}
\newlabel{des:tab5}{{VII}{16}}
\@writefile{toc}{\contentsline {section}{\numberline {V}Security Considerations}{16}}
\@writefile{toc}{\contentsline {section}{\numberline {VI}Conclusions}{16}}
\bibcite{L76:Simplified}{4}
\bibcite{WJM96:Efficient}{5}
\bibcite{Z99:Efficient}{6}
\bibcite{N82:Fast}{7}
\bibcite{N94:Differentially}{8}
\@writefile{toc}{\contentsline {section}{References}{17}}