On the design of cryptographic primitives

DOI10.1007/S10440-006-9044-3MaRDI QIDQ850775zbMATH OpenOpenAlexWikidataFDO

Authors Pino Caballero-Gil, Amparo Fúster-Sabater

Publication date 6 November 2006

Published in Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1005.0055

zbMATH Keywords

cryptographydiscrete mathematicsfinite fieldssecure communications

Mathematics Subject Classification ID

Applications of graph theory (05C90) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

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.

Recommendations

• Practical design of two-party cryptographic protocols
• scientific article; zbMATH DE number 1952885
• Publication:4502735
• Cryptography and cryptographic protocols
• Design of crypto primitives based on quasigroups

Cites work

• A logic of authentication
• scientific article; zbMATH DE number 3956969 (Why is no real title available?)
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 1796970 (Why is no real title available?)
• New directions in cryptography
• On the security of public key protocols
• The Byzantine Generals Problem
• The knowledge complexity of interactive proof-systems
• Zero-knowledge proofs of identity

Cited in

(7)

• On the bit security of cryptographic primitives
• Designs, codes and cryptography. Proceedings of the 1st ACM conference on computer and communications security in honour of Gus Simmons, Fairfax, VA, USA, November 1993
• Designing efficient dyadic operations for cryptographic applications
• Practical design of two-party cryptographic protocols
• scientific article; zbMATH DE number 1952885 (Why is no real title available?)
• Primitivity of PRESENT and other lightweight ciphers
• The design of the ICE encryption algorithm

This page was built for publication: On the design of cryptographic primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850775)