Implementing public-key cryptography on platforms with limited resources, such as microprocessors, is a challenging task. Hardware/software co-design is often the only answer to implement the computationally intensive operations with limited memory and power at an acceptable speed. This contribution describes such a solution for Hyperelliptic Curve Cryptography (HECC). The proposed hardware/sof...

This paper presents the comparison and optimization of Galois field algorithm and IDEA(International data encrypted algorithm) using VHDL(xc2v40-6cs144)with the help of Xilinx-Ise (9.2) .In terms of security IDEA algorithm is very much superior where as in terms of timings Galois field is much better and is already patented of Ascom. These are cryptographic algorithm used for security purpose. ...

We consider two natural embeddings between Artin groups: the group GÃn−1 of type Ãn−1 embeds into the group GBn of type Bn ; GBn in turn embeds into the classical braid group Brn+1 := GAn of type An . The cohomologies of these groups are related, by standard results, in a precise way. By using techniques developed in previous papers, we give precise formulas (sketching the proofs) for the cohom...

We introduce a spanning set of BLM type, {A(j, r)}A,j, for affine quantum Schur algebras S△(n, r) and construct a linearly independent set {A(j)}A,j for an associated algebra K̂△(n). We then establish explicitly some multiplication formulas of simple generators E △ h,h+1(0) by an arbitrary element A(j) in K̂△(n) via the corresponding formulas in S△(n, r), and compare these formulas with the multi...

As computing and communication devices are equipped with increasingly versatile wireless connection capabilities, the demand for security increases. Cryptography provides a method for securing and authenticating the transmission of information over the insecure channels. Elliptic Curve [EC] Cryptography is a public key cryptography which replaces RSA because of its increased security with lesse...

The finite field modular multiplier is the most critical component in the elliptic curve crypto processor (ECCP) consuming the maximum chip area and contributing the most to the device latency. Modular multiplication, point multiplication, point doubling are few of the critical activities to be carried out by multiplier in ECC algorithm, and should be managed without compromising on security an...

Let V be a finite dimensional complex linear space and let G be an irreducible finite subgroup of GL(V ). For a G-invariant lattice Λ in V of maximal rank, we give a description of structure of the complex torus V/Λ. In particular, we prove that for a wide class of groups, V/Λ is isogenous to a self-product of an elliptic curve, and that in many cases V/Λ is isomorphic to a product of mutually ...

Let V be a finite dimensional complex linear space and let G be an irreducible finite subgroup of GL(V). For a G-invariant lattice Λ in V of maximal rank, we give a description of structure of the complex torus V /Λ. In particular, we prove that for a wide class of groups, V /Λ is isogenous to a self-product of an elliptic curve, and that in many cases V /Λ is isomorphic to a product of mutuall...

We recall that a pseudo complex structure on a C∞-manifold X of dimension 2N is a C-module structure on the tangent bundle TX . Such a module structure induces an action of the group C∗ on TX , with λ ∈ C∗ acting by multiplication by λ. By transport of structures, the group C∗ acts also on each exterior power ∧TX , as well as on the complexified dual Ω := Hom(∧TX ,C). For p+ q = n, a (p, q)-for...