Abstract

Cryptography algorithms provide confidentiality, integrity and authentication of communication channels. These algorithms and protocols are based on sophisticated mathe-matics such as computational and algorithmic algebraic geometry, coding theory, and generic algorithms for finite abelian groups. For secure encryption, establishing or transferring a shared key between the parties is an interesting challenge. Key management is an essential crypto-graphic primitive upon which other security primitives are built.In this paper, we present a generic construction of asymmetric key Group key transfer protocol using one way function and coding theory technique. By guaranteeing the freshness of authentication messages, the authenticity of the generator of authentication messages and the completeness of the authenticator, the improved protocol can resist various passive and active attacks. The protocol allows the participants in the group to derive a common encryption key, provide the key security and unknown key share properties. Security analysis of proposed scheme is also discussed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.