Abstract: Wireless networks are built upon the open shared
medium which makes easy for attackers to conduct malicious
activities. Jamming is one of the most serious security threats to
information economy and it must be dealt efficiently. Jammer
prevents legitimate data to reach the receiver side and also it
seriously degrades the network performance. The objective of this
paper is to provide a general overview of jamming in wireless
network. It covers relevant works, different jamming techniques,
various types of jammers and typical prevention techniques.
Challenges associated with comparing several anti-jamming
techniques are also highlighted.
Abstract: The McEliece cryptosystem is an asymmetric type of
cryptography based on error correction code. The classical McEliece
used irreducible binary Goppa code which considered unbreakable
until now especially with parameter [1024, 524, and 101], but it is
suffering from large public key matrix which leads to be difficult to
be used practically. In this work Irreducible and Separable Goppa
codes have been introduced. The Irreducible and Separable Goppa
codes used are with flexible parameters and dynamic error vectors. A
Comparison between Separable and Irreducible Goppa code in
McEliece Cryptosystem has been done. For encryption stage, to get
better result for comparison, two types of testing have been chosen;
in the first one the random message is constant while the parameters
of Goppa code have been changed. But for the second test, the
parameters of Goppa code are constant (m=8 and t=10) while the
random message have been changed. The results show that the time
needed to calculate parity check matrix in separable are higher than
the one for irreducible McEliece cryptosystem, which is considered
expected results due to calculate extra parity check matrix in
decryption process for g2(z) in separable type, and the time needed to
execute error locator in decryption stage in separable type is better
than the time needed to calculate it in irreducible type. The proposed
implementation has been done by Visual studio C#.
Abstract: Elliptic curve discrete logarithm problem(ECDLP) is
one of problems on which the security of pairing-based cryptography
is based. This paper considers Pollard’s rho method to evaluate
the security of ECDLP on Barreto-Naehrig(BN) curve that is an
efficient pairing-friendly curve. Some techniques are proposed to
make the rho method efficient. Especially, the group structure on
BN curve, distinguished point method, and Montgomery trick are
well-known techniques. This paper applies these techniques and
shows its optimization. According to the experimental results for
which a large-scale parallel system with MySQL is applied, 94-bit
ECDLP was solved about 28 hours by parallelizing 71 computers.
Abstract: Nowadays, cloud environments are becoming a need for companies, this new technology gives the opportunities to access to the data anywhere and anytime. It also provides an optimized and secured access to the resources and gives more security for the data which is stored in the platform. However, some companies do not trust Cloud providers, they think that providers can access and modify some confidential data such as bank accounts. Many works have been done in this context, they conclude that encryption methods realized by providers ensure the confidentiality, but, they forgot that Cloud providers can decrypt the confidential resources. The best solution here is to apply some operations on the data before sending them to the provider Cloud in the objective to make them unreadable. The principal idea is to allow user how it can protect his data with his own methods. In this paper, we are going to demonstrate our approach and prove that is more efficient in term of execution time than some existing methods. This work aims at enhancing the quality of service of providers and ensuring the trust of the customers.
Abstract: In this paper, we will give a cryptographic application
over the integral closure O_Lof sextic extension L, namely L is an
extension of Q of degree 6 in the form Q(a,b), which is a rational
quadratic and monogenic extension over a pure monogenic cubic
subfield K generated by a who is a root of monic irreducible
polynomial of degree 2 andb is a root of irreducible polynomial of
degree 3.
Abstract: In this article we will study the elliptic curve defined
over the ring An and we define the mathematical operations of ECC,
which provides a high security and advantage for wireless
applications compared to other asymmetric key cryptosystem.
Abstract: Generating random numbers are mainly used to create
secret keys or random sequences. It can be carried out by various
techniques. In this paper we present a very simple and efficient
pseudo random number generator (PRNG) based on chaotic maps
and S-Box tables. This technique adopted two main operations one to
generate chaotic values using two logistic maps and the second to
transform them into binary words using random S-Box tables.
The simulation analysis indicates that our PRNG possessing
excellent statistical and cryptographic properties.
Abstract: Image or document encryption is needed through egovernment
data base. Really in this paper we introduce two matrices
images, one is the public, and the second is the secret (original). The
analyses of each matrix is achieved using the transformation of
singular values decomposition. So each matrix is transformed or
analyzed to three matrices say row orthogonal basis, column
orthogonal basis, and spectral diagonal basis. Product of the two row
basis is calculated. Similarly the product of the two column basis is
achieved. Finally we transform or save the files of public, row
product and column product. In decryption stage, the original image
is deduced by mutual method of the three public files.
Abstract: Shifted polynomial basis (SPB) is a variation of
polynomial basis representation. SPB has potential for efficient
bit level and digi -level implementations of multiplication over
binary extension fields with subquadratic space complexity. For
efficient implementation of pairing computation with large finite
fields, this paper presents a new SPB multiplication algorithm based
on Karatsuba schemes, and used that to derive a novel scalable
multiplier architecture. Analytical results show that the proposed
multiplier provides a trade-off between space and time complexities.
Our proposed multiplier is modular, regular, and suitable for very
large scale integration (VLSI) implementations. It involves less
area complexity compared to the multipliers based on traditional
decomposition methods. It is therefore, more suitable for efficient
hardware implementation of pairing based cryptography and elliptic
curve cryptography (ECC) in constraint driven applications.
Abstract: An aggregate signature scheme can aggregate n signatures on n distinct messages from n distinct signers into a single signature. Thus, n verification equations can be reduced to one. So the aggregate signature adapts to Mobile Ad hoc Network (MANET). In this paper, we propose an efficient ID-based aggregate signature scheme with constant pairing computations. Compared with the existing ID-based aggregate signature scheme, this scheme greatly improves the efficiency of signature communication and verification. In addition, in this work, we apply our ID-based aggregate sig- nature to authenticated routing protocol to present a secure routing scheme. Our scheme not only provides sound authentication and a secure routing protocol in ad hoc networks, but also meets the nature of MANET.
Abstract: Considering the complexities involved in Cloud computing, there are still plenty of issues that affect the privacy of data in cloud environment. Unless these problems get solved, we think that the problem of preserving privacy in cloud databases is still open. In tokenization and homomorphic cryptography based solutions for privacy preserving cloud database querying, there is possibility that by colluding with service provider adversary may run brute force attacks that will reveal the attribute values.
In this paper we propose a solution by defining the variant of K –means clustering algorithm that effectively detects such brute force attacks and enhances privacy of cloud database querying by preventing this attacks.
Abstract: MARS is a shared-key (symmetric) block cipher algorithm supporting 128-bit block size and a variable key size of between 128 and 448 bits. MARS has a several rounds of cryptographic core that is designed to take advantage of the powerful results for improving security/performance tradeoff over existing ciphers. In this work, a new function added to improve the ciphering process it is called, Meta-Morphic function. This function use XOR, Rotating, Inverting and No-Operation logical operations before and after encryption process. The aim of these operations is to improve MARS cipher process and makes a high confusion criterion for the Ciphertext.
Abstract: Cloud computing technology is very useful in present day to day life, it uses the internet and the central remote servers to provide and maintain data as well as applications. Such applications in turn can be used by the end users via the cloud communications without any installation. Moreover, the end users’ data files can be accessed and manipulated from any other computer using the internet services. Despite the flexibility of data and application accessing and usage that cloud computing environments provide, there are many questions still coming up on how to gain a trusted environment that protect data and applications in clouds from hackers and intruders. This paper surveys the “keys generation and management” mechanism and encryption/decryption algorithms used in cloud computing environments, we proposed new security architecture for cloud computing environment that considers the various security gaps as much as possible. A new cryptographic environment that implements quantum mechanics in order to gain more trusted with less computation cloud communications is given.
Abstract: A mobile ad hoc network (MANET) is a self configuring network, without any centralized control. The topology of this network is not always defined. The main objective of this paper is to introduce the fundamental concepts of MANETs to the researchers and practitioners, who are involved in the work in the area of modeling and simulation of MANETs. This paper begins with an overview of mobile ad hoc networks. Then it proceeds with the overview of routing protocols used in the MANETS, their properties and simulation methods. A brief tabular comparison between the routing protocols is also given in this paper considering different routing protocol parameters. This paper introduces a new routing scheme developed by the use of evolutionary algorithms (EA) and analytical hierarchy process (AHP) which will be used for getting the optimized output of MANET. In this paper cryptographic technique, ceaser cipher is also employed for making the optimized route secure.
Abstract: The aim of this paper is to review some of standard fact on Miura curves. We give some easy theorem in number theory to define Miura curves, then we present a new implementation of Arita algorithm for Miura curves.
Abstract: This document shows a software that shows different chaotic generator, as continuous as discrete time. The software gives the option for obtain the different signals, using different parameters and initial condition value. The program shows then critical parameter for each model. All theses models are capable of encrypter information, this software show it too.
Abstract: Finding suitable non-supersingular elliptic curves for
pairing-based cryptosystems becomes an important issue for the
modern public-key cryptography after the proposition of id-based
encryption scheme and short signature scheme. In previous work
different algorithms have been proposed for finding such elliptic
curves when embedding degree k ∈ {3, 4, 6} and cofactor h ∈ {1, 2, 3,
4, 5}. In this paper a new method is presented to find more
non-supersingular elliptic curves for pairing-based cryptosystems with
general embedding degree k and large values of cofactor h. In
addition, some effective parameters of these non-supersingular elliptic
curves are provided in this paper.
Abstract: Electronic banking must be secure and easy to use and
many banks heavily advertise an apparent of 100% secure system
which is contestable in many points. In this work, an alternative
approach to the design of e-banking system, through a new solution
for user authentication and security with digital certificate called
LumaCert is introduced. The certificate applies new algorithm for
asymmetric encryption by utilizing two mathematical operators
called Pentors and UltraPentors. The public and private key in this
algorithm represent a quadruple of parameters which are directly
dependent from the above mentioned operators. The strength of the
algorithm resides in the inability to find the respective Pentor and
UltraPentor operator from the mentioned parameters.
Abstract: In this paper a Public Key Cryptosystem is proposed
using the number theoretic transforms (NTT) over a ring of integer
modulo a composite number. The key agreement is similar to
ElGamal public key algorithm. The security of the system is based on
solution of multivariate linear congruence equations and discrete
logarithm problem. In the proposed cryptosystem only fixed numbers
of multiplications are carried out (constant complexity) and hence the
encryption and decryption can be done easily. At the same time, it is
very difficult to attack the cryptosystem, since the cipher text is a
sequence of integers which are interrelated. The system provides
authentication also. Using Mathematica version 5.0 the proposed
algorithm is justified with a numerical example.
Abstract: The growth of open networks created the interest to
commercialise it. The establishment of an electronic business
mechanism must be accompanied by a digital – electronic payment
system to transfer the value of transactions. Financial organizations
are requested to offer a secure e-payment synthesis with equivalent
level of security served in conventional paper-based payment
transactions. PKI, which is functioning as a chain of trust in security
architecture, can enable security services of cryptography to epayments,
in order to take advantage of the wider base either of
customer or of trading partners and the reduction of cost transaction
achieved by the use of Internet channels. The paper addresses the
possibilities and the implementation suggestions of PKI in relevance
to electronic payments by suggesting a framework that should be
followed.