sage.crypto: More block tags, fixup

Author: Matthias Koeppe

src/sage/crypto/classical.py

@@ -1435,7 +1435,7 @@ def block_length(self):
         return self.key_space().nrows()
 
     def random_key(self):
-        """
+        r"""
         A random key within the key space of this Hill cipher. That is,
         generate a random `m \times m` matrix to be used as a block
         permutation, where `m` is the block length of this Hill cipher. If

src/sage/crypto/classical_cipher.py

@@ -470,27 +470,29 @@ def __init__(self, parent, key):
 
         EXAMPLES::
 
+            sage: # needs sage.groups
             sage: S = AlphabeticStrings()
-            sage: E = TranspositionCryptosystem(S,14); E                                # needs sage.groups
+            sage: E = TranspositionCryptosystem(S,14); E
             Transposition cryptosystem on
              Free alphabetic string monoid on A-Z of block length 14
             sage: K = [ 14-i for i in range(14) ]; K
             [14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1]
-            sage: e = E(K)                                                              # needs sage.groups
+            sage: e = E(K)
             sage: m = S("THECATINTHEHAT")
-            sage: e(m)                                                                  # needs sage.groups
+            sage: e(m)
             TAHEHTNITACEHT
 
         EXAMPLES::
 
+            sage: # needs sage.groups
             sage: S = AlphabeticStrings()
-            sage: E = TranspositionCryptosystem(S,15)                                   # needs sage.groups
+            sage: E = TranspositionCryptosystem(S,15)
             sage: m = S("THECATANDTHEHAT")
-            sage: G = E.key_space(); G                                                  # needs sage.groups
+            sage: G = E.key_space(); G
             Symmetric group of order 15! as a permutation group
-            sage: g = G([ 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, 15, 14, 13 ])          # needs sage.groups
-            sage: e = E(g)                                                              # needs sage.groups
-            sage: e(m)                                                                  # needs sage.groups
+            sage: g = G([ 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, 15, 14, 13 ])
+            sage: e = E(g)
+            sage: e(m)
             EHTTACDNAEHTTAH
 
         TESTS::

src/sage/crypto/lwe.py

@@ -297,8 +297,8 @@ def __init__(self, n, q, D, secret_dist='uniform', m=None):
         fix the representation and recover the correct standard deviation of the
         noise::
 
-            sage: from numpy import std                                                             # optional - numpy
-            sage: while abs(std([e if e <= 200 else e-401 for e in S()]) - 3.0) > 0.01:             # optional - numpy
+            sage: from numpy import std                                                             # needs numpy
+            sage: while abs(std([e if e <= 200 else e-401 for e in S()]) - 3.0) > 0.01:             # needs numpy
             ....:     L = []  # reset L to avoid quadratic behaviour
             ....:     add_samples()
 
@@ -591,12 +591,12 @@ def __call__(self):
             sage: # needs sage.libs.pari
             sage: from sage.crypto.lwe import DiscreteGaussianDistributionPolynomialSampler, RingLWE
             sage: N = 16
-            sage: n = euler_phi(N)                                                      # needs sage.libs.pari
-            sage: D = DiscreteGaussianDistributionPolynomialSampler(ZZ['x'], n, 5)      # needs sage.libs.pari
-            sage: ringlwe = RingLWE(N, 257, D, secret_dist='uniform')                   # needs sage.libs.pari
-            sage: ringlwe()[0].parent()                                                 # needs sage.libs.pari
+            sage: n = euler_phi(N)
+            sage: D = DiscreteGaussianDistributionPolynomialSampler(ZZ['x'], n, 5)
+            sage: ringlwe = RingLWE(N, 257, D, secret_dist='uniform')
+            sage: ringlwe()[0].parent()
             Vector space of dimension 8 over Ring of integers modulo 257
-            sage: ringlwe()[1].parent()                                                 # needs sage.libs.pari
+            sage: ringlwe()[1].parent()
             Vector space of dimension 8 over Ring of integers modulo 257
         """
         if self.m is not None:

src/sage/crypto/mq/rijndael_gf.py

@@ -271,7 +271,7 @@
 
     sage: # needs sage.libs.gap
     sage: rcpc = rgf.compose(rgf.shift_rows_poly_constr(),
-    ....:                    rgf.mix_columns_poly_constr()); rcpc                                                                          # needs sage.libs.gap
+    ....:                    rgf.mix_columns_poly_constr()); rcpc
     A polynomial constructor of a round component of Rijndael-GF block cipher
      with block length 4, key length 6, and 12 rounds.
     sage: rcpc(2, 1)