Saw

Carter, Kyle; Foltzer, Adam; Hendrix, Joe; Huffman, Brian; Tomb, Aaron

doi:10.1145/2527269.2527277

Cited by 13 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• x 8 x 9 x 10 x 11 -state after second iteration The second method uses automatically generated equations (based on Cryptol implementation which is translated to the and-inverted-graphs (AIG [2])) and converts them into ANF. In this process we use SAW [9] and ABC [22] from UC Berkeley. The idea of using an equation taken from implementation was earlier explored by Courtois et al [14] to conduct an SAT attack on DES block cipher.…”

Section: Methodsmentioning

confidence: 99%

International Journal of Electronics and Telecommunications

Dudzic

Kanciak

2020

View full text Add to dashboard Cite

A desirable property of iterated cryptographic algorithms, such as stream ciphers or pseudo-random generators, is the lack of short cycles. Many of the previously mentioned algorithms are based on the use of linear feedback shift registers (LFSR) and nonlinear feedback shift registers (NLFSR) and their combination. It is currently known how to construct LFSR to generate a bit sequence with a maximum period, but there is no such knowledge in the case of NLFSR. The latter would be useful in cryptography application (to have a few taps and relatively low algebraic degree). In this article, we propose a simple method based on the generation of algebraic equations to describe iterated cryptographic algorithms and find their solutions using an SAT solver to exclude short cycles in algorithms such as stream ciphers or nonlinear feedback shift register (NLFSR). Thanks to the use of AIG graphs, it is also possible to fully automate our algorithm, and the results of its operation are comparable to the results obtained by manual generation of equations. We present also the results of experiments in which we successfully found short cycles in the NLFSRs used in Grain-80, Grain-128 and Grain-128a stream ciphers and also in stream ciphers Bivium and Trivium (without constants used in the initialization step).

show abstract

Section: Methodsmentioning

confidence: 99%

International Journal of Electronics and Telecommunications

Dudzic

Kanciak

2020

View full text Add to dashboard Cite

show abstract

“…Its successor, DO 178C, has an entire supplement, DO 333, devoted to the use of formal methods for software verification. Most proposed cryptographic protocols are now examined with model checkers for possible exploits, and analysts can perform mostly-automated proofs that implementations of cryptographic algorithms match specifications [Carter13]. Practitioners also use model checkers to look for attack paths in networks.…”

Section: Formal Methodsmentioning

confidence: 99%

Dramatically reducing software vulnerabilities: Report to the White House Office of Science and Technology Policy

Black¹,

Badger²,

Guttman³

et al. 2016

View full text Add to dashboard Cite

The call for a dramatic reduction in software vulnerability is heard from multiple sources, recently from the February 2016 Federal Cybersecurity Research and Development Strategic Plan. This plan starts by describing well known risks: current systems perform increasingly vital tasks and are widely known to possess vulnerabilities. These vulnerabilities are often not easy to discover and difficult to correct. Cybersecurity has not kept pace, and the pace that is needed is rapidly accelerating. The goal of this report is to present a list of specific technical approaches that have the potential to make a dramatic difference in reducing vulnerabilities-by stopping them before they occur, by finding them before they are exploited or by reducing their impact.

show abstract