A graph theoretic method for securing key fobs

DOI10.1007/s40096-020-00363-4zbMath1475.05081OpenAlexW3107242687MaRDI QIDQ2041164

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

securityintersection graphHamiltonian cycleaccess control key fob

Mathematics Subject Classification ID

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

Uses Software

• HiTag2

Cites Work

• Unnamed Item
• The \(M\)-principal graph of a commutative ring
• The regular graph of a commutative ring
• Practical Algebraic Attacks on the Hitag2 Stream Cipher
• The M-intersection graph of ideals of a commutative ring
• The intersection graph of ideals of ℤm
• The M-Regular Graph of a Commutative Ring
• On the complement of the intersection graph of submodules of a module
• A Practical Attack on KeeLoq
• The graph of subgroups of a finite group
• Intersection graphs of ideals of rings

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