Key predistribution scheme using finite fields and Reed Muller codes

DOI10.1007/978-3-642-22288-7_6MaRDI QIDQ3100516zbMATH OpenOpenAlexFDO

Authors Pinaki Sarkar, Morshed U. Chowdhury

Publication date 24 November 2011

Published in Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22288-7_6

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Key Predistribution Schemes Using Codes in Wireless Sensor Networks
• A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme
• Key pre-distribution schemes based on symplectic geometry for wireless sensor networks.
• The highly secure polynomial pool-based key pre-distribution scheme for wireless sensor network
• On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

Cites work

• Combinatorial design of key distribution mechanisms for wireless sensor networks
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Key Predistribution Schemes Using Codes in Wireless Sensor Networks
• Selected Areas in Cryptography

Cited in

(4)

• Determining parameters of key predistribution schemes via linear codes in wireless sensor networks
• Key Predistribution Schemes Using Codes in Wireless Sensor Networks
• A public-key cryptosystem based on binary Reed-Muller codes
• A polynomial-based key distribution approach for wireless sensor networks

This page was built for publication: Key predistribution scheme using finite fields and Reed Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100516)