Skip to content
0:00 / 0:00

#cryptol#haskell#verification

Cryptography and Verification with Cryptol

Compose Conference

2.9K subscribers • 30 videos on Hallway

YouTube
  • Recommended by 2 people: 1 on Lobsters and 1 in engineering communities.
  • Presented by Austin Seipp

Intermediate. Assumes working knowledge.

2K views10 years ago2 recommendations

SecurityProgramming languagesCryptographyFormal methods and verificationHaskell

Austin Seipp introduces Cryptol, a domain-specific language inspired by Haskell for building and verifying cryptographic software.

Austin Seipp C◦mp◦se :: Conference composeconference.org/ February 5, 2016 Cryptographic primitives exist all through-out the modern software stack, yet their construction and composition is often delicate and error prone. Furthermore, specifications are often far removed from real implementations, and written in high level prose or pseudo-code - while we tend to implement such software in low-level, bug-prone programming languages. Cryptol is a domain-specific language, inspired by Haskell, designed for the construction and verification of cryptographic software. Cryptol programs often serve as ‘executable specifications’ of some design, yielding easy to understand programs that serve as excellent references. Furthermore, through a novel use of SAT-based verification tools, Cryptol can allow you to verify real world software conforms to the specification in an easy, automated fashion. This talk focuses on the relevant aspects of writing and using the Cryptol toolkit, including verification on real world cryptographic functions written in C and Java, along with some notes on its implementation.

Why it's here

2 people recommend this

What people say. Recommended as an introduction to using Cryptol for cryptographic specification and verification.

Moments people linked to

u/mightybytein r/haskell • Recommends

Compose Conference: Cryptography and Verification with Cryptol

mightybyteon Lobsters • Recommends

Cryptography and Verification with Cryptol

u/gelisamin r/haskell • Mentions

On “Linguist Tom Scott on Absolute Direction and Evidentiality; see any PL parallels?”

A few other parallels: 1. * accessing the nth property of a data structure (relative to the number of fields) * accessing the property named "foo" (absolute, independent of the other fields) 2. * referencing a child node via a key (relative to the Map into which to perform the lookup) * referencing a child node via a pointer (absolute, independent of the Map) 3. * sending data in streaming library (relative to the order in which the stream transformers are composed) * sending data on the internet (absolute urls uniquely identifying the destination) I think the verb conjugation parts (time independence and evidentiality) are even more insightful: which properti…
3View on Reddit