GPUs offer a tremendous amount of computational bandwidth that was until now largely unusable for cryptographic computations due to a lack of integer arithmetic and user-friendly programming APIs that provided direct access to the GPU’s computing resources. The latest generation of GPUs, which introduces integer/binary arithmetic, has been leveraged to create several implementations of the AES ...

The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process of encryption highly depends on a quality of used random numbers. One dimensional, nonuniform CAs is considered as a generator of pseudorandom number sequences (PNSs). The quality of PNSs highly depends on a set of applied CA r...

In this paper we present the protection of long lived private key & public key using cryptographic schemes is one of the most important issues for information security. Any cryptographic scheme that reveals private key and public key will soon its security absolutely disintegrates. Public key are used in two different based, i.e. RSA and elliptic curve cryptography both are modular based arithm...

In this paper, we propose a new dynamic cryptographic key generation scheme for access control in a hierarchy with frequently inserted and deleted security classes. Our scheme, based on the Chinese remainder theorem and an available symmetric cryptosystem, can achieve the following four goals: First, a so-called trusted third party for generating keys is not needed in the system. Second, each s...

Performance of symmetric and asymmetric cryptography algorithms in small devices is presented. Both temporal and energy costs are measured and compared with the basic functional costs of a device. We demonstrate that cryptographic power costs are not a limiting factor of the autonomy of a device and explain how processing delays can be conveniently managed to minimize their impact. key words: p...

We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and patterns that captures the intention behind perfect cryptography. The proposed language extension is independent of the choice of process calculus and is applicable to any calculus that supports exchange of data. Initia...

Knowledge of mathematical foundations of Cryptography is of paramount importance for students wanting to succeed in graduate degree programs in Computer Science with concentration in security. Cryptography, a relatively new field, has yet to establish a core set of topics and the optimal sequence of their presentation to prepare students for a career in the field of IT security. This paper pres...

A symmetric key encryption scheme is described for blocks of general size N that is a product of powers of many prime numbers. This is accomplished by realising each number (representing a message unit) as a point in a product of affine spaces over various finite fields. Then algebro-geometric transformations on those spaces is transported back to provide encryption. For a specific block size <...

In this paper, we present an Energy Efficient Secure Routing Protocol for Sensor Networks (ESecRout). The protocol uses the symmetric cryptography to secure messages, and uses a small cache in sensor nodes to record the partial routing path (previous and next nodes) to the destination. It guarantees that the destination will be able to identify and discard the tampered messages and ensure that ...

This paper presents a quasigroup encryptor that has very good data-scrambling properties and, therefore, it has potential uses in symmetric cryptography. The purpose of the scrambler is to maximize the entropy at the output, even in cases where the input is constant. The great complexity associated with the task of finding the scrambling transformation ensures the effectiveness of the encryptio...