It is a matter of time before quantum computers will break the cryptosystems like RSA and
ECC underpinning today's internet protocols. As Post-Quantum Cryptography (PQC) is a low …

In the last two decades, many computational problems arising in cryptography have been
successfully reduced to various systems of polynomial equations. In this paper, we revisit a …

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 …

We initiate a systematic study of pseudorandom functions (PRFs) that are computable by
simple matrix branching programs; we refer to these objects as “matrix PRFs”. Matrix PRFs …

Group theory appears to be a promising source of hard computational problems for
deploying new cryptographic constructions. This reference focuses on the specifics of using …

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 …

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 propose a new cryptographic algorithm based on combination of hybridization and
rotation of cubes. Hybridization was performed using magic cubes with m number of n order …

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 …