Method of master keying a system of locks, the locks using a p pin cylinder, each pin having b bittings, the method comprising: a) providing a key system schematic, the key system schematic defining: 1) a plurality of levels of master keys, the lowest level master key being level L 2 and the highest level master key being L n, 2) a plurality of change keys, the change keys being assigned to a master key and assigned to groups, 3) a plurality of trees consisting of a master key and any lower level master keys and change keys which are operated by the master key b) providing an array having (b−1) (p−3) elements wherein each element represents (b−1) 3 possible key bitting combinations, the array being divided into a plurality of subarrays, the first division being into subarrays of (b−1) (p−4) elements, the divided subarrays being repeatedly divided into further subarrays of (b−1) (p−x) elements, x=5, 6. Method of master keying a system of locks, the locks using a 6 pin cylinder, each pin having 5 bittings, the method comprising: a) providing a key system schematic, the key system schematic defining: 1) a plurality of levels of master keys, the lowest level master key being level L 2 and the highest level master key being L n, 2) a plurality of change keys, the change keys being assigned to a master key and assigned to groups, 3) a plurality of trees consisting of a master key and any lower level master keys and change keys which are operated by the master key b) providing an 8×8 checkerboard array having 64 squares wherein each square represents 64 possible key bitting combinations, the checkerboard being divided into subarrangements of 4 4×4 checkerboards and the 4×4 checkerboards being divided into subarrangements of 4 2×2 checkerboards c) determining the number of change keys assigned to each master key for levels L 2 through levels L n d) starting with the group of unassigned change keys with the most levels of master keys above it, selecting a number of unassigned contiguous squares from the checkerboard representing at least the number of change keys in the selected group and placing pieces on the 8×8 checkerboard array, each piece covering the selected number of unassigned contiguous squares, wherein the number of squares=¼, 1, 4, or 16, a 4 square selection coinciding with one of the 2×2 checkerboards and a 16 square selection coinciding with one of the 4×4 checkerboards, all groups of assigned change keys below any master key L n−1−L 2 being within the same 2×2 or 4×4 checkerboard e) repeating step d for all groups of change keys grouped below the first master key above the first selected group of change keys f) repeating steps d and e for all remaining unassigned change keys grouped below the highest master key in the tree for the selected group and g) repeating steps d through f for all remaining change key groups, selecting any change key groups having only master key L n in its respective tree after all other groups are completed.Ģ. Having described the invention, what is claimedġ.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |