Real-time and interactive attacks on DNP3 critical infrastructure using Scapy

The Distributed Network Protocol v3.0 (DNP3) is one of the most widely used protocols, to control national infrastructure. Widely used interactive packet manipulation tools, such as Scapy, have not yet been augmented to parse and create DNP3 frames (Biondi 2014). In this paper we extend Scapy to include DNP3, thus allowing us to perform attacks on DNP3 in real-time. Our contribution builds on East et al. (2009), who proposed a range of possible attacks on DNP3. We implement several of these attacks to validate our DNP3 extension to Scapy, then executed the attacks on real world equipment. We present our results, showing that many of these theoretical attacks would be unsuccessful in an Ethernet-based network.

Desynchronization and Traceability Attacks on RIPTA-DA Protocol

Recently Gao et al. proposed a lightweight RFID mutual authentication protocol [3] to resist against intermittent position trace attacks and desynchronization attacks and called it RIPTA-DA. They also verified their protocol’s security by data reduction method with the learning parity with noise (LPN) and also formally verified the functionality of the proposed scheme by Colored Petri Nets. In this paper, we investigate RIPTA-DA’s security. We present an efficient secret disclosure attack against the protocol which can be used to mount both de-synchronization and traceability attacks against the protocol. Thus our attacks show that RIPTA-DA protocol is not a RIPTA-DA.

Traditional and geometric morphometrics detect morphological variation of lower pharyngeal jaw inCoris julis(Teleostei, Labridae)

In the present study, variation in the morphology of the lower pharyngeal element between two Sicilian populations of the rainbow wrasse Coris julis has been explored by the means of traditional morphometrics for size and geometric morphometrics for shape. Despite close geographical distance and probable high genetic flow between the populations, statistically significant differences have been found both for size and shape. In fact, one population shows a larger lower pharyngeal element that has a larger central tooth. Compared to the other population, this population also has medially enlarged lower pharyngeal jaws with a more pronounced convexity of the medial-posterior margin. The results are discussed in the light of a possible more pronounced durophagy of this population.

Bat species comparisons based on external morphology: A test of traditional versus geometric morphometric approaches

External morphology is commonly used to identify bats as well as to investigate flight and foraging behavior, typically relying on simple length and area measures or ratios. However, geometric morphometrics is increasingly used in the biological sciences to analyse variation in shape and discriminate among species and populations. Here we compare the ability of traditional versus geometric morphometric methods in discriminating between closely related bat species – in this case European horseshoe bats (Rhinolophidae, Chiroptera) – based on morphology of the wing, body and tail. In addition to comparing morphometric methods, we used geometric morphometrics to detect interspecies differences as shape changes. Geometric morphometrics yielded improved species discrimination relative to traditional methods. The predicted shape for the variation along the between group principal components revealed that the largest differences between species lay in the extent to which the wing reaches in the direction of the head. This strong trend in interspecific shape variation is associated with size, which we interpret as an evolutionary allometry pattern.

A framework for generating realistic traffic for distributed denial-of-service attacks and flash events

An intrinsic challenge associated with evaluating proposed techniques for detecting Distributed Denial-of-Service (DDoS) attacks and distinguishing them from Flash Events (FEs) is the extreme scarcity of publicly available real-word traffic traces. Those available are either heavily anonymised or too old to accurately reflect the current trends in DDoS attacks and FEs. This paper proposes a traffic generation and testbed framework for synthetically generating different types of realistic DDoS attacks, FEs and other benign traffic traces, and monitoring their effects on the target. Using only modest hardware resources, the proposed framework, consisting of a customised software traffic generator, ‘Botloader’, is capable of generating a configurable mix of two-way traffic, for emulating either large-scale DDoS attacks, FEs or benign traffic traces that are experimentally reproducible. Botloader uses IP-aliasing, a well-known technique available on most computing platforms, to create thousands of interactive UDP/TCP endpoints on a single computer, each bound to a unique IP-address, to emulate large numbers of simultaneous attackers or benign clients.

Algebraic and geometric intersection numbers for free groups

We show that the algebraic intersection number of Scott and Swarup for splittings of free groups Coincides With the geometric intersection number for the sphere complex of the connected sum of copies of S-2 x S-1. (C) 2009 Elsevier B.V. All rights reserved.

GEODERM: geometric shape design system using an entity-relationship model

GEODERM, a microcomputer-based solid modeller, which incorporates the parametric object model, is discussed. The entity-relationship model, which is used to describe the conceptual schema of the geometric database, is also presented. Three of the four modules of GEODERM, which have been implemented are described in some detail. They are the Solid Definition Language (SDL), the Solid Manipulation Language (SML) and the User-System Interface.

Implications of geometric plasticity for maximizing photosynthesis in branching corals

Reef-building corals are an example of plastic photosynthetic organisms that occupy environments of high spatiotemporal variations in incident irradiance. Many phototrophs use a range of photoacclimatory mechanisms to optimize light levels reaching the photosynthetic units within the cells. In this study, we set out to determine whether phenotypic plasticity in branching corals across light habitats optimizes potential light utilization and photosynthesis. In order to do this, we mapped incident light levels across coral surfaces in branching corals and measured the photosynthetic capacity across various within-colony surfaces. Based on the field data and modelled frequency distribution of within-colony surface light levels, our results show that branching corals are substantially self-shaded at both 5 and 18 m, and the modal light level for the within-colony surface is 50 mu mol photons m(-2) s(-1). Light profiles across different locations showed that the lowest attenuation at both depths was found on the inner surface of the outermost branches, while the most self-shading surface was on the bottom side of these branches. In contrast, vertically extended branches in the central part of the colony showed no differences between the sides of branches. The photosynthetic activity at these coral surfaces confirmed that the outermost branches had the greatest change in sun- and shade-adapted surfaces; the inner surfaces had a 50 % greater relative maximum electron transport rate compared to the outer side of the outermost branches. This was further confirmed by sensitivity analysis, showing that branch position was the most influential parameter in estimating whole-colony relative electron transport rate (rETR). As a whole, shallow colonies have double the photosynthetic capacity compared to deep colonies. In terms of phenotypic plasticity potentially optimizing photosynthetic capacity, we found that at 18 m, the present coral colony morphology increased the whole-colony rETR, while at 5 m, the colony morphology decreased potential light utilization and photosynthetic output. This result of potential energy acquisition being underutilized in shallow, highly lit waters due to the shallow type morphology present may represent a trade-off between optimizing light capture and reducing light damage, as this type morphology can perhaps decrease long-term costs of and effect of photoinhibition. This may be an important strategy as opposed to adopting a type morphology, which results in an overall higher energetic acquisition. Conversely, it could also be that maximizing light utilization and potential photosynthetic output is more important in low-light habitats for Acropora humilis.

Forgery attacks on ++AE authenticated encryption mode

In this paper, we analyse a block cipher mode of operation submitted in 2014 to the cryptographic competition for authenticated encryption (CAESAR). This mode is designed by Recacha and called ++AE (plus-plus-ae). We propose a chosen plaintext forgery attack on ++AE that requires only a single chosen message query to allow an attacker to construct multiple forged messages. Our attack is deterministic and guaranteed to pass ++AE integrity check. We demonstrate the forgery attack using 128-bit AES as the underlying block cipher. Hence, ++AE is insecure as an authenticated encryption mode of operation.

Using Mathematical Morphology for Geometric Music Retrieval

The usual task in music information retrieval (MIR) is to find occurrences of a monophonic query pattern within a music database, which can contain both monophonic and polyphonic content. The so-called query-by-humming systems are a famous instance of content-based MIR. In such a system, the user's hummed query is converted into symbolic form to perform search operations in a similarly encoded database. The symbolic representation (e.g., textual, MIDI or vector data) is typically a quantized and simplified version of the sampled audio data, yielding to faster search algorithms and space requirements that can be met in real-life situations. In this thesis, we investigate geometric approaches to MIR. We first study some musicological properties often needed in MIR algorithms, and then give a literature review on traditional (e.g., string-matching-based) MIR algorithms and novel techniques based on geometry. We also introduce some concepts from digital image processing, namely the mathematical morphology, which we will use to develop and implement four algorithms for geometric music retrieval. The symbolic representation in the case of our algorithms is a binary 2-D image. We use various morphological pre- and post-processing operations on the query and the database images to perform template matching / pattern recognition for the images. The algorithms are basically extensions to classic image correlation and hit-or-miss transformation techniques used widely in template matching applications. They aim to be a future extension to the retrieval engine of C-BRAHMS, which is a research project of the Department of Computer Science at University of Helsinki.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

Shape effect on optimal geometric conditions in surface aeration systems

The performance of surface aeration systems, among other key design variables, depends upon the geometric parameters of the aeration tank. Efficient performance and scale up or scale down of the experimental results of an aeration ystem requires optimal geometric conditions. Optimal conditions refer to the conditions of maximum oxygen transfer rate, which assists in scaling up or down the system for ommercial utilization. The present work investigates the effect of an aeration tank's shape (unbaffled circular, baffled circular and unbaffled square) on oxygen transfer. Present results demonstrate that there is no effect of shape on the optimal geometric conditions for rotor position and rotor dimensions. This experimentation shows that circular tanks (baffled or unbaffled) do not have optimal geometric conditions for liquid transfer, whereas the square cross-section tank shows a unique geometric shape to optimize oxygen transfer.

A geometric approach for determining inner and exterior boundaries of workspaces of planar manipulators

In this paper a method to determine the internal and external boundaries of planar workspaces, represented with an ordered set of points, is presented. The sequence of points are grouped and can be interpreted to form a sequence of curves. Three successive curves are used for determining the instantaneous center of rotation for the second one of them. The two extremal points on the curve with respect to the instantaneous center are recognized as singular points. The chronological ordering of these singular points is used to generate the two envelope curves, which are potentially intersecting. Methods have been presented in the paper for the determination of the workspace boundary from the envelope curves. Strategies to deal with the manipulators with joint limits and various degenerate situations have also been discussed. The computational steps being completely geometric, the method does not require the knowledge about the manipulator's kinematics. Hence, it can be used for the workspace of arbitrary planar manipulators. A number of illustrative examples demonstrate the efficacy of the proposed method.

A geometric approach to stationary defect solutions in one space dimension

In this manuscript, we consider the impact of a small jump-type spatial heterogeneity on the existence of stationary localized patterns in a system of partial dierential equations in one spatial dimension...