RUS  ENG
Full version
JOURNALS // Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] // Archive

Mat. Vopr. Kriptogr., 2013 Volume 4, Issue 2, Pages 5–15 (Mi mvk78)

On a class of permutation polynomials over rings of residues modulo $2^n$

A. V. Akishin

Moscow State Technical University of Radio Engineering, Electronics and Automatics, Moscow

Abstract: We consider mappings of the residue rings modulo $2^n$ representable as polynomials with rational coefficients. Conditions ensuring that such a polynomial define a permutation of a ring are described.

Key words: incompatible polynomials, residue rings, pseudo-random number generators.

UDC: 519.622

Received 30.VII.2012

DOI: 10.4213/mvk78



© Steklov Math. Inst. of RAS, 2024