2005
DOI: 10.1007/11541868_21
|View full text |Cite
|
Sign up to set email alerts
|

Formal Verification of a SHA-1 Circuit Core Using ACL2

Abstract: ISBN: 3-540-28372-2Our study was part of a project aiming at the design and verification of a circuit for secure communications between a computer and a terminal smart card reader. A SHA-1 component is included in the circuit. SHA-1 is a cryptographic primive that produces, for any message, a 160 bit message digest. We formalize the standard specification in ACL2, then automatically produce the ACL2 model for the VHDL RTL design; finally, we prove the implementation compliant with the specification. We apply a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…The cache checking unit (CCU) and parallel checking are optimizations to the Sentry worth the added complexity. The size and design complexity of the MAC engines in the CCU is comparable to other functional units already present on both the processor and the Sentry, and MAC engines have been formally verified [91]. The processor performs much of the Merkle tree and cache control logic for the Sentry,…”
Section: Simplicity Of the Sentrymentioning
confidence: 87%
“…The cache checking unit (CCU) and parallel checking are optimizations to the Sentry worth the added complexity. The size and design complexity of the MAC engines in the CCU is comparable to other functional units already present on both the processor and the Sentry, and MAC engines have been formally verified [91]. The processor performs much of the Merkle tree and cache control logic for the Sentry,…”
Section: Simplicity Of the Sentrymentioning
confidence: 87%
“…To our best knowledge, Toma and Borrione [35] were the first to use theorem provers to formally verify properties of SHA-1, but their focus is on functional properties, rather than security properties. The first machine-checked proof of security for a hash design appears in [7], where the authors use the CertiCrypt framework to verify that the construction from Brier et al [18] yields a hash function indifferentiable from a random oracle into ordinary elliptic curves.…”
Section: Discussionmentioning
confidence: 99%
“…By functional correctness, we mean that the composition of encryption and decryption yields the original plaintext. Functional correctness of cryptographic protocols has received considerable attention recently in formal verification [16,17]. We refer the reader to Schneier [18] for an overview of cryptosystems.…”
Section: Cbc-mode Encryption and Decryptionmentioning
confidence: 99%