Centralized key distribution protocol using the greatest common divisor method
From MaRDI portal
Publication:2629410
DOI10.1016/J.CAMWA.2012.01.038zbMath1362.68066OpenAlexW2065619492MaRDI QIDQ2629410
Publication date: 6 July 2016
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2012.01.038
GCDmulticast communicationkey distributioncomputation complexityKaratsuba multiplicationextended Euclidian algorithm
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)
Cites Work
- Minimizing center key storage in hybrid one-way function based group key management with communication constraints
- An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes
- Dynamic Balanced Key Tree Management for Secure Multicast Communications
- MDS array codes with independent parity symbols
- A Family of Collusion Resistant Symmetric Key Protocols for Authentication
- Unnamed Item
- Unnamed Item
This page was built for publication: Centralized key distribution protocol using the greatest common divisor method