The secret life of keys: on the calculation of mechanical lock systems

DOI10.1137/15M1030054zbMATH Open1370.90232MaRDI QIDQ5738136FDOQ5738136

Authors: Christof Vömel, Flavio de Lorenzi, Samuel Beer, Erwin Fuchs 

Publication date: 31 May 2017

Published in: SIAM Review (Search for Journal in Brave)

Recommendations

• The combinatorial complexity of masterkeying
• Mathematical modelling of mechanical combination lock systems
• Problems on mathematical safes on graphs
• Solution of a matrix problem on a mathematical safe for locks of the same kind. I
• Fuming Acid and Cryptanalysis: Handy Tools for Overcoming a Digital Locking and Access Control System

zbMATH Keywords

simulated annealingcombinatorial optimizationdirected acyclic graphglobal optimizationrandomized algorithmheuristicartificial intelligenceNP-completenesssemilatticealgebraic modelsubgraph isomorphismmathematics in industrycylinder locklock system

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Combinatorial optimization (90C27) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Semilattices (06A12)

Cites Work

• The algorithm design manual
• Title not available (Why is that?)
• An introduction to statistical learning. With applications in R
• Elements of Information Theory
• Optimization by simulated annealing
• Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
• Title not available (Why is that?)
• Introduction to algorithms.
• Title not available (Why is that?)
• An Algorithm for Subgraph Isomorphism
• Title not available (Why is that?)
• Evolutionary optimization algorithms. Biologically inspired and population-based approaches to computer intelligence
• Combinatorial optimization. Theory and algorithms.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Transitive Reduction of a Directed Graph
• Three Partition Refinement Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum distance<tex>q</tex>-nary codes
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The nature of computation
• Title not available (Why is that?)
• Facts, Conjectures, and Improvements for Simulated Annealing
• The complexity of embedding orders into small products of chains
• Global optimization and simulated annealing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic Optimization
• The representation of posets and lattices by sets
• Computational aspects of the 2-dimension of partially ordered sets
• The logic of partitions: introduction to the dual of the logic of subsets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies

Cited In (6)

• Mathematical modelling of mechanical combination lock systems
• Finding subgraphs with side constraints
• The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
• Problems on mathematical safes on graphs
• Locks fit into keys: a crystal analysis of lock polynomials
• Locks, Bombs and Testing: The Case of Independent Locks

Uses Software

• MUMPS
• Genocop
• Stony Brook
• CLIPS
• Tabu search
• Boost
• BGL

This page was built for publication: The secret life of keys: on the calculation of mechanical lock systems

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