The Scalability of Secure Lock

This paper investigates how well secure lock scales. Using a Java simulation, secure locks are generated for network sizes up to 5,000 nodes using prime number node identifiers up to 512 bits in length. The resulting message sizes as well as the amount of time and memory consumed in the secure lock generation process are used for comparison. The Java BigInteger class enables secure lock generation on a desktop PC, which requires less than five minutes of time to produce the largest secure locks. The simulation also demonstrates secure locks´ ability to exclude untrusted members of the network. It is found that as the number of recipients increases, the secure lock message size increases linearly, while the amount of time and system memory used to create the secure lock increase exponentially.