In this article, we provide the first third-party security analysis of the PRINCE lightweight block cipher, and the underlying PRINCEcore. First, while no claim was made by the authors regarding related-key attacks, we show that one can attack the full cipher with only a single pair of related keys, and then reuse the same idea to derive an attack in the single-key model for the full PRINCEcore...

I lied to the future last night. I told it that soon it would be big and strong and profitable. I then tucked it into its crib, turned off the lights, and hoped the day would never come when the future would curse this lie. I not only assured the future it would someday be strong and profitable, I also told it how it would strong and profitable. My lie was a little more prosaic than my words su...

Recently, a RGB image encryption algorithm based on DNA encoding and chaos map has been proposed. It was reported that the encryption algorithm can be broken with four pairs of chosen plain-images and the corresponding cipher-images. This paper re-evaluates the security of the encryption algorithm, and finds that the encryption algorithm can be broken efficiently with only one known plain-image...

We analyse several well-known key establishment protocols for mobile communications. The protocols are examined with respect to their security and suitability in mobile environments. In a number of cases weaknesses are pointed out, and in many cases reenements are suggested, either to improve the eeciency or to allow simpliied security analysis.

One of the approaches to deliver real-time video encryption is to apply permutations to the bytes within a frame of a fully encoded MPEG stream as presented in [2]. We demonstrate that this particular algorithm is vulnerable to a known-plaintext attack, and hence its use should be carefully considered. We also discuss modifications that can make the algorithm resistant to our attack.

In the classical approach to digital topology (see e.g. [12] and [13]), graph theoretic tools are used for structuring Z, namely the well-known binary relations of 4-adjacency and 8-adjacency. But neither 4adjacency nor 8-adjacency itself allows an analogue of the Jordan curve theorem (cf. [9]) and, therefore, one has to use a combination of the two adjacencies. To overcome this disadvantage, a...