Home

Welcome to the CriptoMersenne wiki! Here you can find data about this project, like the algorithms as written in the paper, the details in our implementation and how to run the code.

On your right you can find links to the wiki pages about the things we implemented in the project, and specific cases for both bit-to-bit and block encryption.

This are the most important sections:

• Key Generation
• Encryption
• Decryption
• How to use our implementation

Every section was created using this paper as guide, keeping the algorithms as they were, we added a section on Key Encapsulation and Decapsulation as further work in case ourselves or someone more want to continue the work on this project beyond the course.

Important considerations over λ

Currently the maximum security parameter is λ = 100. But 256 is the one of the most acceptable choices in the cryptographic community given the current computational powers, sadly java and kotlin's BigInteger and BigDecimal throw StackOverflow error due to inefficient stack management on division.

We set h to be the security parameter λ. Thus, λ = h. Also, in order to prevent against unforeseen attacks that exploit the factorization of p, we choose p = 2^n − 1 to be a Mersenne prime. Moreover, we want an error corrector code allowing us to encode k bits, with k close to 256 ideally.