Methods of reducing bio-cryptographic algorithms computational complexity

被引:0
|
作者
Velciu, Marius-Alexandru [1 ,2 ]
Patriciu, Victor-Valeriu [1 ]
机构
[1] Mil Tech Acad, Dept Comp Sci, Bucharest, Romania
[2] Adv Technol Inst, Bucharest, Romania
关键词
bio-cryptographic algorithms; biometric encryption; Fuzzy Vault scheme; Reed-Solomon error correcting codes; Lagrange Interpolation; shared biocryptograms; FUZZY VAULT;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional biometric systems have always been regarded with skepticism, due to the uniqueness and universality features of human biometrics once stolen or compromised, they cannot be safely replaced. For this reason, common efforts of Cryptography and biometric systems researchers gave birth to Bio-cryptography, a domain which proposes to overcome the main security issues associated with biometrics usage, by generating or securing existing cryptographic keys, using biometric data. The main advantages brought by Bio-cryptography are represented by eliminating the need for storing biometric templates and the flexibility of resulted bio-cryptograms. On the other hand, one major drawback concerning bio-cryptographic algorithms is their high consumption of computational resources, caused by the various mathematical processing and large amounts of data used. This paper proposes two methods of reducing bio-cryptographic algorithms computational complexity: the usage of error-correcting codes in the secret key recovery stage and the shared biocryptograms approach for the entire biometric encryption process.
引用
收藏
页码:153 / 158
页数:6
相关论文
共 50 条
  • [21] Reducing Computational Complexity for Face Detection
    Sathyanarayana, Supriya
    Satzoda, Ravi Kumar
    Sathyanarayana, Suchitra
    Thambipillai, Srikanthan
    2014 14TH INTERNATIONAL SYMPOSIUM ON INTEGRATED CIRCUITS (ISIC), 2014, : 376 - 379
  • [22] Reducing computational complexity with array predicates
    Bernecky, R
    PROCEEDINGS OF THE APL98 CONFERENCE, 1999, 29 (03): : 39 - 43
  • [23] Reducing computational complexity in fingerprint matching
    Sabir, Mubeen
    Khan, Tariq M.
    Arshad, Munazza
    Munawar, Sana
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2020, 28 (05) : 2538 - 2551
  • [24] Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
    Baillot, Patrick
    Barthe, Gilles
    Dal Lago, Ugo
    JOURNAL OF AUTOMATED REASONING, 2019, 63 (04) : 813 - 855
  • [25] Reducing complexity in computational imaging systems
    Kubala, K
    Dowski, E
    Cathey, WT
    OPTICS EXPRESS, 2003, 11 (18): : 2102 - 2108
  • [26] Reducing computational complexity of quantum correlations
    Chanda, Titas
    Das, Tamoghna
    Sadhukhan, Debasis
    Pal, Amit Kumar
    Sen , Aditi
    Sen, Ujjwal
    PHYSICAL REVIEW A, 2015, 92 (06):
  • [27] Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
    Baillot, Patrick
    Barthe, Gilles
    Dal Lago, Ugo
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 203 - 218
  • [28] A Note on Time and Space Complexity of RSA and ElGamal Cryptographic Algorithms
    Emmanuel, Adeniyi Abidemi
    Aderemi, Okeyinka E.
    Marion, Adebiyi O.
    Emmanuel, Asani O.
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2021, 12 (07) : 143 - 147
  • [29] Microcontroller Implementation of Algorithms for Computational Complexity
    Gheorghita, Andrei
    Corciova, Calin
    Turnea, Marius
    Arotaritei, Dragos
    2019 11TH INTERNATIONAL SYMPOSIUM ON ADVANCED TOPICS IN ELECTRICAL ENGINEERING (ATEE), 2019,
  • [30] Algorithms, complexity and computational models Preface
    Chen, Jianer
    Cooper, S. Barry
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (23) : 2457 - 2458