The number of Resource-Limited Wireless Devices utilized in many areas of IT is growing rapidly. Some of the applications of these devices pose real security threats that can be addressed using authentication and cryptography. Many of the available authentication and encryption software solutions are predicated on the availability of ample processing power and memory. These demands cannot be me...

In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative ...

In this paper we present a new representation of the AES key schedule, with some implications to security AES-based schemes. particular, show that AES-128 schedule can be split into four independent parallel computations operating on 32 bits chunks, up linear transformation. Surprisingly, property has not been described in literature after more than 20 years analysis AES. We two consequences ou...

This document is intended as a response to the call for comments by NIST related to the establishment of design and evaluation criteria for the upcoming hash competition. We start by presenting a list of specific recommendations for NIST’s consideration and then follow with an article that expands on these recommendations and their rationale. We intend the list of recommendations also as an “ex...

Lightweight cryptography is equipped as security component, to secure those pervasive devices that are security and privacy sensitive. It has been conclusively proven that unprotected cryptographic implementations are vulnerable to side-channel attacks. In practice, area resource smaller than 3,000GE (5,000GE sometimes) may be available for security components in pervasive devices. This paper p...

Recent years have seen considerable interest in lightweight cryptography. One particular consequence is a renewed study of meet-inthe-middle attacks, which aim to exploit the relatively simple key schedules often encountered in lightweight ciphers. In this paper we propose a new technique to extend the number of rounds covered by a meet-inthe-middle attack, called a match box. Furthermore, we d...

This research presents a study on the identification of post-quantum cryptography algorithms through machine learning techniques. Plain text files were encoded by four algorithms, participating in NIST's standardization contest, ECB mode. The resulting cryptograms submitted to NIST Statistical Test Suite enable creation metadata files. These provide information for six data mining identify cryp...

The design and implementation of security threat mitigation mechanisms in RFID systems, specially in low-cost RFID tags, are gaining great attention in both industry and academia. One main focus of research interests is the authentication and privacy techniques to prevent attacks targeting the insecure wireless channel of these systems. Cryptography is a key tool to address these threats. Never...

We introduce the notion of security-mediated certificateless (SMC) cryptography. This allows more lightweight versions of mediated cryptography while maintaining the ability for instantaneous revocation of keys. Moreover, our solutions avoid key escrow, which has been used in all previous mediated cryptography algorithms. We provide a model of security against a fully-adaptive chosen ciphertext...