How to generate a bilinear group of prime order p for key generation I am trying to implement an IEEE Paper In Cryptography. I read many reference regarding an RSA key generation. But i am confused with above statement. Please someone explain me What it says with example.



EDIT *  

I am trying to implement key generation from the paper Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage. In the paper, the first step in key generation is a setup phase state as follows
SETUP(1^&#955;) : Randomly pick a bilinear group G of prime order p where
, a generator g&#1013;G ...

In the definition I understand what is meant by bilinear, prime order and generator. But what is that parameter &#955; and what should its value be?



*Edit was added for clarification purposes (copy-and-paste from this dupe by same user).
Bilinear group in question is expected to be strong enough, and this depends on group order $p$. Namely, group order should be large enough. So, $\lambda$ is order size in bits. That is, size of the binary representation of order. Order of the group, or maybe just size of the order should be known before generating the group. Notation $1^{\lambda}$ is there to say SETUP() accepts a bitstring of size $\lambda$.