Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338395
S. Bezzateev, D. Kovalev
The advanced protocol of mutual authentication for ultra-lightweight RFID tags is considered. The changing of the standard operation of addition modulo 2m by the operation of addition modulo 2m - 1 allows to avoid well-known authentication protocols desynchronization, anonymity and disclosure of the secret vulnerabilities.
{"title":"RFID advanced ultra lightweight authentication protocol","authors":"S. Bezzateev, D. Kovalev","doi":"10.1109/RED.2012.6338395","DOIUrl":"https://doi.org/10.1109/RED.2012.6338395","url":null,"abstract":"The advanced protocol of mutual authentication for ultra-lightweight RFID tags is considered. The changing of the standard operation of addition modulo 2m by the operation of addition modulo 2m - 1 allows to avoid well-known authentication protocols desynchronization, anonymity and disclosure of the secret vulnerabilities.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117202549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338405
Alexander Lysyak
This work covers an experimental research of statistical methods in cryptoanalysis on the example of the block ciphers RC6, MARS and CAST-128. The offered gradient attack is based on the statistical test named “bookstack”. The described schemes and modifications of the attack allow to reduce complexity of finding a secret key in compare to earlier known types of attacks. Researches of efficiency of gradient statistical attack are conducted in this work, limits of its practical and theoretical applicability are shown (9 rounds of cipher RC6, 21 round of MARS and 4 rounds of CAST-128). Also in the work deduced analytical dependences between effectively attacked rounds and temporal and hardware complexity of attack. Besides, for ciphers RC6 and MARS it was developed the modifications of gradient attack, which considerably reduce time and operational complexity have been developed. Also in this work the method of definition optimal parameters of attack is shown; time complexity and its dependence on test and size parameters of a ciphertext are researched; theoretical requirements for the computing resources for realization of attack are shown.
{"title":"Analysis of gradient statistical attack at block ciphers RC6, MARS, CAST-128","authors":"Alexander Lysyak","doi":"10.1109/RED.2012.6338405","DOIUrl":"https://doi.org/10.1109/RED.2012.6338405","url":null,"abstract":"This work covers an experimental research of statistical methods in cryptoanalysis on the example of the block ciphers RC6, MARS and CAST-128. The offered gradient attack is based on the statistical test named “bookstack”. The described schemes and modifications of the attack allow to reduce complexity of finding a secret key in compare to earlier known types of attacks. Researches of efficiency of gradient statistical attack are conducted in this work, limits of its practical and theoretical applicability are shown (9 rounds of cipher RC6, 21 round of MARS and 4 rounds of CAST-128). Also in the work deduced analytical dependences between effectively attacked rounds and temporal and hardware complexity of attack. Besides, for ciphers RC6 and MARS it was developed the modifications of gradient attack, which considerably reduce time and operational complexity have been developed. Also in this work the method of definition optimal parameters of attack is shown; time complexity and its dependence on test and size parameters of a ciphertext are researched; theoretical requirements for the computing resources for realization of attack are shown.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127579931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338414
Andrej Stefanov, M. Stojanovic
We analyze the performance of underwater acoustic random access networks. The assumption is that the nodes are distributed in the plane according to a two dimensional Poisson point process. This is a suitable model for a network of bottom mounted nodes. The node-to-node channel is modeled based on an underwater acoustic propagation path loss and fading. We provide a statistical characterization of the network interference, by taking into account the acoustic propagation characteristics, and investigate their impact on the network throughput. The derived results are valid for various fading models and traffic patterns. Numerical examples are presented that illustrate the network performance.
{"title":"Performance analysis of underwater acoustic random access networks","authors":"Andrej Stefanov, M. Stojanovic","doi":"10.1109/RED.2012.6338414","DOIUrl":"https://doi.org/10.1109/RED.2012.6338414","url":null,"abstract":"We analyze the performance of underwater acoustic random access networks. The assumption is that the nodes are distributed in the plane according to a two dimensional Poisson point process. This is a suitable model for a network of bottom mounted nodes. The node-to-node channel is modeled based on an underwater acoustic propagation path loss and fading. We provide a statistical characterization of the network interference, by taking into account the acoustic propagation characteristics, and investigate their impact on the network throughput. The derived results are valid for various fading models and traffic patterns. Numerical examples are presented that illustrate the network performance.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125771685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338406
Y. Medvedeva
The Grassmanian Gq(n; k) is the set of all k-dimensional subspaces of vector space Fnq. The coding of elements of Grassmanian was considered in many papers [1]-[7], and has the application in network coding [8]-[19]. The enumerative coding of the elements of Grassmanian Gq(n; k) is association every element of the Grassmanian with its number, i. e. the number from [0;...; |Gq(n; k)| - 1]. The algorithm of enumerative coding of the elements of the Grassmanian, which has complexity O(nk(n - k) log n log log n) is presented in the paper [20]. We present the advanced algorithm of the enumerative coding of the elements of the Grassmanian, which has the complexity that does not exceed O(n2log2nloglog n). The advanced algorithm is based on the method of fast enumeration of combinatorial objects from the paper of B. Ryabko [21].
{"title":"Fast enumeration for Grassmannian space","authors":"Y. Medvedeva","doi":"10.1109/RED.2012.6338406","DOIUrl":"https://doi.org/10.1109/RED.2012.6338406","url":null,"abstract":"The Grassmanian Gq(n; k) is the set of all k-dimensional subspaces of vector space Fnq. The coding of elements of Grassmanian was considered in many papers [1]-[7], and has the application in network coding [8]-[19]. The enumerative coding of the elements of Grassmanian Gq(n; k) is association every element of the Grassmanian with its number, i. e. the number from [0;...; |Gq(n; k)| - 1]. The algorithm of enumerative coding of the elements of the Grassmanian, which has complexity O(nk(n - k) log n log log n) is presented in the paper [20]. We present the advanced algorithm of the enumerative coding of the elements of the Grassmanian, which has the complexity that does not exceed O(n2log2nloglog n). The advanced algorithm is based on the method of fast enumeration of combinatorial objects from the paper of B. Ryabko [21].","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131028325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338404
V. Lomakov
It is shown that for any prime p and any integer ℓ ≥ 1, there is a cyclic code of length p2(ℓ+1) - 1 and dimension pℓ+1(pℓ+1 - 2) over the finite field GF(p) whose minimum distance ≥ p + 2ℓ is greater than or equal to the BCH bound p + 2.
{"title":"On a class of cyclic codes whose minimum distance exceeds the BCH bound","authors":"V. Lomakov","doi":"10.1109/RED.2012.6338404","DOIUrl":"https://doi.org/10.1109/RED.2012.6338404","url":null,"abstract":"It is shown that for any prime p and any integer ℓ ≥ 1, there is a cyclic code of length p<sup>2(ℓ+1)</sup> - 1 and dimension p<sup>ℓ+1</sup>(p<sup>ℓ+1</sup> - 2) over the finite field GF(p) whose minimum distance ≥ p + 2ℓ is greater than or equal to the BCH bound p + 2.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133383940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338416
J. Yousafzai, Z. Cvetković, M. Ager, Peter Sollich
Automatic speech recognition (ASR) systems are yet to achieve the level of robustness inherent to speech recognition by the human auditory system. The primary goal of this paper is to argue that exploiting the redundancy in speech signals could be the key to solving the problem of the lack of robustness. This view is supported by our recent results on phoneme classification and recognition in the presence of noise which are surveyed in this paper.
{"title":"Redundancy in speech signals and robustness of automatic speech recognition","authors":"J. Yousafzai, Z. Cvetković, M. Ager, Peter Sollich","doi":"10.1109/RED.2012.6338416","DOIUrl":"https://doi.org/10.1109/RED.2012.6338416","url":null,"abstract":"Automatic speech recognition (ASR) systems are yet to achieve the level of robustness inherent to speech recognition by the human auditory system. The primary goal of this paper is to argue that exploiting the redundancy in speech signals could be the key to solving the problem of the lack of robustness. This view is supported by our recent results on phoneme classification and recognition in the presence of noise which are surveyed in this paper.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121107354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338398
S. Fedorenko
The Goertzel-Blahut algorithm for the discrete Fourier transform computation presented in the paper belongs to a class of semifast algorithms, but its modification is closely related to the fast Fourier transform algorithms.
{"title":"The Goertzel-Blahut algorithm is closely related to the fast fourier transform","authors":"S. Fedorenko","doi":"10.1109/RED.2012.6338398","DOIUrl":"https://doi.org/10.1109/RED.2012.6338398","url":null,"abstract":"The Goertzel-Blahut algorithm for the discrete Fourier transform computation presented in the paper belongs to a class of semifast algorithms, but its modification is closely related to the fast Fourier transform algorithms.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114158946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338413
V. Sidorenko, A. Wachter-Zeh, Di Chen
Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.
{"title":"On fast decoding of interleaved Gabidulin codes","authors":"V. Sidorenko, A. Wachter-Zeh, Di Chen","doi":"10.1109/RED.2012.6338413","DOIUrl":"https://doi.org/10.1109/RED.2012.6338413","url":null,"abstract":"Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L over L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m3logm) operations in the base field Fq.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133362709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338412
B. Ryabko, A. Fionov
We consider a notion of computer capacity as a novel approach to evaluation of computer performance. Computer capacity is based on the number of different tasks that can be executed in a given time. This characteristic does not depend on any particular task and is determined only by the computer architecture. It can be easily computed at the design stage and used for optimizing architectural decisions.
{"title":"Estimating the performance of computer systems through computer capacity","authors":"B. Ryabko, A. Fionov","doi":"10.1109/RED.2012.6338412","DOIUrl":"https://doi.org/10.1109/RED.2012.6338412","url":null,"abstract":"We consider a notion of computer capacity as a novel approach to evaluation of computer performance. Computer capacity is based on the number of different tasks that can be executed in a given time. This characteristic does not depend on any particular task and is determined only by the computer architecture. It can be easily computed at the design stage and used for optimizing architectural decisions.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116515226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-25DOI: 10.1109/RED.2012.6338415
A. Urivskiy
We consider a problem of finding codes over alphabets whose size s is not equal to the size of any finite field. We adopted an approach when a linear block code is taken over some finite field GF(q) such that q >; s. Then a subcode is being found such that all the code symbols of all its codewords belong to a subset of GF(q) of size s. Upper and lower bounds on the cardinality of the subset subcode are given. Also coding procedures are considered. Error detection and/or correction procedures are those of the parent code.
{"title":"On subset subcodes of linear codes","authors":"A. Urivskiy","doi":"10.1109/RED.2012.6338415","DOIUrl":"https://doi.org/10.1109/RED.2012.6338415","url":null,"abstract":"We consider a problem of finding codes over alphabets whose size s is not equal to the size of any finite field. We adopted an approach when a linear block code is taken over some finite field GF(q) such that q >; s. Then a subcode is being found such that all the code symbols of all its codewords belong to a subset of GF(q) of size s. Upper and lower bounds on the cardinality of the subset subcode are given. Also coding procedures are considered. Error detection and/or correction procedures are those of the parent code.","PeriodicalId":403644,"journal":{"name":"2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134640720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：