research-article

Free access

A "unique number" generator

Author:

Armen NahapetianAuthors Info & Claims

AFIPS '76: Proceedings of the June 7-10, 1976, national computer conference and exposition

Pages 999 - 1000

https://doi.org/10.1145/1499799.1499937

Published: 07 June 1976 Publication History

PDF eReader

Abstract

In many computer systems and applications, the need arises for the software to generate unique numbers or names for the identification of dynamically generated entities.

Such a generator is described here which produces new numbers and reuses numbers released by the system.

An analysis is carried out to determine the storage requirements of the generator in relation to the number of requests that can be accommodated.

Reference

[1]

Parzen, Modern Probability Theory and its Applications, Wiley, 1960.

Google Scholar

Recommendations

Design of a pseudo-chaotic number generator as a random number generator
2016 International Conference on Communications (COMM)
Generating random numbers is essential in many cryptographic applications like key generation, protocols, nonce and also in Internet for choosing TCP sequence numbers for example. We need generators which are able to construct large amounts of secure ...
TinyMT pseudo random number generator for Erlang
Erlang '12: Proceedings of the eleventh ACM SIGPLAN workshop on Erlang workshop

This paper is a case study of implementing Tiny Mersenne Twister (TinyMT) pseudo random number generator (PRNG) for Erlang. TinyMT has a longer generation period (2¹²⁷-1) than the stock implementation of Erlang/OTP random module. TinyMT can generate ...
Quantum random number generator vs. random number generator
2016 International Conference on Communications (COMM)
A random number generator produces a periodic sequence of numbers on a computer. The starting point can be random, but after it is chosen, everything else is deterministic. A random number generator produces a periodic sequence of numbers on a computer. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

AFIPS '76: Proceedings of the June 7-10, 1976, national computer conference and exposition

June 1976

1125 pages

ISBN:9781450379175

DOI:10.1145/1499799

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 1976

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
87
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)4

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Design of a pseudo-chaotic number generator as a random number generator

TinyMT pseudo random number generator for Erlang

Quantum random number generator vs. random number generator