|Authors:||Mihaljević, Miodrag J.
|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||On employment of different weight parity-checks for the fast correlation attack||Journal:||IEEE International Symposium on Information Theory - Proceedings||First page:||119||Conference:||IEEE International Symposium on Information Theory (ISIT 2001); Washington, DC; United States; 24 June 2001 through 29 June 2001||Issue Date:||1-Jan-2001||Rank:||M23||ISSN:||2157-8095||DOI:||10.1109/ISIT.2001.935982||Abstract:||
An approach for construction of algorithms for the fast correlation attack employing the multi-weight parity-checks is pointed out. The proposed approach is based on the following: (i) construct appropriate different weight parity-checks assuming that certain information bits are known; (ii) decode each of the remained information bits employing certain exhaustive search and threshold decoding technique. An analysis of the performance is given.
|Keywords:||Algorithms | Bit error rate | Cryptography | Decoding | Linear equations | Matrix algebra | Polynomials | Probability density function | Vectors||Publisher:||IEEE|
Show full item record
checked on Dec 6, 2023
checked on Dec 7, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.