07-01-2011
thank you. the purpose of the project is a new type of software security. it's to prevent people from hacking commercial programs, so it even extends to Linux and Mac, not just Windows. they way I designed it, it's a modification to the compiler used to create the software, this is done for efficiency purposes (code once and apply to all vs. code into all). and the program splits between two methods based on whether the user is running any programs to trace random number generators (long story behind that), so I needed to know if I can detect the parallel processing. I'm not aware of that many ways to trace random number generators, but I think I covered most. can anyone who knows any ways list all the possible methods they know, so I can make sure I don't miss any that are coverable
7 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
IS there virus software for unix? I worked in a Solaris environment and dont remember having anything. I also ask because the current enviroment i am working on is Microsoft and they argue that they do not use unix because of virus detection. Any input would be greatly appreciated. (1 Reply)
Discussion started by: pbonilla
1 Replies
2. IP Networking
How to get information that where is my modem configured in /dev.
I have two modems configured in my device .. one is USB and other is PCI modem.. USB is detected as /dev/USB0. but how to see about PCI modem? (0 Replies)
Discussion started by: s123.radha
0 Replies
3. UNIX for Dummies Questions & Answers
Hi All,
could any expert tell me about writing a parallel processing program using AWK program is possible or not? Any example would be much appreciated...
With Regards / Mysore Ganapati :confused: (5 Replies)
Discussion started by: ganapati
5 Replies
4. Shell Programming and Scripting
hellou, can anybody help me with nat detection in real time ? i prefer some detection script because i try some nat detection program's for example p0f or i'm using tcpdump, but i would get contain of specific packet. Some ideas? (1 Reply)
Discussion started by: TheTechnic
1 Replies
5. AIX
Hi,
I have a handy script in Linux, part of which checks for the presence of nfs mounts, using the information in /proc/mounts.
Is there a suitable command or file in AIX that could be used in a similar way?
Many thanks in advance (1 Reply)
Discussion started by: SDG
1 Replies
6. Shell Programming and Scripting
I want to grep/awk /var/log/httpd/mysite-access_log.log and check if 2 words from the following appear in a single line:
benchmark
union
information_schema
drop
truncate
group_concat
into
file
case
hex
lpad
group
order
having
insert
union
select
from (12 Replies)
Discussion started by: koutroul
12 Replies
7. Shell Programming and Scripting
This URL:
Internet Archive Wayback Machine
..will redirect to this URL when using a browser:
https://web.archive.org/web/20140110200053/http://rapor.tuik.gov.tr/reports/rwservlet?adnksdb2&ENVID=adnksdb2Env&report=wa_idari_yapi_10sonrasi.RDF&p_il1=17&p_yil=2012&p_dil=2&desformat=html
But... (0 Replies)
Discussion started by: Mid Ocean
0 Replies
LEARN ABOUT ULTRIX
random
random(3) Library Functions Manual random(3)
Name
random, srandom, initstate, setstate - better random number generator; routines for changing generators
Syntax
long random()
void srandom(seed)
int seed;
char *initstate(seed, state, n)
unsigned seed;
char *state;
int n;
char *setstate(state)
char *state;
Description
The subroutine uses a non-linear additive feedback random number generator employing a default table of size 31 long integers to return
successive pseudo-random numbers in the range from 0 to (2**31)-1. The period of this random number generator is very large, approximately
16*((2**31)-1).
The subroutines have (almost) the same calling sequence and initialization properties as The difference is that rand(3) produces a much
less random sequence - in fact, the low dozen bits generated by rand go through a cyclic pattern. All the bits generated by are usable.
For example, "random()&01" will produce a random binary value.
Unlike does not return the old seed; the reason for this is that the amount of state information used is much more than a single word.
(Two other routines are provided to deal with restarting/changing random number generators.) Like however, will by default produce a
sequence of numbers that can be duplicated by calling with 1 as the seed.
The routine allows a state array, passed in as an argument, to be initialized for future use. The size of the state array (in bytes) is
used by to decide how sophisticated a random number generator it should use - the more state, the better the random numbers will be. (Cur-
rent "optimal" values for the amount of state information are 8, 32, 64, 128, and 256 bytes; other amounts will be rounded down to the
nearest known amount. Using less than 8 bytes will cause an error). The seed for the initialization (which specifies a starting point for
the random number sequence, and provides for restarting at the same point) is also an argument. returns a pointer to the previous state
information array.
Once a state has been initialized, the routine provides for rapid switching between states. The subroutine returns a pointer to the previ-
ous state array; its argument state array is used for further random number generation until the next call to or
Once a state array has been initialized, it may be restarted at a different point either by calling (with the desired seed, the state
array, and its size) or by calling both (with the state array) and (with the desired seed). The advantage of calling both and is that the
size of the state array does not have to be remembered after it is initialized.
With 256 bytes of state information, the period of the random number generator is greater than 269, which should be sufficient for most
purposes.
Diagnostics
If is called with less than 8 bytes of state information, or if detects that the state information has been garbled, error messages are
printed on the standard error output.
See Also
rand(3)
random(3)