 Hi everyone, my name is Peters Meijers and together with the authors shown on this slide I've worked on a form of verification of Saber's Public Key Encryption Scheme in EasyGrip for which this is the video abstracting which I will introduce the paper by providing some context and motivation for the work. So we'll start providing context by giving a quick recap of Saber the subject of the form of verification. So Saber is a collection of post-quantum public key cryptographic constructions and was recently a finalist in a competition held by NIST for standardization of post-quantum cryptography. Now Saber comprises two main schemes of interest which are a Public Key Encryption Scheme and a Key Encryption Scheme. An important here is that Saber's Key Encryption Scheme is constructed by applying a variant of the Puyisaki Okamoto Transform on a Public Key Encryption Scheme and as a consequence the properties of Saber's Key Encryption Scheme are dependent on the properties of its Piki Key Scheme and this is important for the motivation of this work which I will come back to in a bit. The other part of the context concerns form of verification which is an activity that belongs to the field of computer-aided cryptography and this is a field that was partly established due to cryptographic constructions and their proof becoming increasingly complex over the years leading to difficult and error-prone construction and verification processes for these schemes and constructions which in turn leads to an increased likelihood of faulty designs, proofs and or implementations. Now the field of computer-aided cryptography attempts to alleviate these issues by leveraging computers in these construction and verification processes which then reduces the complexity of the manual verification and construction effort while ensuring and enforcing a consistently high level of rigor in these processes. Now this using computers in this way essentially replaces the trust we have improved by trust in the trust computing base which you introduce by using these tools in these processes. Now while we could have chosen many tools to use in the form of verification of this work we opted for EasyCrypt which is a tool that is specifically designed for the form of verification of code-based gameplay and proofs and also provides several features that allows for extensive mathematical reasoning as well as introducing modularity and proofs which can be very convenient in the form of verification effort. And then for the purpose and contribution of this work well firstly we formally verified Savors Public Key Encryption Scheme or more precisely we formally verified that Savors Public Key Encryption Scheme actually possesses its desired properties. This should then increase the confidence we have in the fact that Savors PKE Scheme possesses these properties and due to the fact what I said earlier about the properties of Savors Scheme encapsulation mechanism being dependent on the properties of Savors Public Key Encryption Scheme by implication this form of verification of Savors Public Key Encryption Scheme should also increase the confidence we have in the fact that Savors PKE Encapsulation Mechanism possesses these desired properties. Now this then all to assist in making a well informed decision about the adoption of Savors Scheme. And secondly in this form of verification process we performed in this work we attempted to do as many things as possible in a generic and reusable manner as to facilitate future form of verification efforts done in EasyCrypt. Now in particular we managed to do this for polynomial quotient rings. So we defined and specified those and their properties as well as some facts about distributions over integers and factors of polynomials. So this is it for the video abstract in the actual talk on Monday I will go into the actual process of the form of verification that we did and give some examples of how this is actually done in EasyCrypt. I hope to see you all at the talk.