2 Hits in 1.2 sec

On the Evolution of GGHN Cipher [chapter]

Subhadeep Banik, Subhamoy Maitra, Santanu Sarkar
2011 Lecture Notes in Computer Science  
2] = 80, S[3] the GGHN(n, m) PRGA algorithm, one can obtain a cycle of length 2 n starting with the initial state M Present a theoretical model in which indices are chosen independently and uniformly  ...  transition matrices M k ,M q M k (i, j) = Pr (A t+1 = j/A t = i) after change of k M q (i, j) = Pr (A t+1 = j/A t = i)after change of S M = M q × M k gives the full transition probabilities after one iteration  ... 
doi:10.1007/978-3-642-25578-6_15 fatcat:qb5mqtias5edbioyxiy56i5hka

Cryptanalysis of lightweight cryptographic algorithms

Mohammad Ali Orumiehchiha
In addition, a key-recovery attack on the cipher has been successfully proposed. Then, a security evaluation of the Rakaposhi stream cipher identifies weaknesses of the cipher.  ...  This dissertation addresses cryptanalysis of several stream ciphers, and a hash function based on stream cipher.  ...  Acknowledgements I would like to express my sincere appreciation to my supervisor Professor Josef Pieprzyk for supporting of me at many levels: financial, intellectual and personal.  ... 
doi:10.25949/19432694.v1 fatcat:326l7fzmxrhbrmv3ajek4d3m5e