SHA1, RSA, PSS and more

Christina Lindenberg and Kai Wirt

May 2, 2005

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

Formal verification is getting more and more important in computer science. However the state of the art formal verification methods in cryptography are very rudimentary. These theories are one step to provide a tool box allowing the use of formal methods in every aspect of cryptography. Moreover we present a proof of concept for the feasibility of verification techniques to a standard signature algorithm.

License

BSD License

Topics

Session RSAPSS

Cite

× 
@article{RSAPSS-AFP,
  author  = {Christina Lindenberg and Kai Wirt},
  title   = {SHA1, RSA, PSS and more},
  journal = {Archive of Formal Proofs},
  month   = {May},
  year    = {2005},
  note    = {\url{https://isa-afp.org/entries/RSAPSS.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: