Cryptographic properties of nonlinear pseudorandom number generators

DOI10.1007/s10623-007-9164-4zbMath1182.65011OpenAlexW2032003838MaRDI QIDQ1008990

Nicholas Kolokotronis

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9164-4

zbMATH Keywords

nonlinear pseudorandom number generatorscryptographic propertiest-functions

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (4)

The p-adic Theory of Automata Functions ⋮ The autocorrelation properties of single cycle polynomial T-functions ⋮ New application methods for word-oriented cryptographic primitives ⋮ T-functions revisited: new criteria for bijectivity/transitivity

Uses Software

• eSTREAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers
• Uniformly distributed sequences of \(p\)-adic integers
• On the linear complexity of nonlinearly filtered pn-sequences
• Transitive polynomial transformations of residue class rings
• Linear Cryptanalysis of the TSC Family of Stream Ciphers
• Time-Memory Trade-Off Attacks on Multiplications and T-Functions
• Fast Software Encryption
• Fast Software Encryption
• Fast Software Encryption
• Selected Areas in Cryptography
• Permutation polynomials modulo \(2^w\)

This page was built for publication: Cryptographic properties of nonlinear pseudorandom number generators