پديد آورنده :
كاملي، محبوبه
عنوان :
رابطه بين تسهيم راز و كدهاي خطي
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
مرتضي اسماعيلي
توصيفگر ها :
طرح تسهيم راز , ساختار دسترسي , كد كلمه هاي كمينه , كدهاي خوددوگان , خصوصيات طرح ها , وزن شمار ژاكوبي
تاريخ نمايه سازي :
20/1/93
استاد داور :
حميدرضا مرزبان، محمدحسام تدين
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
On Relations Between Secret Sharing and Linear Code Mahboobeh Kameli m kameli@math iut ac ir 2014 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Prof Morteza Esmaeili emorteza@cc iut ac ir Advisor Dr Ali Zaghian ali zaghian1338@yahoo com 2010 MSC 68P30 94B05 Keywords secret sharing scheme Linear code access structure minimal codeword self dual code design properties jacobi weight enumerator Abstract Secret sharing is an important topic in cryptography and has applications in informationsecurity There are several approaches for constructing secret sharing schemes in the liter ature One of the methods is based on coding theory Theoritically every linear code canbe used to construct a secret sharing scheme The access structure in this scheme is basedon minimal codewords of a particular code In this thesis several codes are introduced thatthe covering problem has been solved for them the covering problem is the determiniation ofthe minimal codewords In this thesis we also use self dual codes to construct secret sharingschemes We use combinatorial properties to understand the access structure of such secretsharing schemes We describe two techniques to determine the access structure of a scheme the rst arising from design properties in codes and the second from the jacobi weight enu merator The presented access structures are of two types In the rst type there are a number of
استاد راهنما :
مرتضي اسماعيلي
استاد داور :
حميدرضا مرزبان، محمدحسام تدين
