Construction of Polynomial over Finite Field

被引:0
作者
Jain, Archa [1 ]
Bhateja, Ashok
Bhagchandani, Kanika [2 ]
机构
[1] Banasthali Vidyapeeth Univ, Jaipur, Rajasthan, India
[2] DRDO, Delhi, India
来源
2014 IEEE STUDENTS' CONFERENCE ON ELECTRICAL, ELECTRONICS AND COMPUTER SCIENCE (SCEECS) | 2014年
关键词
cryptography; biometrics; finite field; fuzzy vault; polynomial; interpolation;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Lately researches are going on to combine both cryptography and biometric systems for more reliability and security of a system. It can be accomplished using fuzzy vault technique. Fuzzy vault stores the secret key. Unlocking phase of fuzzy vault is based on construction of polynomial over a finite field system GF(2(n)). As the size of a key increases, the time taken for construction of polynomial increases exponentially. We have designed and implemented an efficient algorithm for construction of polynomial over a finite field GF(2(n)).
引用
收藏
页数:4
相关论文
共 50 条
  • [21] Implementation of Finite Field Arithmetic Operations for Polynomial and Normal Basis Representations
    Maulana, Mirza
    Senjaya, Wenny Franciska
    Rahardjo, Budi
    Muchtadi-Alamsyah, Intan
    Paryasto, Marisa W.
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATION FOR SCIENCE AND TECHNOLOGY, 2015, 5 : 129 - 134
  • [22] Deciding multiaffinity of polynomials over a finite field
    Selezneva, Svetlana N.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2024, 34 (04) : 233 - 244
  • [23] Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field
    Naveed Ahmed Azam
    Umar Hayat
    Ikram Ullah
    Frontiers of Information Technology & Electronic Engineering, 2019, 20 : 1378 - 1389
  • [24] Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field
    Azam, Naveed Ahmed
    Hayat, Umar
    Ullah, Ikram
    FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING, 2019, 20 (10) : 1378 - 1389
  • [25] On the irreducible factors of a polynomial over a valued field
    Jakhar, Anuj
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2024, 74 (02) : 367 - 375
  • [26] The construction of LDPC codes based on the subspaces of singular linear space over finite field
    Wang, Congcong
    Zhang, Yingying
    Li, Zhuoqun
    Zhang, Xiaona
    Gao, You
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2016, 8 (04)
  • [27] Species over a finite field
    Henderson, A
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2005, 21 (02) : 147 - 161
  • [28] Species Over a Finite Field
    Anthony Henderson
    Journal of Algebraic Combinatorics, 2005, 21 : 147 - 161
  • [29] Intersecting families of graphs of functions over a finite field
    Aguglia, Angela
    Csajbok, Bence
    Weiner, Zsuzsa
    ARS MATHEMATICA CONTEMPORANEA, 2024, 24 (01)
  • [30] Polynomial Time Algorithm for the Two-Side Exponentiation Problem about Ergodic Matrices over Finite Field
    GU Chunsheng1
    2.School of Computer Science and Technology
    Wuhan University Journal of Natural Sciences, 2012, 17 (03) : 233 - 237