Abstract:
Two cryptosystems using polynomials on finite fields are introduced; a permutation cipher based on permutation polynomials and a flexible secret sharing scheme. Polynomia...Show MoreMetadata
Abstract:
Two cryptosystems using polynomials on finite fields are introduced; a permutation cipher based on permutation polynomials and a flexible secret sharing scheme. Polynomials are called permutation polynomials if they induce bijective functions. Metric and algebraic properties of permutation polynomials over a finite fields are investigated, especially properties associated with orbits and permutation cycles. Flexible secret sharing schemes have features that they can change a secret, enroll/disenroll members, increase/decrease threshold, without changing shares. A simple scheme using polynomials over finite fields is presented.
Published in: Proceedings of the IEEE Information Theory Workshop
Date of Conference: 25-25 October 2002
Date Added to IEEE Xplore: 06 January 2003
Print ISBN:0-7803-7629-3