digplanet beta 1: Athena
Share digplanet:

Agriculture

Applied sciences

Arts

Belief

Business

Chronology

Culture

Education

Environment

Geography

Health

History

Humanities

Language

Law

Life

Mathematics

Nature

People

Politics

Science

Society

Technology

Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer security systems. These routines include, but are not limited to, one-way hash functions and encryption functions.

Rationale[edit]

When creating cryptographic systems, designers use cryptographic primitives as their most basic building blocks. Because of this, cryptographic primitives are designed to do one very specific task in a highly reliable fashion.

Since cryptographic primitives are used as building blocks, they must be very reliable, i.e. perform according to their specification. For example, if an encryption routine claims to be only breakable with X number of computer operations, then if it can be broken with significantly less than X operations, that cryptographic primitive is said to fail. If a cryptographic primitive is found to fail, almost every protocol that uses it becomes vulnerable. Since creating cryptographic routines is very hard, and testing them to be reliable takes a long time, it is essentially never sensible (nor secure) to design a new cryptographic primitive to suit the needs of a new cryptographic system. The reasons include:

  • The designer might not be competent in the mathematical and practical considerations involved in cryptographic primitives.
  • Designing a new cryptographic primitive is very time-consuming and very error prone, even for experts in the field.
  • Since algorithms in this field are not only required to be designed well, but also need to be tested well by the cryptologist community, even if a cryptographic routine looks good from a design point of view it might still contain errors. Successfully withstanding such scrutiny gives some confidence (in fact, so far, the only confidence) that the algorithm is indeed secure enough to use; security proofs for cryptographic primitives are generally not available.

Cryptographic primitives are similar in some ways to programming languages. A computer programmer rarely invents a new programming language while writing a new program; instead, they will use one of the already established programming languages to program in.

Cryptographic primitives are one of the building block of every crypto system, e.g., TLS, SSL, SSH, etc. Crypto system designers, not being in a position to definitively prove their security, must take the primitives they use as secure. Choosing the best primitive available for use in a protocol usually provides the best available security. However, compositional weaknesses are possible in any crypto system and it is the responsibility of the designer(s) to avoid them.

Commonly used primitives[edit]

Combining cryptographic primitives[edit]

Cryptographic primitives, on their own, are quite limited. They cannot be considered, properly, to be a cryptographic system. For instance, a bare encryption algorithm will provide no authentication mechanism, nor any explicit message integrity checking. Only when combined in security protocols, can more than one security requirement be addressed. For example, to transmit a message that is not only encoded but also protected from tinkering (i.e. it is confidential and integrity-protected), an encoding routine, such as DES, and a hash-routine such as SHA-1 can be used in combination. If the attacker does not know the encryption key, he can not modify the message such that message digest value(s) would be valid.

Combining cryptographic primitives to make a security protocol is itself an entire specialization. Most exploitable errors (i.e., insecurities in crypto systems) are due not to design errors in the primitives (assuming always that they were chosen with care), but to the way they are used, i.e. bad protocol design and buggy or not careful enough implementation. Mathematical analysis of protocols is, at the time of this writing, not mature. There are some basic properties that can be verified with automated methods, such as BAN logic. There are even methods for full verification (e.g. the SPI calculus) but they are extremely cumbersome and cannot be automated. Protocol design is an art requiring deep knowledge and much practice; even then mistakes are common. An illustrative example, for a real system, can be seen on the OpenSSL vulnerability news page at [1].

See also[edit]

References[edit]

  • Levente Buttyán, István Vajda : Kriptográfia és alkalmazásai (Cryptography and its applications), Typotex 2004, ISBN 963-9548-13-8
  • Menezes, Alfred J : Handbook of applied cryptography, CRC Press, ISBN 0-8493-8523-7, October 1996, 816 pages.

External links[edit]


Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/Cryptographic_primitive — Please support Wikipedia.
This page uses Creative Commons Licensed content from Wikipedia. A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
42 videos foundNext > 

Crypto Primitives -- The Building Blocks of Modern Cryptography

Substitution, Transposition, Split and Concatenation, and Bitwise operation between two strings -- are the common primitives that combine into assembling the...

Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks 2013 IEEE JAVA

To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thatt...

btc.edu part 1: Cryptographic primitives and the proof of work blockchain

Tadge Dryja presents a developer centered course which will be a deep exploration of the evolution of the cryptographic primitives underlying the bitcoin pro...

Presentation over Cryptographic Primitives (RC4) ( Personal-Portfolio )

A presentation explaining the RC4 algorithm through animation. Coded with Flash AS3.0. The specification and required algorithms were already provided by the...

Combining Cryptographic Primitives To Prevent Jamming Attacks In Wireless Networks

ChennaiSunday Systems Pvt.Ltd We are ready to provide guidance to successfully complete your projects and also download the abstract, base paper from our web...

[FOSDEM 2013] Keccak, More Than Just SHA3SUM

Keccak, More Than Just SHA3SUM Gilles Van Assche Joan Daemen Michaël Peeters Recently, the American National Institute of Standards and Technology (NIST) ann...

Elliptic Curve Cryptography and Applications

At the SIAM Annual Meeting held in Minneapolis in July, Dr. Kristin Lauter of Microsoft Research discussed Elliptic Curve Cryptography as a mainstream primit...

Theory and Practice of Cryptography

Google Tech Talks November, 28 2007 Topics include: Introduction to Modern Cryptography, Using Cryptography in Practice and at Google, Proofs of Security and...

"Privacy and the Complexity of Simple Queries" (CRCS Lunch Seminar)

CRCS Lunch Seminar (Wednesday, January 29, 2014) Speaker: Jon Ullman, Postdoctoral Fellow, Center for Research on Computation and Society (CRCS), Harvard Uni...

Gopi Vid

NAME: Gopi REG.No:113111621028 Project Title: ENABLING SECURED AND EFFICIENT RANKED KEYWORD SEARCH OVER CLOUD DATA Objective: As ranked keyword search become...

42 videos foundNext > 

5 news items

 
Register
Mon, 04 Nov 2013 18:58:08 -0800

“Bit commitment” is a cryptographic primitive, in which Bob creates a bit, communicates it to Alice – but doesn't “open the envelope” until a specific time. In its simplest form, bit commitment looks exactly like a secret vote, but it's a thornier ...
 
Threatpost
Mon, 28 Oct 2013 13:01:47 -0700

“Let's be honest—when NIST literally recalls a published cryptographic primitive and 'strongly recommends against using' it, over evidence of deliberate efforts to weaken encryption standards by US intelligence operatives, we have entered a whole new era.
 
90.5 WESA
Wed, 17 Jul 2013 13:25:21 -0700

These protected interfaces, specifically one called “Tor,” work by using a cryptographic primitive mix network. This occurs when users travel in and out of multiple addresses at an extremely fast speed such that the original IP address is impossible to ...
 
ExtremeTech
Thu, 19 Jul 2012 07:23:03 -0700

The most important aspect of this work is that it (seemingly) establishes a new cryptographic primitive that completely removes the danger of rubber-hose cryptanalysis — i.e. obtaining passkeys via torture or coercion. It also gives you deniability ...
 
Slashdot
Mon, 17 Dec 2007 13:17:11 -0800

We argue that PRNGs are their own unique type of cryptographic primitive, and should be analyzed as such. We propose a model for PRNGs, discuss possible attacks against this model, and demonstrate the applicability of this model (and our attacks) to ...
Loading

Oops, we seem to be having trouble contacting Twitter

Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!

Searchlight Group

Digplanet also receives support from Searchlight Group. Visit Searchlight