Key masking using biometry

DOI10.1134/S0032946011020098zbMath1242.94021MaRDI QIDQ764394

A. L. Chmora

Publication date: 13 March 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

biometrycryptographic key

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Binding cryptographic keys into biometric data: optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fuzzy vault scheme
• Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The intractability of computing the minimum distance of a code
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Hardness of approximating the minimum distance of a linear code
• On the complexity of minimum distance decoding of long linear codes
• Password hardening based on keystroke dynamics
• Selecting cryptographic key sizes

This page was built for publication: Key masking using biometry