01852nas a2200205   4500008004100000245007900041210006900120260000900189300001200198490000700210520118900217653001101406653002001417653001501437653002401452653001301476653002801489100001201517856011701529       2012                        eng d00aSERCID: A secure mechanism for data collection in wireless sensor networks0 aSERCID A secure mechanism for data collection in wireless sensor  c2012  a79 - 850 v103 aThe unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. An adversary can physically compromise a subset of sensor nodes in a wireless sensor network to eavesdrop information. Due to some intrinsic features of wireless sensor network, it is difficult to perform efficient intrusion detection against malicious nodes in such a resource-restricted environment. In this paper, we propose a novel secure mechanism, SERCID for wireless sensor networks. The mechanism consists of a key-based secure routing algorithm and a counter-based intrusion detection algorithm. The approach is able to protect the data collection in a wireless sensor network even if there are malicious nodes in the network. The major contribution of our work is that we present an original approach to defend wireless sensor networks against both tampering and packet-dropping attacks, for the first time. We provide a relatively simple but reliable approach to support secure data collection in wireless sensor networks. Compared with existing research efforts, the proposed approach is easy to be implemented and performed in resourceconstrained wireless sensor networks.10aAttack10aData collection10aEncryption10aIntrusion detection10aSecurity10aWireless sensor network1 aMao, Y.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866465185&partnerID=40&md5=ba314ed11d14004232b2fddcd4fa4ee801458nas a2200217   4500008004100000245008800041210006900129260000900198300001200207490000600219520075400225653001500979653001200994653001901006653002001025653002801045653001801073100001501091700001701106856011701123       2011                        eng d00aLTSC-128: Stream cipher based on the intractable Shortest Vector Problem in Lattice0 aLTSC128 Stream cipher based on the intractable Shortest Vector P  c2011  a27 - 320 v93 aLTSC-128 is a high secure stream cipher based on the hardness of the Shortest Vector Problem in Lattice space. The cipher is based on vectors multiplication over finite fieldo, wnhoetrerea these vectors are represented by polynomials to enhance the performance of keystream generation. The key size is 128 bits and there is no attack faster than exhaustive key search has been identified. The experimental results showed that the encryption rate of LTSC-128 is about 50Mbit/second. LTSC-128 cTipher co has additional feature that its performance can be inpcrroecaesdedure by applying multithreading technique on multi-core processors. The multithreaded version of LTSC-128 has achieved better encryption rate of 71Mbit/second on dual-core processor.10aEncryption10aLattice10aMultithreading10aNP-hard problem10aShortest Vector Problem10aStream cipher1 aSuwais, K.1 aSamsudin, A.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960657199&partnerID=40&md5=b4fe242766b77ba21be7e3f6815f31d7