A graph theoretic method for securing key fobs

DOI10.1007/S40096-020-00363-4MaRDI QIDQ2041164zbMATH OpenOpenAlexFDO

Authors F. Heydari, Alireza Ghahremanian

Publication date 15 July 2021

Published in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40096-020-00363-4

zbMATH Keywords

Hamiltonian cycleintersection graphsecurityaccess control key fob

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structure of finite commutative rings (13M05)

Recommendations

• Graph-theoretic design and analysis of key predistribution schemes
• Security in graphs
• Security in Sierpiński graphs
• (F, I)-security in graphs
• Integer and fractional security in graphs
• Ultra-security in graphs
• Graph based private key crypto-system

Cites work

• A Practical Attack on KeeLoq
• Intersection graphs of ideals of rings
• On the complement of the intersection graph of submodules of a module
• Practical Algebraic Attacks on the Hitag2 Stream Cipher
• The M-Regular Graph of a Commutative Ring
• The \(M\)-intersection graph of ideals of a commutative ring
• The \(M\)-principal graph of a commutative ring
• The annihilating-ideal graph of \(\mathbb{Z}_n\) is weakly perfect
• The graph of subgroups of a finite group
• The intersection graph of ideals of \(\mathbb Z_m\)
• The regular graph of a commutative ring

Cited in

(1)

• Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models

Describes a project that uses

Uses Software

• HiTag2

This page was built for publication: A graph theoretic method for securing key fobs

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