Protocols for RFID tag/reader authentication
Decision Support Systems
HB-MP: A further step in the HB-family of lightweight authentication protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discrete Applied Mathematics
A method for efficiently computing the number of codewords of fixed weights in linear codes
Discrete Applied Mathematics
A tamper-proof and lightweight authentication scheme
Pervasive and Mobile Computing
Separating models of learning with faulty teachers
Theoretical Computer Science
Design and implementation of S-MARKS: A secure middleware for pervasive computing applications
Journal of Systems and Software
On the covering radius of cyclic linear codes and arithmetic codes
Discrete Applied Mathematics
On generalized hamming weights and the covering radius of linear codes
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
One-time signature scheme from syndrome decoding over generic error-correcting codes
Journal of Systems and Software
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
Cryptanalysis of the Wu-Dawson Public Key Cryptosystem
Finite Fields and Their Applications
Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
An improved threshold ring signature scheme based on error correcting codes
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Zero-knowledge protocols for the mceliece encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Commitments and efficient zero-knowledge proofs from learning parity with noise
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hidden bits approach for authentication in RFID systems
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
Revisiting lightweight authentication protocols based on hard learning problems
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Identity based identification from algebraic coding theory
Theoretical Computer Science
Tree-LSHB+: An LPN-Based Lightweight Mutual Authentication RFID Protocol
Wireless Personal Communications: An International Journal
| Hi-index | 754.84 |
MEMBER, IEEE, AND HENK C. A. V~ TILBORG The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown. This strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.