The first designs of cryptographic hash functions date back to the late 1970s; more
proposals emerged in the 1980s. During the 1990s, the number of hash function designs …

The theory of finite simple groups is a (rather unexplored) area likely to provide interesting
computational problems and modeling tools useful in a cryptographic context. In this note …

Hard mathematical problems are at the core of security arguments in cryptography. In this
paper, we study mathematical generalizations of the famous Rubik's cube puzzle, namely …

Cayley hash functions are based on a simple idea of using a pair of (semi) group elements,
A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the …

We present a practical cryptanalysis of WalnutDSA, a digital signature algorithm
trademarked by SecureRF. WalnutDSA uses techniques from permutation groups, matrix …

After 15 years of unsuccessful cryptanalysis attempts by the research community, Grassl et
al. have recently broken the collision resistance property of the Tillich-Zémor hash function …

Cayley hash function is a significant cryptographic primitive known to be provably secure
and expected to be universal due to the expansion property of Cayley graphs on finite …

We study homomorphic hash functions into SL _2 (q) SL 2 (q), the 2 * 2 2× 2 matrices with
determinant 1 over the field with q elements. Modulo a well supported number theoretic …

We introduce a cryptographic hash function based on expander graphs, suggested by
Charles et al.'09, as one prominent candidate in post-quantum cryptography. We propose a …

In this paper, we propose two provably secure and lengthhiding redactable signature
schemes. Both have a runtime complexity of O (n). This is lower than existing schemes …