Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

A public-key cryptosystem based on binary Reed-Muller codes

  • V. M. SIDELNIKOV
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1994.4.3.191
Published Online: 2009-10-09
Published in Print: 1994

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 4 Issue 3

Journal and Issue

Articles in the same Issue

A public-key cryptosystem based on binary Reed-Muller codes
On precomplete classes in Cartesian products of P2and P3
On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
Limit distributions of the number of cyclic points of stable random mappings
Complexity of Boolean functions in the class of canonical polarized polynomials
On the distribution of the spectral complexity of Boolean functions
Some properties of mutually inverse systems of p-valued logic functions
Downloaded on 26.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1994.4.3.191/html
Scroll to top button