{"title":"Algebraic break of a chaos-based random number generator","authors":"Salih Ergun","doi":"10.1109/ICSPCS.2017.8270496","DOIUrl":"https://doi.org/10.1109/ICSPCS.2017.8270496","url":null,"abstract":"In this paper, algebraic break of a chaos-based random number generator (RNG) is introduced. An attack system is proposed to discover the security weaknesses of the chaos-based RNG. The convergence of the attack system has been proved using the master-slave synchronization scheme. Future evaluation of the RNG is achieved when the only information available is the structure of the RNG and a scalar time series observed from the chaotic oscillator. Simulation and numerical results confirming the feasibility of the attack system are given. It has been verified that the chaos phenomena can't be represented as the source of a true random number generator.","PeriodicalId":261348,"journal":{"name":"International Conference on Signal Processing and Communication Systems","volume":"365 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121408236","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}
{"title":"On the distributed binary consensus algorithm in wireless sensor networks","authors":"Abderrazak Abdaoui, T. El-Fouly","doi":"10.1109/ICSPCS.2013.6723980","DOIUrl":"https://doi.org/10.1109/ICSPCS.2013.6723980","url":null,"abstract":"We consider the binary consensus problem over the wireless sensor networks (WSN), where each node of the network initially observes one of two states and the aim of each node is to decide which one of the two states was held by the majority of nodes. In this paper we consider the averaging of a measurement in a WSN composed of N nodes.We evaluate the distributed binary consensus algorithm by deriving the average convergence time of the algorithm. Since this time has been evaluated theoretically for mathematical aspects [1], we complete this work by considering real life environment including packet loss phenomenon and automatic repeat request (ARQ) protocol used in real message transmissions. In addition we compare the new analytical results with those obtained by a hardware emulation of the same binary consensus algorithm under TinyOS and TOSSIM. In performance evaluation, we consider the analysis of the average convergence time for node states. In the simulations, we apply the distributed binary consensus algorithm for fully connected, ring, path, Erdos Reny random, and star-shaped topologies.","PeriodicalId":261348,"journal":{"name":"International Conference on Signal Processing and Communication Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121234257","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}