Article
Licensed
Unlicensed
Requires Authentication
On insecurity of cryptosystems based on generalized Reed-Solomon codes
-
V. M. SIDELNIKOV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1992
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- 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
Articles in the same Issue
- 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
