A generalized encryption scheme based on random graphs

DOI10.1007/3-540-55121-2_17MaRDI QIDQ4694730zbMATH OpenFDO

Authors Luděk Kučera

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55121-2_17

zbMATH Keywords

linear programmingNP-completeprobabilistic encryption schemerandom graphsworst-case complexity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Some graph-based encryption schemes
• CRYPTIM: Graphs as tools for symmetric encryption
• Graph based private key crypto-system
• On some applications of graphs to cryptography and turbocoding
• On some properties of graph based public keys
• CERTAIN SPECIFIC GRAPHS IN CRYPTOGRAPHY
• Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models
• A Survey on some Applications of Graph Theory in Cryptography
• Cryptanalysis and improvements on some graph-based authentication schemes
• scientific article; zbMATH DE number 5299614

Cited in

(4)

• Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models
• NP completeness of relocation cipher
• scientific article; zbMATH DE number 7539937 (Why is no real title available?)
• Maximum chordal subgraphs of random graphs

This page was built for publication: A generalized encryption scheme based on random graphs

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