research paper and project in cryptography-14

An Energy-Efficient Access Control Scheme for Wireless Sensor Networks based on Elliptic Curve Cryptography
S Lee, I Butun, M Khalid , of Communications and , 2009 ,
Abstract: For many mission-critical related wireless sensor net-work applications such as
military and homeland security, user’s access restriction is necessary to be enforced by
access control mechanisms for different access rights. Public key-based access control 

Lightweight cryptography and RFID: tackling the hidden overheads
A Poschmann, M Robshaw, F Vater ,Information, Security and , 2010 ,Springer
The field of lightweight cryptography has developed significantly over recent years and
many impressive implementation results have been published. However these results are
often concerned with a core computation and when it comes to a real implementation 

Malicious cryptography reloaded
É Filiol ,Proceedings of the CanSecWest conference, 2008 ,
Trojan. Win32. Gpcode Versions a, b and e: polynomial key changed each round on one
byte (!) new key=(key* scale mod 255)+ base Version ac: 1st use of asymmetric encryption
RSA with a 56 bits key (!!) And since 56 bits is too easy, modulus are in the binary (!!!) 

Construction of an elliptic curve over finite fields to combine with convolutional code forcryptography
B Ontiveros, I Soto , CIRCUITS DEVICES AND , 2006 ,
Abstract: The construction of an efficient cryptographic system, based on the combination of
the ElGamal elliptic curve algorithm and convolutional codes using the Viterbi decoding
algorithm over the Gaussian channel, is proposed. The originality is based on the 

ALGSICS—combining physics and cryptography to enhance security and privacy in RFID systems
N Bird, C Conrado, J Guajardo, S Maubach ,Security and Privacy in , 2007 ,Springer
In this paper, we introduce several new mechanisms that are cheap to implement or
integrate into RFID tags and that at the same time enhance their security and privacy
properties. Our aim is to provide solutions that make use of existing (or expected) 

Securing Cover-File Without Limitation of Hidden Data Size Using Computation BetweenCryptography and Steganography
AA Zaidan, F Othman, BB Zaidan, RZ Raji ,Proceedings of the , 2009 ,
ABSTRACT The rapid development of multimedia and internet allows for wide distribution
of digital media data. It becomes much easier to edit, modify and duplicate digital
information. In additional, digital document is also easy to copy and distribute, therefore it 

Cryptography without (hardly any) secrets?
S Goldwasser ,Advances in Cryptology-EUROCRYPT 2009, 2009 ,Springer
The absolute privacy of the secret-keys associated with cryptographic algorithms has been
the corner-stone of modern cryptography. Still, in practice, keys do get compromised at times
for a variety or reasons. A particularly disturbing loss of secrecy is as a result of side 

Elliptic Curve Cryptography support for ARM based Embedded systems
S Bartolini, P Bennati,  Computer Architecture and , 2006 ,
ABSTRACT Elliptic Curve Cryptography (ECC) is emerging as an attractive approach to
public-key cryptography for constrained environments, because of the small key sizes and
computational efficiency, while preserving the same security level as the standard 

On the use of cellular automata in symmetric cryptography
A Fuster-Sabater ,Acta Applicandae Mathematicae, 2006 ,Springer
Abstract In this work, pseudorandom sequence generators based on finite fields have been
analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear
sequence generators has been modelled in terms of linear cellular automata. The 

Efficient implementation of elliptic curve cryptography on FPGAs
J Shokrollahi ,2006 ,
Elliptic curve cryptosystems are public key protocols whose security is based on the
conjectured difficulty of solving the discrete logarithm problem on an elliptic curve. Assuming
Q to be a point of order n on an elliptic curve it is desirable to compute mQ, where m is an 

Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography

Abstract An identity-based encryption (IBE) scheme can greatly reduce the complexity of
sending encrypted messages over the Internet. However, an IBE scheme necessarily
requires a private-key generator (PKG), which can create private keys for clients, and so 

Cryptography with constant input locality
B Applebaum, Y Ishai ,Journal of cryptology, 2009 ,Springer
Abstract We study the following natural question: Which cryptographic primitives (if any) can
be realized by functions with constant input locality, namely functions in which every bit of
the input influences only a constant number of bits of the output? This continues the study 

TN Shankar ,International Journal of Computer , 2009 ,
ABSTRACT The paper describes the basic idea of Elliptic Curve Cryptography (ECC) and its
implementation through co-ordinate geometry for data encryption. Elliptic curve
cryptography is an asymmetric key cryptography. It includes (i) public key generation on 

A new cryptography algorithm using cab curves an LDPC for wireless communication systems
B Ontiveros, I Soto ,WSEAS Transactions on Mathematics, 2007 ,
Abstract: In this paper we propose a new public key cryptographic system using Cab curves
and Low Density Parity Check (LDPC) codes for mobile communication. This algorithm uses
the Jacobian group of the Cab curves as a mathematical group to perform the encoder 

Development of the polarization tracking scheme for free-space quantum cryptography
M Toyoshima, Y Takayama, H Kunimori ,Proceedings of SPIE, , 2008 ,
ABSTRACT Quantum cryptography is a new technique for transmitting quantum information.
The information is securely transmitted due to the laws of physics. In such systems, the
vehicle that transfers quantum information is a single photon. The problem with using 

Threshold Cryptography Based on Blakely Secret Sharing
K Bozkurt ,Information Sciences, 2008 ,
Abstract—Function sharing deals with the problem of distribution of the computation of a
function (such as decryption or signature) among several parties. The necessary values for
the computation are distributed to the participating parties using a secret sharing scheme (

On the design and optimization of a quantum polynomial-time attack on elliptic curvecryptography
J Mathew , , and Cryptography, 2008 ,Springer
We consider a quantum polynomial-time algorithm which solves the discrete logarithm
problem for points on elliptic curves over GF (2 m). We improve over earlier algorithms by
constructing an efficient circuit for multiplying elements of binary finite fields and by 

Formalized elliptic curve cryptography
M Gordon ,High Confidence Software and Systems, , 2006 ,
Abstract Formalizing a mathematical theory is a necessary first step to proving the
correctness of programs that refer to that theory in their specification. This paper
demonstrates how the mathematical theory of elliptic curves and their application to 

Performance evaluation of visual cryptography schemes with intensity transformations for gray-scale images
M Higuchi, S Kawasaki, J Gamba, A Koike ,Proceedings of the 3rd , 2010 ,
Abstract: In a kind of visual cryptography, a secret image is hidden into other images. Then,
we can reconstruct the secret image by using share images produced in secret image hiding
scheme. In the case of two binary share images, the secret image is reconstructed by 

Low power elliptic curve cryptography
M Keller ,Integrated Circuit and System Design. Power and , 2007 ,Springer
The designer of an elliptic curve processor is faced with many design choices that include
the algorithm and coordinate system to be used. The power consumption of elliptic curve
processors is becoming increasingly important as such processors find new uses in power 

Elliptic Curve Cryptography
MS Anoop ,An Implementation Guide, 2007 ,
Abstract: The paper gives an introduction to elliptic curve cryptography (ECC) and how it is
used in the implementation of digital signature (ECDSA) and key agreement (ECDH)
Algorithms. The paper discusses the implementation of ECC on two finite fields, prime