Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On insecurity of cryptosystems based on generalized Reed-Solomon codes
-
V. M. SIDELNIKOV
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1992
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Polyhedral aspects of multi-index axial transportation problems
- Hardly realizable Boolean functions and hardly computable real numbers
- On isomorphisms of incidence algebras
- An asymptotic formula for the number of correlation-immune of order k Boolean functions
- Methods OI geometry and probabilistic combinatorics in threshold logic
- On insecurity of cryptosystems based on generalized Reed-Solomon codes
- On the number of substitutions with cycle lengths from a given set
Artikel in diesem Heft
- Polyhedral aspects of multi-index axial transportation problems
- Hardly realizable Boolean functions and hardly computable real numbers
- On isomorphisms of incidence algebras
- An asymptotic formula for the number of correlation-immune of order k Boolean functions
- Methods OI geometry and probabilistic combinatorics in threshold logic
- On insecurity of cryptosystems based on generalized Reed-Solomon codes
- On the number of substitutions with cycle lengths from a given set
