9,207 research outputs found
A Pseudo DNA Cryptography Method
The DNA cryptography is a new and very promising direction in cryptography
research. DNA can be used in cryptography for storing and transmitting the
information, as well as for computation. Although in its primitive stage, DNA
cryptography is shown to be very effective. Currently, several DNA computing
algorithms are proposed for quite some cryptography, cryptanalysis and
steganography problems, and they are very powerful in these areas. However, the
use of the DNA as a means of cryptography has high tech lab requirements and
computational limitations, as well as the labor intensive extrapolation means
so far. These make the efficient use of DNA cryptography difficult in the
security world now. Therefore, more theoretical analysis should be performed
before its real applications.
In this project, We do not intended to utilize real DNA to perform the
cryptography process; rather, We will introduce a new cryptography method based
on central dogma of molecular biology. Since this method simulates some
critical processes in central dogma, it is a pseudo DNA cryptography method.
The theoretical analysis and experiments show this method to be efficient in
computation, storage and transmission; and it is very powerful against certain
attacks. Thus, this method can be of many uses in cryptography, such as an
enhancement insecurity and speed to the other cryptography methods. There are
also extensions and variations to this method, which have enhanced security,
effectiveness and applicability.Comment: A small work that quite some people asked abou
LPKI - A Lightweight Public Key Infrastructure for the Mobile Environments
The non-repudiation as an essential requirement of many applications can be
provided by the asymmetric key model. With the evolution of new applications
such as mobile commerce, it is essential to provide secure and efficient
solutions for the mobile environments. The traditional public key cryptography
involves huge computational costs and is not so suitable for the
resource-constrained platforms. The elliptic curve-based approaches as the
newer solutions require certain considerations that are not taken into account
in the traditional public key infrastructures. The main contribution of this
paper is to introduce a Lightweight Public Key Infrastructure (LPKI) for the
constrained platforms such as mobile phones. It takes advantages of elliptic
curve cryptography and signcryption to decrease the computational costs and
communication overheads, and adapting to the constraints. All the computational
costs of required validations can be eliminated from end-entities by
introduction of a validation authority to the introduced infrastructure and
delegating validations to such a component. LPKI is so suitable for mobile
environments and for applications such as mobile commerce where the security is
the great concern.Comment: 6 Pages, 6 Figure
Agonistic behavior of captive saltwater crocodile, crocodylus porosus in Kota Tinggi, Johor
Agonistic behavior in Crocodylus porosus is well known in the wild, but the available data regarding this behavior among the captive individuals especially in a farm setting is rather limited. Studying the aggressive behavior of C. porosus in captivity is important because the data obtained may contribute for conservation and the safety for handlers and visitors. Thus, this study focuses on C. porosus in captivity to describe systematically the agonistic behaviour of C. porosus in relation to feeding time, daytime or night and density per pool. This study was carried out for 35 days in two different ponds. The data was analysed using Pearson’s chi-square analysis to see the relationship between categorical factors. The study shows that C. porosus was more aggressive during daylight, feeding time and non-feeding time in breeding enclosure (Pond C, stock density =0.0369 crocodiles/m2) as compared to non-breeding pond (Pond B, stock density =0.3317 crocodiles/m2) where it is only aggressive during the nighttime. Pond C shows the higher domination in the value of aggression in feeding and non-feeding time where it is related to its function as breeding ground. Chi-square analysis shows that there is no significant difference between ponds (p=0.47, χ2= 2.541, df= 3), thus, there is no relationship between categorical factors. The aggressive behaviour of C. porosus is important for the farm management to evaluate the risk in future for the translocation process and conservation of C. porosus generally
Adding X-security to Carrel: security for agent-based healthcare applications
The high growth of Multi-Agent Systems (MAS) in Open Networks with initiatives such as Agentcities1 requires development in many different areas such as scalable and secure agent platforms, location services, directory services, and systems management. In our case we have focused our effort on security for agent systems. The driving force of this paper is provide a practical vision of how security mechanisms could be introduced for multi-agent applications. Our case study for this experiment is Carrel [9]: an Agent-based application in the Organ and Tissue transplant domain. The selection of this application is due to its characteristics as a real scenario and use of high-risk data for example, a study of the 21 most visited health-related web sites on the Internet discovered that personal information provided at many of the sites was being inadvertently leaked for unauthorized persons. These factors indicate to us that Carrel would be a suitable environment in order to test existing security safeguards. Furthermore, we believe that the experience gathered will be useful for other MAS. In order to achieve our purpose we describe the design, architecture and implementation of security elements on MAS for the Carrel System.Postprint (published version
EVALUATION OF CRYPTOGRAPHIC ALGORITHMS
This article represents a synthesis of the evaluation methods for cryptographic algorithms and of their efficiency within practical applications. It approaches also the main operations carried out in cryptanalysis and the main categories and methods of attack in order to clarify the differences between evaluation concept and crypto algorithm cracking.cryptology, cryptanalysis, evaluation and cracking cryptographic algorithms
Analysis of Parallel Montgomery Multiplication in CUDA
For a given level of security, elliptic curve cryptography (ECC) offers improved efficiency over classic public key implementations. Point multiplication is the most common operation in ECC and, consequently, any significant improvement in perfor- mance will likely require accelerating point multiplication. In ECC, the Montgomery algorithm is widely used for point multiplication. The primary purpose of this project is to implement and analyze a parallel implementation of the Montgomery algorithm as it is used in ECC. Specifically, the performance of CPU-based Montgomery multiplication and a GPU-based implementation in CUDA are compared
Authenticated tree parity machine key exchange
The synchronisation of Tree Parity Machines (TPMs), has proven to provide a
valuable alternative concept for secure symmetric key exchange. Yet, from a
cryptographer's point of view, authentication is at least as important as a
secure exchange of keys. Adding an authentication via hashing e.g. is
straightforward but with no relation to Neural Cryptography. We consequently
formulate an authenticated key exchange within this concept. Another
alternative, integrating a Zero-Knowledge protocol into the synchronisation, is
also presented. A Man-In-The-Middle attack and even all currently known
attacks, that are based on using identically structured TPMs and
synchronisation as well, can so be averted. This in turn has practical
consequences on using the trajectory in weight space. Both suggestions have the
advantage of not affecting the previously observed physics of this interacting
system at all.Comment: This work directly relates to cond-mat/0202112 (see also
http://arxiv.org/find/cond-mat/1/au:+Kinzel/0/1/0/all/0/1
- …