Determining Cryptographic Distinguishers for eStream and SHA-3 Candidate Functions with Evolutionary Circuits
| Authors | |
|---|---|
| Year of publication | 2014 |
| Type | Article in Proceedings |
| Conference | E-Business and Telecommunications |
| MU Faculty or unit | |
| Citation | |
| Web | The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-44788-8_17 |
| Doi | http://dx.doi.org/10.1007/978-3-662-44788-8_17 |
| Field | Informatics |
| Keywords | eStream; Genetic programming; Random distinguisher; Randomness statistical testing; Software circuit |
| Description | Cryptanalysis of a cryptographic function usually requires advanced cryptanalytical skills and extensive amount of human labor with an option of using randomness testing suites like STS NIST or Dieharder. These can be applied to test statistical properties of cryptographic function outputs. We propose a more open approach based on software circuit that acts as a testing function automatically evolved by a stochastic optimization algorithm. Information leaked during cryptographic function evaluation is used to find a distinguisher of outputs produced by 25 candidate algorithms for eStream and SHA-3 competition from truly random sequences. We obtained similar results (with some exceptions) as those produced by STS NIST and Dieharder tests w.r.t. the number of rounds of the inspected algorithm. |
| Related projects: |