drygdryg/calc
1
0
Fork 0
mirror of https://github.com/lcn2/calc.git synced 2025-08-19 01:13:27 +03:00
Code Issues Packages Projects Releases Wiki Activity

convert ASCII TABs to ASCII SPACEs

Browse Source 
Converted all ASCII tabs to ASCII spaces using a 8 character
tab stop, for all files, except for all Makefiles (plus rpm.mk).
The `git diff -w` reports no changes.
This commit is contained in:
Landon Curt Noll
2024-07-11 22:03:52 -07:00
parent fe9cefe6ef
commit db77e29a23
631 changed files with 90607 additions and 90600 deletions
Download Patch File Download Diff File Expand all files Collapse all files

106
help/random
View File

@@ -5,16 +5,16 @@ SYNOPSIS
random([[min, ] beyond])
TYPES
min integer
beyond integer
min integer
beyond integer
return integer
return integer
DESCRIPTION
Generate a pseudo-random number using a Blum-Blum-Shub generator.
We return a pseudo-random number over the half closed interval:
[min,beyond) ((min <= return < beyond))
[min,beyond) ((min <= return < beyond))
By default, min is 0 and beyond is 2^64.
@@ -25,56 +25,56 @@ DESCRIPTION
Other arg forms:
random() Same as random(0, 2^64)
random(beyond) Same as random(0, beyond)
random() Same as random(0, 2^64)
random(beyond) Same as random(0, beyond)
The random generator generates the highest order bit first. Thus:
The random generator generates the highest order bit first. Thus:
random(256)
random(256)
will produce the save value as:
(random(8) << 5) + random(32)
(random(8) << 5) + random(32)
when seeded with the same seed.
The basic idea behind the Blum-Blum-Shub generator is to use
the low bit bits of quadratic residues modulo a product of
two 3 mod 4 primes. The lowest int(log2(log2(p*q))) bits are used
two 3 mod 4 primes. The lowest int(log2(log2(p*q))) bits are used
where log2() is log base 2 and p,q are two primes 3 mod 4.
The Blum-Blum-Shub generator is described in the papers:
Blum, Blum, and Shub, "Comparison of Two Pseudorandom Number
Generators", in Chaum, D. et. al., "Advances in Cryptology:
Proceedings Crypto 82", pp. 61-79, Plenum Press, 1983.
Blum, Blum, and Shub, "Comparison of Two Pseudorandom Number
Generators", in Chaum, D. et. al., "Advances in Cryptology:
Proceedings Crypto 82", pp. 61-79, Plenum Press, 1983.
Blum, Blum, and Shub, "A Simple Unpredictable Pseudo-Random
Number Generator", SIAM Journal of Computing, v. 15, n. 2,
1986, pp. 364-383.
Blum, Blum, and Shub, "A Simple Unpredictable Pseudo-Random
Number Generator", SIAM Journal of Computing, v. 15, n. 2,
1986, pp. 364-383.
U. V. Vazirani and V. V. Vazirani, "Trapdoor Pseudo-Random
Number Generators with Applications to Protocol Design",
Proceedings of the 24th IEEE Symposium on the Foundations
of Computer Science, 1983, pp. 23-30.
U. V. Vazirani and V. V. Vazirani, "Trapdoor Pseudo-Random
Number Generators with Applications to Protocol Design",
Proceedings of the 24th IEEE Symposium on the Foundations
of Computer Science, 1983, pp. 23-30.
U. V. Vazirani and V. V. Vazirani, "Efficient and Secure
Pseudo-Random Number Generation", Proceedings of the 24th
IEEE Symposium on the Foundations of Computer Science,
1984, pp. 458-463.
U. V. Vazirani and V. V. Vazirani, "Efficient and Secure
Pseudo-Random Number Generation", Proceedings of the 24th
IEEE Symposium on the Foundations of Computer Science,
1984, pp. 458-463.
U. V. Vazirani and V. V. Vazirani, "Efficient and Secure
Pseudo-Random Number Generation", Advances in Cryptology -
Proceedings of CRYPTO '84, Berlin: Springer-Verlag, 1985,
pp. 193-202.
U. V. Vazirani and V. V. Vazirani, "Efficient and Secure
Pseudo-Random Number Generation", Advances in Cryptology -
Proceedings of CRYPTO '84, Berlin: Springer-Verlag, 1985,
pp. 193-202.
Sciences 28, pp. 270-299.
Sciences 28, pp. 270-299.
Bruce Schneier, "Applied Cryptography", John Wiley & Sons,
1st edition (1994), pp 365-366.
Bruce Schneier, "Applied Cryptography", John Wiley & Sons,
1st edition (1994), pp 365-366.
This generator is considered 'strong' in that it passes all
polynomial-time statistical tests. The sequences produced are
polynomial-time statistical tests. The sequences produced are
random in an absolutely precise way. There is absolutely no better
way to predict the sequence than by tossing a coin (as with TRULY
random numbers) EVEN IF YOU KNOW THE MODULUS! Furthermore, having
@@ -89,7 +89,7 @@ DESCRIPTION
To compromise the generator, an adversary must either factor the
modulus or perform an exhaustive search just to determine the next
(or previous) bit. If we make the modulus hard to factor (such as
(or previous) bit. If we make the modulus hard to factor (such as
the product of two large well chosen primes) breaking the sequence
could be intractable for todays computers and methods.
@@ -105,27 +105,27 @@ DESCRIPTION
The goals of this package are:
all magic numbers are explained
all magic numbers are explained
I distrust systems with constants (magic numbers) and tables
that have no justification (e.g., DES). I believe that I have
done my best to justify all of the magic numbers used.
I distrust systems with constants (magic numbers) and tables
that have no justification (e.g., DES). I believe that I have
done my best to justify all of the magic numbers used.
full documentation
full documentation
You have this source file, plus background publications,
what more could you ask?
You have this source file, plus background publications,
what more could you ask?
large selection of seeds
large selection of seeds
Seeds are not limited to a small number of bits. A seed
may be of any size.
Seeds are not limited to a small number of bits. A seed
may be of any size.
the strength of the generators may be tuned to meet the need
the strength of the generators may be tuned to meet the need
By using the appropriate seed and other arguments, one may
increase the strength of the generator to suit the need of
the application. One does not have just a few levels.
By using the appropriate seed and other arguments, one may
increase the strength of the generator to suit the need of
the application. One does not have just a few levels.
For a detailed discussion on seeds, see the srandom help page.
@@ -133,7 +133,7 @@ DESCRIPTION
is given in the source. While this does not reduce the quality
of the generator, knowing the factors of the Blum modulus would
help someone determine the next or previous bit when they did
not know the seed. If this bothers you, feel free to use one
not know the seed. If this bothers you, feel free to use one
of the other compiled in Blum moduli or provide your own. See
the srandom help page for details.
@@ -166,7 +166,7 @@ SEE ALSO
##
## Calc is distributed in the hope that it will be useful, but WITHOUT
## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
## or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
## or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
## Public License for more details.
##
## A copy of version 2.1 of the GNU Lesser General Public License is
@@ -174,8 +174,8 @@ SEE ALSO
## received a copy with calc; if not, write to Free Software Foundation, Inc.
## 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
##
## Under source code control: 1997/02/17 01:18:22
## File existed as early as: 1997
## Under source code control: 1997/02/17 01:18:22
## File existed as early as: 1997
##
## chongo <was here> /\oo/\ http://www.isthe.com/chongo/
## Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/
## chongo <was here> /\oo/\ http://www.isthe.com/chongo/
## Share and enjoy! :-) http://www.isthe.com/chongo/tech/comp/calc/