Acta Applicandae Mathematica

, Volume 93, Issue 1, pp 279–297

On the Design of Cryptographic Primitives

Article

DOI: 10.1007/s10440-006-9044-3

Cite this article as:
Caballero-Gil, P. & Fúster-Sabater, A. Acta Appl Math (2006) 93: 279. doi:10.1007/s10440-006-9044-3
  • 36 Downloads

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.

Mathematics Subject Classifications (2000)

94A60 11T99 14G50 11T71 

Key words

cryptography secure communications finite fields discrete mathematics 

Copyright information

© Springer Science + Business Media B.V. 2006

Authors and Affiliations

  1. 1.Departamento de Estadistica, Investigacion Operativa y ComputacionUniversity of La LagunaLa LagunaSpain
  2. 2.Institute of Applied PhysicsMadridSpain