CRFeb 1, 2012

Randomization Using Quasigroups, Hadamard and Number Theoretic Transforms

arXiv:1202.0223v11 citations
Originality Synthesis-oriented
AI Analysis

This addresses the problem of secure sequence encryption for cryptography, but appears incremental as it combines existing transforms without claiming major breakthroughs.

The paper tackled the problem of sequence randomization by investigating the use of quasigroups, Hadamard transforms, and Number Theoretic Transforms, with the result being their application to generate hash functions for sequence encryption.

This paper investigates the use of quasigroups, Hadamard transforms and Number Theoretic Transforms for use in sequence randomization. This can also be used to generate hash functions for sequence encryption.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes