Lund University Publications
metadata only
Predicting the shrinking generator with fixed connections
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking generator with a weight 4 polynomial of degree as large as 10000, using 2(32) output bits. As the feedback polynomial of an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Some attacks on the Bit-search generator#659409
- Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem#793882
- Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem#789863
- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size#971974
- Toward a Generalized Defense Across Sparse, Continuous, and Structured Parameter Attacks#259572
Record · ID 823216
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive