A note on some algebraic trapdoors for block ciphers
May 23, 2017 ยท Declared Dead ยท ๐ Advances in Mathematics of Communications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Marco Calderini
arXiv ID
1705.08151
Category
math.GR
Cross-listed
cs.CR
Citations
18
Venue
Advances in Mathematics of Communications
Last Checked
1 month ago
Abstract
We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it generalizes that introduced by Paterson in 1999. Moreover, we discuss the fact that studying the group generated by the round functions of a block cipher may not be sufficient to guarantee security against these trapdoors for the cipher.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ math.GR
R.I.P.
๐ป
Ghosted
R.I.P.
๐ป
Ghosted
A Practical Cryptanalysis of the Algebraic Eraser
R.I.P.
๐ป
Ghosted
Regular subgroups with large intersection
R.I.P.
๐ป
Ghosted
On the primitivity of PRESENT and other lightweight ciphers
R.I.P.
๐ป
Ghosted
Solving the Conjugacy Decision Problem via Machine Learning
R.I.P.
๐ป
Ghosted
Matrix multiplication via matrix groups
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Language Models are Few-Shot Learners
R.I.P.
๐ป
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
๐ป
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
๐ป
Ghosted