A polynomial-based key distribution approach for wireless sensor networks
DOI10.1007/S40995-017-0330-XzbMATH Open1393.94944OpenAlexW2193524575MaRDI QIDQ724960FDOQ724960
Authors: Alireza Moussavi, M. Shamsi 
Publication date: 26 July 2018
Published in: Iranian Journal of Science and Technology, Transactions A: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40995-017-0330-x
Recommendations
- Key Predistribution Schemes Using Codes in Wireless Sensor Networks
- Key predistribution scheme using finite fields and Reed Muller codes
- Determining parameters of key predistribution schemes via linear codes in wireless sensor networks
- A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme
- Key predistribution schemes and one-time broadcast encryption schemes from algebraic geometry codes
convolutional codeskey predistribution schemepolynomial-based key predistribution schemewireless sensor network (WSN)
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29) Cyclic codes (94B15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Maximum distance separable convolutional codes
- On cyclic convolutional codes
- Convolutional codes. An algebraic approach
- Structure and constructions of cyclic convolutional codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convolutional codes I: Algebraic structure
- Title not available (Why is that?)
- Inverses of Linear Sequential Circuits
- Title not available (Why is that?)
- On the structure of convolutional and cyclic convolutional codes
- Annihilator properties of skew monoid rings.
Cited In (1)
This page was built for publication: A polynomial-based key distribution approach for wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724960)
