Generic Parallel Cryptography for Hashing Schemes

We emphasize that future secure communicating systems, secured mass storages and access policies will require efficient and scalable security algorithms and protocols. More-over, parallelism will be used at quiet low level implementation of software or hardware basic mechanisms for offering efficien...

Full description

Saved in:
Bibliographic Details
Main Authors: Atighehchi, Kevin, Muntean, Traian
Format: Conference Proceeding
Language:English
Subjects:
Cryptography
Merkle hash trees
Message systems
networks security
Niobium
parallel cryptographic algorithms
Parallel processing
Program processors
Synchronization
Vegetation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We emphasize that future secure communicating systems, secured mass storages and access policies will require efficient and scalable security algorithms and protocols. More-over, parallelism will be used at quiet low level implementation of software or hardware basic mechanisms for offering efficient support to cryptographic algorithms. In this paper we concentrate on a family of generic schemes for efficient implementation of tree based hash functions. The main reason for designing a parallel algorithm based on a hash tree scheme is to obtain optimal performances when dealing with critical applications which can require tuned implementations for security aspects on multi-core target processors. Indeed, parallelism for cryptographic primitives has become a mandatory feature as imposed also by recent NIST requirements.
ISSN:2379-5352
DOI:10.1109/ISPDC.2013.34