We propose to extend the probability model of UMDA by means of random affine maps on bit vectors. To limit the complexity, the bit matrix of affine maps is represented as short sequences of simple and reversible bit operations called transvections. We consider two versions of UMDA with random affine maps (RAMU) updating one or two probability vectors. We provide fixed-budget experiments to explore the behavior of RAMU and compare it with UMDA.