sage.crypto: Update # needs, modularization fixes#36106
sage.crypto: Update # needs, modularization fixes#36106vbraun merged 15 commits intosagemath:developfrom
sage.crypto: Update # needs, modularization fixes#36106Conversation
src/sage/crypto/classical_cipher.py
Outdated
| sage: S = AlphabeticStrings() | ||
| sage: E = HillCryptosystem(S,3) | ||
| sage: E | ||
| sage: E = HillCryptosystem(S,3); E # needs sage.modules |
|
|
||
| - ``n`` -- Determinant size, primal: `det(L) = q^n`, dual: `det(L) = q^{m-n}`. | ||
| For ideal lattices this is also the degree of the quotient polynomial. | ||
| - ``m`` -- Lattice dimension, `L \subseteq Z^m`. |
There was a problem hiding this comment.
you inserted empty lines lines 39 and 50 to separate items but not here. Shouldn't it be the same for all items of the list ?
| True | ||
| """ | ||
| if isinstance(plaintext, (list, tuple, Vector_mod2_dense)): | ||
| if isinstance(plaintext, (list, tuple, Vector)): |
There was a problem hiding this comment.
are we sure that this change is safe for users ? I'm not sure it's currently tested...
There was a problem hiding this comment.
Yes, this just distinguishes scalar input from list/vector input. In fact, when neither of the two conditions holds, inputType remains uninitialized, leading to an error in the last line of the function
|
could you fix the following warnings: We have also several compilation warnings that should be fixed in the future |
|
done in 37a6b46 |
|
Thank you! |
|
Documentation preview for this PR (built with commit 37a6b46; changes) is ready! 🎉 |
📝 Checklist
⌛ Dependencies