Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An efficient SAT-based algorithm for finding short cycles in cryptographic algorithms
KTH, Skolan för elektroteknik och datavetenskap (EECS), Elektronik, Elektronik och inbyggda system.ORCID-id: 0000-0001-7382-9408
2018 (engelsk)Inngår i: Proceedings of the 2018 IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2018, Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 65-72Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

The absence of short cycles is a desirable property for cryptographic algorithms that are iterated. Furthermore, as demonstrated by the cryptanalysis of A5, short cycles can be exploited to reduce the complexity of an attack. We present an algorithm which uses a SAT-based bounded model checking for finding all short cycles of a given length. The existing Boolean Decision Diagram (BDD) based algorithms for finding cycles have limited capacity due to the excessive memory requirements of BDDs. The simulation-based algorithms can be applied to larger problem instances, however, they cannot guarantee the detection of all cycles of a given length. The same holds for general-purpose SAT-based model checkers. The presented algorithm can handle cryptographic algorithms with very large state spaces, including important ciphers such as Trivium and Grain-128. We found that these ciphers contain short cycles whose existence, to our best knowledge, was previously unknown. This potentially opens new possibilities for cryptanalysis.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2018. s. 65-72
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-238200DOI: 10.1109/HST.2018.8383892ISI: 000436024900009Scopus ID: 2-s2.0-85049955585ISBN: 9781538647318 (tryckt)OAI: oai:DiVA.org:kth-238200DiVA, id: diva2:1264844
Konferanse
2018 IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2018, The Ritz-CarltonWashington, United States, 30 April 2018 through 4 May 2018
Merknad

QC 20181121

Tilgjengelig fra: 2018-11-21 Laget: 2018-11-21 Sist oppdatert: 2018-11-21bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Dubrova, Elena
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 298 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf