crypto/algorithms/pureaescipher.py
def _shiftRow(self, state, statePointer, nbr, isInv):
        '''
        each iteration shifts the row to the left by 1
        '''
        for i in range(nbr):
            if isInv:
                state[statePointer:statePointer+4] = \
                        state[statePointer+3:statePointer+4] + \
                        state[statePointer:statePointer+3]
            else:
                state[statePointer:statePointer+4] = \
                        state[statePointer+1:statePointer+4] + \
                        state[statePointer:statePointer+1]
        return state

        each iteration shifts the row to the left by 1
        
each iteration shifts the row to the left by 1
each iteration shifts the row to the left by 1
def _shiftRow(self, state, statePointer, nbr, isInv):
        for i in range(nbr):
            if isInv:
                state[statePointer:statePointer+4] = \
                        state[statePointer+3:statePointer+4] + \
                        state[statePointer:statePointer+3]
            else:
                state[statePointer:statePointer+4] = \
                        state[statePointer+1:statePointer+4] + \
                        state[statePointer:statePointer+1]
        return state
def _shiftRow ( self , state , statePointer , nbr , isInv ) : for i in range ( nbr ) : if isInv : state [ statePointer : statePointer + 4 ] = state [ statePointer + 3 : statePointer + 4 ] + state [ statePointer : statePointer + 3 ] else : state [ statePointer : statePointer + 4 ] = state [ statePointer + 1 : statePointer + 4 ] + state [ statePointer : statePointer + 1 ] return state
each iteration shifts the row to the left by 1
each iteration shifts the row to the left by 1
'''
        each iteration shifts the row to the left by 1
        '''
self
state
statePointer
nbr
isInv