The concept of autonomous wireless sensor networks involves energy harvesting, as well as effective management of system resources. Public-key cryptography (PKC) offers the advantage of elegant key agreement schemes with which a secret key can be securely established over unsecure channels. In addition to solving the key management problem, the other major application of PKC is digital signatures, with which non-repudiation of messages exchanges can be achieved. The motivation for studying low-power and area efficient modular arithmetic algorithms comes from enabling public-key security for low-power devices that can perform under constrained environment like autonomous wireless sensor networks. This paper presents a cryptographic coprocessor tailored to the autonomous wireless sensor networks constraints. Such hardware circuit is aimed to support the implementation of different public-key cryptosystems based on modular arithmetic in GF(p) and GF(2m). Key components of the coprocessor are described as GEZEL models and can be easily transformed to VHDL and implemented in hardware.
Modular multiplication forms the basis of modular exponentiation which is the core operation of the RSA cryptosystem.
It is also present in many other cryptographic algorithms including those based on ECC and HECC. Hence, an efficient
implementation of PKC relies on efficient implementation of modular multiplication. The paper presents a survey of
most common algorithms for modular multiplication along with hardware architectures especially suitable for
cryptographic applications in energy constrained environments. The motivation for studying low-power and areaefficient
modular multiplication algorithms comes from enabling public-key security for ultra-low power devices that
can perform under constrained environments like wireless sensor networks. Serial architectures for GF(p) are analyzed
and presented. Finally proposed architectures are verified and compared according to the amount of power dissipated
throughout the operation.
As Air Traffic Control Systems move from a voice only environment to one in which clearances are issued via data link,
there is a risk that an unauthorized entity may attempt to masquerade as either the pilot or controller. In order to protect
against this and related attacks, air-ground communications must be secured. The challenge is to add security in an
environment in which bandwidth is limited. The Aeronautical Telecommunications Network (ATN) is an enabling
digital network communications technology that addresses capacity and efficiency issues associated with current
aeronautical voice communication systems. Equally important, the ATN facilitates migration to free flight, where direct
computer-to-computer communication will automate air traffic management, minimize controller and pilot workload,
and improve overall aircraft routing efficiency. Protecting ATN communications is critical since safety-of-flight is
seriously affected if an unauthorized entity, a hacker for example, is able to penetrate an otherwise reliable
communications system and accidentally or maliciously introduce erroneous information that jeopardizes the overall
safety and integrity of a given airspace. However, an ATN security implementation must address the challenges
associated with aircraft mobility, limited bandwidth communication channels, and uninterrupted operation across
organizational and geopolitical boundaries.
This paper provides a brief overview of the ATN, the ATN security concept, and
begins a basic introduction to the relevant security concepts of security threats, security services and security
mechanisms. Security mechanisms are further examined by presenting the fundamental building blocks of symmetric
encipherment, asymmetric encipherment, and hash functions. The second part of this paper presents the project of
cryptographiclly secure wireless communication between Unmanned Aerial Vehicles (UAV) and the ground station in
the ATM system, based on the ARM9 processor development kid and Embedded Linux operation system.
In this paper we present the State of The Art in Cryptographic Random Number Generators (RNG). We provide
analysis of every of the most popular types of RNGs such as linear generators (i.e. congruential, multiple recursive), non-linear generators (i.e. Quadratic, Blum-Blum-Shub) and cryptographic algorithms based (i.e. RSA generator, SHA-1 generator). Finally we choose solutions which are suitable to Distributed Measurement Systems (DMS) specific requirements according to cryptographic security, computational efficiency (throughput) and complexity of implementation (VHDL targeted at FPGA and ASIC devices). Strong asymmetry of computing power and memory capacity is taken into account in both software and hardware solutions.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.