A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-random sequences of the same length. The robustness and effectiveness of these algorithms are respectively based on the extremely large key space and the appropriate choice of the Latin square under consideration....
Saved in:
| Published in: | Advances in computational mathematics Vol. 45; no. 4; pp. 1769 - 1792 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.08.2019
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1019-7168, 1572-9044 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!