The combinatorial complexity of masterkeying

DOI10.1007/S001860000084MaRDI QIDQ1397694zbMATH OpenOpenAlexFDO

Authors W. Espelage, Egon Wanke

Publication date 7 August 2003

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001860000084

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 5204734
• The Complexity of Public-Key Cryptography
• Publication:4887836
• The combinatorics of authentication and secrecy codes
• The Combinatorics of Perfect Authentication Schemes
• scientific article; zbMATH DE number 3846870
• Complexity Measures for Public-Key Cryptosystems
• scientific article; zbMATH DE number 6686837
• scientific article; zbMATH DE number 1284201
• Kolmogorov complexity and cryptography

Cited in

(7)

• Mathematical modelling of mechanical combination lock systems
• The secret life of keys: on the calculation of mechanical lock systems
• scientific article; zbMATH DE number 6686837 (Why is no real title available?)
• Methods for solving problems of mathematical safes on matrices with different types of locks
• scientific article; zbMATH DE number 5204734 (Why is no real title available?)
• Исследование сложности метода радужных таблиц с маркерами цепочек
• The secret and beauty of ancient Chinese padlocks

This page was built for publication: The combinatorial complexity of masterkeying

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1397694)