3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.CR2011★ 1 cited
Cryptographic Hardening of d-Sequences
Sandhya Rangineni
This paper shows how a one-way mapping using majority information on adjacent bits will improve the randomness of d-sequences. Supporting experimental results are presented. It is…
cs.CR2011★ 3 cited
New Results on Scrambling Using the Mesh Array
Sandhya Rangineni
This paper presents new results on randomization using Kak's Mesh Array for matrix multiplication. These results include the periods of the longest cycles when the the array is use…