Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
Crossref DOI link: https://doi.org/10.1007/s10623-016-0256-x
Published Online: 2016-07-26
Published Print: 2017-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zajac, Pavol
Funding for this research was provided by:
VEGA (1/0173/13)
EEA Scholarship Programme Slovakia (SK06-IV-01-001)
License valid from 2016-07-26