How does Blom's scheme work? Is the polynomial expression of it a normal one?

A few additional questions:

  1. How big does the prime modulus need to be? Can it be bigger than the size of the derived key?
  2. The implementation used by HDCP 1.x uses addition and no multiplication in the calculation of the shared key. Simple examples I've seen in handouts for courses at universities posted online include multiplication as well. Why the discrepancy?
  3. Does the scheme require any special operations like those used in finite field arithmetic?
  4. What is the term for the scheme? Is it a key establishment scheme, a key agreement scheme, a key exchange scheme, etc.
  5. This is the first scheme for key agreement that I've seen that doesn't rely on Diffie-Hellman or public key cryptography. Are there any other alternatives?
  • $\begingroup$ These may be good questions on their own, but "I'm interested in understanding both the polynomial and matrix expressions of it." isn't really a question. $\endgroup$ – Maarten Bodewes Mar 1 '16 at 1:08
  • $\begingroup$ @MaartenBodewes Fixed, but the title was the question to begin with. $\endgroup$ – Melab Mar 1 '16 at 5:18

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.