deletions | additions       diff --git a/bits2.tex b/bits2.tex  index df37b7d..434e4d7 100644  --- a/bits2.tex  +++ b/bits2.tex 
...
There is a property for polynomials that plays a special role in cryptography.  We introduce it formally in the following definition and then we discuss it.  %  \begin{Definition} \begin{Definition}\label{REDIRR}  A nonzero polynomial $f \in \Fb[x]$ of degree $\geq 1$ is called   \emph{reducible} if there exist $q, r \in \Fb[x]$ of \textbf{positive} degree such   that their product is $f$, i.e. $$f\,=\,q\,r\,.$$