On the Design of Cryptographic Primitives

TL;DR

This paper surveys two-party cryptographic protocols, reviews key primitives, and introduces new schemes and guidelines to enhance the robustness and design of cryptographic protocols.

Contribution

It provides a comprehensive overview of cryptographic primitives and proposes novel algorithms based on Graph Theory for improved protocol design.

Findings

Reviewed key algorithms based on Finite Fields

Proposed new schemes using Graph Theory

Offered guidelines for robust protocol design

Abstract

The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols. On the other hand, it proposes new schemes and guidelines for improving the practice of robust protocol design. In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic primitives is carried out. Within this survey, some of the most representative algorithms based on the Theory of Finite Fields are provided and new general schemes and specific algorithms based on Graph Theory are proposed.