Key masking using biometry (Q764394)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Key masking using biometry	scientific article

Statements

scholarly article

0 references

Key masking using biometry (English)

0 references

0 references

Problems of Information Transmission

0 references

publication date

13 March 2012

0 references

zbMATH Keywords

cryptographic key

0 references

biometry

0 references

MaRDI profile type

MaRDI publication profile

0 references

Password hardening based on keystroke dynamics

0 references

A fuzzy vault scheme

0 references

On the inherent intractability of certain coding problems (Corresp.)

0 references

The intractability of computing the minimum distance of a code

0 references

0 references

Hardness of approximating the minimum distance of a linear code

0 references

Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard

0 references

Improved decoding of Reed-Solomon and algebraic-geometry codes

0 references

Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression

0 references

On the complexity of minimum distance decoding of long linear codes

0 references

Selecting cryptographic key sizes

0 references

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S0032946011020098

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:764394

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q764394&oldid=35269306"