scientific article; zbMATH DE number 4187706
From MaRDI portal
Publication:5752488
zbMath0719.94013MaRDI QIDQ5752488
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cryptographyJacobi symbolpseudorandom sequencesLegendre sequencesJacobi sequencescryptographically strong pseudorandom bit generator
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (16)
SoK: how (not) to design and implement post-quantum cryptography ⋮ LegRoast: Efficient Post-quantum Signatures from the Legendre PRF ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Post-quantum key-blinding for authentication in anonymity networks ⋮ Sequences related to Legendre/Jacobi sequences ⋮ Zeta functions, one-way functions, and pseudorandom number generators. ⋮ New Wilson-like theorems arising from Dickson polynomials ⋮ On the Anonymization of Cocks IBE Scheme ⋮ On pseudorandomness in families of sequences derived from the Legendre symbol ⋮ New number-theoretic cryptographic primitives ⋮ Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) ⋮ Universally Anonymous IBE Based on the Quadratic Residuosity Assumption ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Trace representation of Legendre sequences over non-binary fields ⋮ Classical and quantum function reconstruction via character evaluation ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
This page was built for publication:
