Cryptography and Coding

DOI10.1007/B93924zbMATH Open1123.94330OpenAlexW2478032277MaRDI QIDQ5428168FDOQ5428168

Domingo Gómez-Pérez, Simon R. Blackburn, Jaime Gutierrez, Igor E. Shparlinski

Publication date: 28 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93924

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pseudo-random numbers; Monte Carlo methods (11K45)

Cited In (17)

• On the modular inversion hidden number problem
• Title not available (Why is that?)
• Fixed points of the subset sum pseudorandom number generators
• On the Bit Security of Elliptic Curve Diffie–Hellman
• On pseudorandom numbers from multivariate polynomial systems
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Pseudorandom numbers and hash functions from iterations of multivariate polynomials
• On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
• Predicting truncated multiple recursive generators with unknown parameters
• Predicting masked linear pseudorandom number generators over finite fields
• On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
• Finite binary sequences constructed by explicit inversive methods
• The Carlitz rank of permutations of finite fields: a survey
• Predicting nonlinear pseudorandom number generators
• Inferring sequences produced by the quadratic generator

This page was built for publication: Cryptography and Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428168)