known, the above algorithm can be used to find the secret keys to produce a new derived key from arbitrary new KSV. If the space spanned by the ()KSVs doesn't span the full 40 dimensional space, this may be okay because the KSVs were either not designed to not span the space, or only a small number of extra keys are needed to find a set of vectors spanning the full space. Each additional device has low odds of being linearly dependent with the existing set. (roughly 1/2^[40-dimensionality-of-spanned-space]. This analysis of probabilities of linear dependence is similar to the analysis of Simon's Algorithm). See also HDCP Hash Functions References External links Apparent HDCP weaknesses Digital rights management standards