void main(void)
{
unsigned char freshout[20], seedbyte = 1;
unsigned int bytesneeded;
R_RANDOM_STRUCT randomstruct;
fprintf(stderr, "RANDEMO - Random Object Demo Using %s.\n", RSAEURO_IDENT);
R_RandomCreate(&randomstruct);
R_GenerateBytes(freshout, sizeof(freshout), &randomstruct);
printf("\n Random Output 1 - ");
printbuff(freshout, sizeof(freshout));
R_RandomMix(&randomstruct);
R_GenerateBytes(freshout, sizeof(freshout), &randomstruct);
printf(" Mixed Random Output 1 - ");
printbuff(freshout, sizeof(freshout));
R_RandomFinal(&randomstruct);
R_RandomInit(&randomstruct);
while(1) {
R_GetRandomBytesNeeded(&bytesneeded, &randomstruct);
if(bytesneeded == 0)
break;
R_RandomUpdate(&randomstruct, &seedbyte, 1);
}
R_GenerateBytes(freshout, sizeof(freshout), &randomstruct);
printf(" Random Output 2 - ");
printbuff(freshout, sizeof(freshout));
R_RandomMix(&randomstruct);
R_GenerateBytes(freshout, sizeof(freshout), &randomstruct);
printf(" Mixed Random Output 2 - ");
printbuff(freshout, sizeof(freshout));
R_GenerateBytes(freshout, sizeof(freshout), &randomstruct);
printf(" Mixed Random Output 2 - ");
printbuff(freshout, sizeof(freshout));
R_RandomFinal(&randomstruct);
}
void C_MessageQueue::saturate(int satsize)
{
// debug_printf("sending a %d byte saturation message\n",40+satsize);
// add a message, saturation, baby
T_Message satmsg={0,};
satmsg.data=new C_SHBuf(satsize);
if (satmsg.data)
{
R_GenerateBytes((unsigned char *)satmsg.data->Get(),satsize,&g_random);
satmsg.message_type=MESSAGE_LOCAL_SATURATE;
satmsg.message_length=satmsg.data->GetLength();
satmsg.message_ttl=1;
CreateID128(&satmsg.message_guid);
satmsg.message_prio=C_MessageQueueList::GetMessagePriority(satmsg.message_type);
C_MessageQueue::calc_md5(&satmsg,satmsg.message_md5);
satmsg.data->Lock();
send_message(&satmsg);
satmsg.data->Unlock();
}
}
/* Generates a probable prime a between b and c such that a-1 is divisible by d.
Lengths: a[digits], b[digits], c[digits], d[digits].
Assumes b < c, digits < MAX_NN_DIGITS.
Returns RE_NEED_RANDOM if randomStruct not seeded, RE_DATA if
unsuccessful.
*/
int GeneratePrime(NN_DIGIT *a, NN_DIGIT *b, NN_DIGIT *c, NN_DIGIT *d, unsigned int digits, R_RANDOM_STRUCT *randomStruct)
{
int status;
unsigned char block[MAX_NN_DIGITS * NN_DIGIT_LEN];
NN_DIGIT t[MAX_NN_DIGITS], u[MAX_NN_DIGITS];
/* Generate random number between b and c.
*/
if ((status = R_GenerateBytes (block, digits * NN_DIGIT_LEN, randomStruct))!=0) return (status);
NN_Decode (a, digits, block, digits * NN_DIGIT_LEN);
NN_Sub (t, c, b, digits);
NN_ASSIGN_DIGIT (u, 1, digits);
NN_Add (t, t, u, digits);
NN_Mod (a, a, digits, t, digits);
NN_Add (a, a, b, digits);
/* Adjust so that a-1 is divisible by d.
*/
NN_Mod (t, a, digits, d, digits);
NN_Sub (a, a, t, digits);
NN_Add (a, a, u, digits);
if (NN_Cmp (a, b, digits) < 0) NN_Add (a, a, d, digits);
if (NN_Cmp (a, c, digits) > 0) NN_Sub (a, a, d, digits);
/* Search to c in steps of d.
*/
NN_Assign (t, c, digits);
NN_Sub (t, t, d, digits);
while (! ProbablePrime (a, digits)) {
if (NN_Cmp (a, t, digits) > 0) return (RE_DATA);
NN_Add(a, a, d, digits);
};
return (0);
}
