Secret sharing schemes obtained from some special codes


Creative Commons License

Özbek I., Köroğlu M. E. , Şiap I.

Noncommutative rings and their applications, IV, Arras, France, 8 - 11 June 2015, pp.30

  • Publication Type: Conference Paper / Summary Text
  • City: Arras
  • Country: France
  • Page Numbers: pp.30

Abstract

Secret sharing schemes have found applications in speci c cryptography [2]. These schemes o er a way to protect the secret key by distributing shares

to participants. Many methods have been developed over the last decades [4, 6]. One of these methods is based on exploring the minimal codewords

in a linear code [5]. But determining the minimal codewords of a code is very challenging and dicult problem in general [1, 3]. In this study, we

characterize minimal codewords of a special class of cyclic codes that have generators as Fibonacci polynomials over nite elds. Also, we determine

access structures of these codes which are crucial to secret sharing.