Complexity comparison of Lagrange and Newton polynomial based revocation schemes

  • Authors:
  • Dokouzyannis Stavros;Spaliaras Iraklis

  • Affiliations:
  • Aristotle University of Thessaloniki, Department of Electrical and Computer Engineering, Thessaloniki, Greece;Aristotle University of Thessaloniki, Department of Electrical and Computer Engineering, Thessaloniki, Greece

  • Venue:
  • ECC'08 Proceedings of the 2nd conference on European computing conference
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two revocation schemes are compared, based on Lagrange interpolation [1] and Newton coefficients [2], allowing disconnection of up to r subscribers in Broadcast Distribution/Encryption Systems. The computational complexity measures are carefully analyzed, so that a digital system designer to be able to fit the design of Smart Card and Secret Controller to the broadcast parameters and requirements. The careful analysis of both methods has not proven the superior dominance of the Newton over the Lagrange scheme. Both methods are comparable and the improvement introduced by the Newton method is not significant for a designer working in a real production field.