An efficient multidimensional (MD) split vector-radix (SVR) decimation-in-frequency (DIF) fast Hartley transform (FHT) algorithm is proposed by introducing a two-step decomposition strategy coupled with an efficient index mapping and the Kronecker product. Compared to existing MD FHT algorithms, the proposed one significantly reduces the complexity. In addition, the butterfly of the proposed algorithm is characterized by simple closed-form expressions allowing easy software or hardware implementation of the algorithm.