M. Brin and P.Dehornoy independently discovered a braided version BV of R.Thompson’s group V . In this paper, we discuss some properties of BV that might make the group interesting for group based cryptography. In particular, we show that BV does not admit a non-trivial linear representation.

Recent progress on pairing implementation has made certain pairings extremely simple and fast to compute. Hence, it is natural to examine if there are consequences for the security of pairing-based cryptography. This paper gives a method to compute eta pairings in a way which avoids the requirement for a final exponentiation. The method does not lead to any improvement in the speed of pairing i...

This article presets a review of lattice problems. Paper contains the main eighteen problems with their reductions and referents to his cryptography application. As an example of reduction, we detail analyze connection between SVP and CVP. Moreover, we give an Ajtai theorem and demonstrate its role in lattice based cryptography.

This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...

Cryptography is an obvious means to secure and protect confidential information. Recently, identity-based public key cryptography schemes not only seem easier to deploy than previous schemes, but also seem equal to the challenges. In this paper, we give a detailed overview of the features and challenges the NHS environment presents to uses of cryptography, to qualify our impressions of our cryp...

This is a survey on application of Identity-Based Cryptography in mobile ad hoc networks. In this survey, we review all papers that are available in the literature on security schemes on mobile ad hoc networks using Identity-Based Cryptography during years 2001 to 2007. To introduce the topic, we first review most important developments on general Identity-Based Cryptography. The survey introdu...

To reduce bandwidth in elliptic curve cryptography one can transmit only x-coordinates of points (or x-coordinates together with an extra bit). For further computation using the points one can either recover the y-coordinates by taking square roots or one can use point multiplication formulae which use x-coordinates only. We consider how to efficiently use point compression in pairing-based cry...

Although an active area of research for years, formal verification has still not yet reached widespread deployment. We outline the steps needed to move from low-assurance cryptography, as given by libraries such as OpenSSL, to high assurance cryptography in deployment. In detail, we outline the need for a suite of high-assurance cryptographic software with per-microarchitecture optimizations th...

In this paper, Cryptography and Steganography techniques are combined to enhance the security level of data communication over an unsafe distributed network. The standard LSB(Least Significant Bit) steganography method is also modified by digitally signing a information of starting position of hided message in image, so that any other third person can’t determine the position of beginning of hi...

Steganography involves hiding a secret message or image inside another cover image. Changes are made in the cover image without affecting visual quality of the image. In contrast to cryptography, Steganography provides complete secrecy of the communication. Security of very sensitive data can be enhanced by combining cryptography and steganography. A new technique that uses the concept of Stega...