Various matching keys for asymmetric topology encryption

DOI10.1016/j.dam.2023.11.005zbMath1529.94037OpenAlexW4388827800MaRDI QIDQ6180574

Bing Yao, Meimei Zhao, Xiaohui Zhang

Publication date: 22 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.005

zbMATH Keywords

graph labelingpublic keyprivate keytopological coding

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Source coding (94A29) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Super edge magic graceful labeling of generalized Petersen graphs
• Determining the total colouring number is NP-hard
• Every lobster is odd-elegant
• Verification of quantum computation: an overview of existing approaches
• Identity-Based Cryptosystems and Signature Schemes
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Graphic lattices made by graph felicitous-type labelings and colorings of topological coding

This page was built for publication: Various matching keys for asymmetric topology encryption