Abstract
Cryptographic primitives are the basis for protocols that offer cryptography services, such as confidentiality, integrity, authentication, and non-repudiation. They usually require one secret key, or two keys where one is public and another private, or no keys at all.
When designing a computer system for a certain task, in most cases, it is composed of a software stack on top of third-party hardware. However, in some applications, only the hardware is sufficient or it is bundled together with the software. In the case of cryptographic primitives, they can be designed as pure hardware or software solution, or a combination of the two.
In this thesis, I will show the implementation of five different cryptographic primitives. The first two primitives operate with two keys and are based on two different problems with elliptic curves. The last three primitives require one or no keys and can directly provide confidentiality, authentication, and integrity.
