Structure of Pseudorandom Numbers Derived from Fermat Quotients

From MaRDI portal
Revision as of 02:42, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3578466

DOI10.1007/978-3-642-13797-6_6zbMath1230.11092OpenAlexW1567281213MaRDI QIDQ3578466

No author found.

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13797-6_6




Related Items (21)

Trace representation and linear complexity of binary sequences derived from Fermat quotientsOn \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotientsOn the k-error linear complexity of binary sequences derived from polynomial quotientsAn extension of binary threshold sequences from Fermat quotientsThe arithmetic of Carmichael quotientsTrace representation of pseudorandom binary sequences derived from Euler quotientsOn the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotientsOn the linear complexity of binary threshold sequences derived from Fermat quotientsLinear complexity of binary sequences derived from Euler quotients with prime-power modulusLinear complexity of pseudorandom sequences generated by Fermat quotients and their generalizationsMultiplicative character sums of Fermat quotients and pseudorandom sequencesUnnamed ItemOn error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)On the value set of Fermat quotientsBoolean functions derived from Fermat quotientsBOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMESHamming correlation of higher orderCorrelation measure, linear complexity and maximum order complexity for families of binary sequencesPolynomial quotients: Interpolation, value sets and Waring's problemLinear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power ModulusAdditive character sums of polynomial quotients




This page was built for publication: Structure of Pseudorandom Numbers Derived from Fermat Quotients