A hierarchical localization scheme for large scale underwater wireless sensor networks

In this paper, we study the localization problem in large-scale Underwater Wireless Sensor Networks (UWSNs). Unlike in the terrestrial positioning, the global positioning system (GPS) can not work efficiently underwater. The limited bandwidth, the severely impaired channel and the cost of underwater equipment all makes the localization problem very challenging. Most current localization schemes are not well suitable for deep underwater environment. We propose a hierarchical localization scheme to address the challenging problems. The new scheme mainly consists of four types of nodes, which are surface buoys, Detachable Elevator Transceivers (DETs), anchor nodes and ordinary nodes. Surface buoy is assumed to be equipped with GPS on the water surface. A DET is attached to a surface buoy and can rise and down to broadcast its position. The anchor nodes can compute their positions based on the position information from the DETs and the measurements of distance to the DETs. The hierarchical localization scheme is scalable, and can be used to make balances on the cost and localization accuracy. Initial simulation results show the advantages of our proposed scheme. © 2009 IEEE.

An area localization scheme for large scale underwater wireless sensor networks

In this paper, we study an area localization problem in large scale Underwater Wireless Sensor Networks (UWSNs). The limited bandwidth, the severely impaired channel and the cost of underwater equipment all makes the underwater localization problem very challenging. Exact localization is very difficult for UWSNs in deep underwater environment. We propose a Mobile DETs based efficient 3D multi-power Area Localization Scheme (3D-MALS) to address the challenging problem. In the proposed scheme, the ideas of 2D multi-power Area Localization Scheme(2D-ALS) [6] and utilizing Detachable Elevator Transceiver (DET) are used to achieve the simplicity, location accuracy, scalability and low cost performances. The DET can rise and down to broadcast its position. And it is assumed that all the underwater nodes underwater have pressure sensors and know their z coordinates. The simulation results show that our proposed scheme is very efficient. © 2009 IEEE.

An adaptive IEEE 802.15.4 data transmission scheme for smart grid applications

IEEE 802.15.4 networks (also known as ZigBee networks) has the features of low data rate and low power consumption. In this paper we propose an adaptive data transmission scheme which is based on CSMA/CA access control scheme, for applications which may have heavy traffic loads such as smart grids. In the proposed scheme, the personal area network (PAN) coordinator will adaptively broadcast a frame length threshold, which is used by the sensors to make decision whether a data frame should be transmitted directly to the target destinations, or follow a short data request frame. If the data frame is long and prone to collision, use of a short data request frame can efficiently reduce the costs of the potential collision on the energy and bandwidth. Simulation results demonstrate the effectiveness of the proposed scheme with largely improve bandwidth and power efficiency. © 2011 Springer-Verlag.

Statistical distribution, host for encrypted information

The statistical distribution, when determined from an incomplete set of constraints, is shown to be suitable as host for encrypted information. We design an encoding/decoding scheme to embed such a distribution with hidden information. The encryption security is based on the extreme instability of the encoding procedure. The essential feature of the proposed system lies in the fact that the key for retrieving the code is generated by random perturbations of very small value. The security of the proposed encryption relies on the security to interchange the secret key. Hence, it appears as a good complement to the quantum key distribution protocol. © 2005 Elsevier B.V. All rights reserved.

Genetic Algorithm for Finding the Key’s Length and Cryptanalysis of the Permutation Cipher

In this article we discuss a possibility to use genetic algorithms in cryptanalysis. We developed and described the genetic algorithm for finding the secret key of a block permutation cipher. In this case key is a permutation of some first natural numbers. Our algorithm finds the exact key’s length and the key with controlled accuracy. Evaluation of conducted experiment’s results shows that the almost automatic cryptanalysis is possible.

On Graph-Based Cryptography and Symbolic Computations

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large girth and their cryptographical applications. It contains new explicit algebraic constructions of in finite families of such graphs. We show that they can be used for the implementation of secure and very fast symmetric encryption algorithms. The symbolic computations technique allow us to create a public key mode for the encryption scheme based on algebraic graphs.

Analysis of Security in Archiving

Some basic types of archiving programs are described in the paper in addition to their advantages and disadvantages with respect to the analysis of security in archiving. Analysis and appraisal are performed on the results obtained during the described experiments.

Key Agreement Protocol (KAP) Based on Matrix Power Function

* Work is partially supported by the Lithuanian State Science and Studies Foundation.

Matrix Power S-box Analysis

* Work supported by the Lithuanian State Science and Studies Foundation.

Key Agreement Protocol Using Elliptic Curve Matrix Power Function

* Work is partially supported by the Lithuanian State Science and Studies Foundation.

Asymmetric Cipher Protocol Using Decomposition Problem

The asymmetric cipher protocol based on decomposition problem in matrix semiring M over semiring of natural numbers N is presented. The security parameters are defined and preliminary security analysis is presented.

Improved Cryptoanalysis of the Self-shrinking P-adic Cryptographic Generator

The Self-shrinking p-adic cryptographic generator (SSPCG) is a fast software stream cipher. Improved cryptoanalysis of the SSPCG is introduced. This cryptoanalysis makes more precise the length of the period of the generator. The linear complexity and the cryptography resistance against most recently used attacks are invesigated. Then we discuss how such attacks can be avoided. The results show that the sequence generated by a SSPCG has a large period, large linear complexity and is stable against the cryptographic attacks. This gives the reason to consider the SSPSG as suitable for critical cryptographic applications in stream cipher encryption algorithms.

CLAE to move to online format

Editorial: The 2015 BCLA annual conference was another fantastic affair. It was the first time the conference was held in the beautiful city of Liverpool. The venue was great and the programme was excellent. The venue overlooked the River Mersey and many of the hotels were local boutique hotels. I stayed in one which was formerly the offices of White Star Liners—where the RMS Titanic was originally registered. The hotel decor was consistent with its historic significance. The BCLA gala dinner was held in the hugely impressive Anglican Cathedral with entertainment from a Beatles tribute band. That will certainly be a hard act to follow at the next conference in 2017. Brian Tompkins took the reigns as the new BCLA president. Professor Fiona Stapleton was the recipient of the BCLA Gold Medal Award. The winner of the poster competition was Dorota Szczesna-Iskander with a poster entitled ‘Dry Contact lens poor wettability and visual performance’. Second place was Renee Reeder with her poster entitled ‘Abnormal Rosacea as a differential diagnosis in corneal scarring’. And third place was Maria Jesus Gonzalez-Garcia with her poster entitled ‘Dry Effect of the Environmental Conditions on Tear Inflammatory Mediators Concentration in Contact Lens Wearers’. The photographic competition winner was Professor Wolfgang Sickenberger from Jena in Germany. The Editorial Panel of CLAE met at the BCLA conference for their first biannual meeting. The journal metrics were discussed. In terms of number of submissions of new papers CLAE seems to have plateaued after seeing a rapid growth in the number of submissions over the last few years. The increase over the last few years could be attributed to the fact that CLAE was awarded an impact factor for the first time in 2012. This year it seems that impact factors across nearly all ophthalmic related journals has dropped. This could in part be due to the fact that last year was a ‘Research Exercise Framework (REF) year for UK universities, where they are judged on quality of their research output. The next REF is in 2020 so we may see changes nearing that time. Looking at article downloads, there seems to be a continued rise in figures. Currently CLAE attracts around 85,000 downloads per year (this is an increase of around 10,000 per year for the last few years) and the 2015 prediction is 120,000! With this in mind and with other contributing factors too, the BCLA has decided to move to online delivery of CLAE to its members starting from issue 5 of 2015. Some members do like to flick through the pages of a hard copy of the journal so members will still have the option of receiving a hard copy through the post but the default journal delivery method will now be online. The BCLA office will send various alerts and content details to members email addresses. To access CLAE online you will need to log in via the BCLA web page, currently you then click on ‘Resources’ and then under ‘Free and Discounted Publications’ you will see CLAE. This actually takes you to CLAE’s own webpage (www.contactlensjournal.com) but you need to log in via the BCLA web page. The BCLA plans to change these weblinks so that from the BCLA web page you can link to the journal website much more easily and you have the choice of going directly into the general website for CLAE or straight to the current issue. In 2016 you will see an even easier way of accessing CLAE online as the BCLA will launch a CLAE application for mobile devices where the journal can be downloaded as a ‘flick-book’. This is a great way of bringing CLAE into the modern era where people access their information in newer ways. For many the BCLA conference was part of a very busy conference week as it was preceded by the International Association of Contact Lens Educators’ (IACLE) Third World Congress, held in Manchester on the 4 days before the BCLA conference. The first and second IACE World Congresses were held in Waterloo, Canada in 1994 and 2000 respectively and hosted by Professor Des Fonn. Professor Fonn was the recipient of the first ever IACLE lifetime achievement award. The Third IACLE World Congress saw more than 100 contact lens educators and industry representatives from around 30 countries gather in the UK for the four-day event, hosted by The University of Manchester. Delegates gained hands-on experience of innovations in teaching, such as learning delivery systems, the use of iPads in the classroom and for creating ePub content, and augmented and virtual reality technologies. IACLE members around the world also took part via a live online broadcast. The Third IACLE World Congress was made possible by the generous support of Sponsors Alcon, CooperVision and Johnson & Johnson Vision Care., for more information look at the IACLE web page (www.iacle.org).

Long-range, high bit-rate secure key distribution link utilizing Raman Ultra-long fiber laser (UFL)

The distribution of the secret key is the weakest link of many data encryption systems. Quantum key distribution (QKD) schemes provide attractive solutions [1], however their implementation remains challenging and their range and bit-rate are limited. Moreover, practical QKD systems, employ real-life components and are, therefore, vulnerable to diverse attack schemes [2]. Ultra-Long fiber lasers (UFLs) have been drawing much attention recently because of their fundamentally different properties compared to conventional lasers as well as their unique applications [3]. Here, we demonstrate a 100Bps, practically secure key distribution, over a 500km link, employing Raman gain UFL. Fig. 1(a) depicts a schematic of the UFL system. Each user has an identical set of two wavelength selective mirrors centered at l0 and l 1. In order to exchange a key-bit, each user independently choose one of these mirrors and introduces it as a laser reflector at their end. If both users choose identical mirrors, a clear signal develops and the bits in these cases are discarded. However if they choose complementary mirrors, (1, 0 or 0, 1 states), the UFL remains below lasing threshold and no signal evolves. In these cases, an eavesdropper can only detect noise and is unable to determine the mirror choice of the users, where the choice of mirrors represent a single key bit (e.g. Alice's choice of mirror is the key-bit). These bits are kept and added to the key. The absence of signal in the secure states faxilitates fast measurements to distinguish between the non-secure and the secure states and to determine the key-bit in the later case, Sequentially reapeating the single bit exchange protocol generate the entire keys of any desirable length. © 2013 IEEE.

Plaintext Recovery in DES-like Cryptosystems Based on S-boxes with Embedded Parity Check

We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.