On the public citation graph

A new random number generator from permutation groups

https://doi.org/10.1007/bf02924858
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
inferredcites →https://doi.org/10.1007/978-1-84800-273-9_9openalex-snapshot
Algebraic coding theory
inferredcites →https://doi.org/10.1007/978-3-642-23929-8_2openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50020-5openalex-snapshot
Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.
inferredcites →https://doi.org/10.1049/ep.1968.0141openalex-snapshot
Shift Register Sequences
inferredcites →https://doi.org/10.1080/0161-117791833020openalex-snapshot
ASSESSMENT OF THE NATIONAL BUREAU OF STANDARDS PROPOSED FEDERAL DATA ENCRYPTION STANDARD
inferredcites →https://doi.org/10.1108/09504120610655222openalex-snapshot
1911 Encyclopedia Britannica
inferredcites →https://doi.org/10.1109/tc.1977.1674759openalex-snapshot
Encryption Schemes for Computer Confidentiality
inferredcites →https://doi.org/10.1142/9361openalex-snapshot
Shift Register Sequences
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1145/356789.356795openalex-snapshot
Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography
inferredcites →https://doi.org/10.1145/800204.806269openalex-snapshot
Some applications of group theoretical programs
inferredcites →https://doi.org/10.1145/800205.3317664openalex-snapshot
The Schreier algorithm for matrix groups
inferredcites →https://doi.org/10.1145/800205.806316openalex-snapshot
On determining the order of a group
inferredcites →https://doi.org/10.1515/9783112311943-022openalex-snapshot
Programs for permutation groups
inferredcites →https://doi.org/10.2307/2314023openalex-snapshot
Finite Permutation Groups.
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-34805-0_41openalex-snapshot
Properties of Cryptosystem PGM
inferred← citeshttps://doi.org/10.1007/3-540-54955-2_20openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-34704-7_26openalex-snapshot
Pseudorandom Generators Based on Subcovers for Finite Groups
inferred← citeshttps://doi.org/10.1007/b100182openalex-snapshot
Secure Group Communications over Data Networks
inferred← citeshttps://doi.org/10.1007/bf02451113openalex-snapshot
Algebraic properties of cryptosystem PGM
inferred← citeshttps://doi.org/10.1007/s10013-021-00489-5openalex-snapshot
The Existence of Minimal Logarithmic Signatures for Some Finite Simple Unitary Groups
inferred← citeshttps://doi.org/10.1007/s10623-011-9485-1openalex-snapshot
Pseudorandom number generators based on random covers for finite groups
inferred← citeshttps://doi.org/10.1007/s12095-015-0129-6openalex-snapshot
The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups
inferred← citeshttps://doi.org/10.1080/10586458.2016.1235997openalex-snapshot
The Existence of Minimal Logarithmic Signatures for Some Finite Simple Groups
inferred← citeshttps://doi.org/10.1109/acit62333.2024.10712472openalex-snapshot
Towards UAT Methodology on Cryptographic Library Assessment
inferred← citeshttps://doi.org/10.1515/jmc-2013-5000openalex-snapshot
Strongly aperiodic logarithmic signatures
inferred← citeshttps://doi.org/10.1515/jmc-2017-0048openalex-snapshot
Construction of strongly aperiodic logarithmic signatures
inferred← citeshttps://doi.org/10.2478/tmmp-2013-0033openalex-snapshot
LOGARITHMIC SIGNATURES FOR ABELIAN GROUPS AND THEIR FACTORIZATION
inferred← citeshttps://doi.org/10.28925/2663-4023.2023.22.113121openalex-snapshot
DEVELOPMENTOFMETHODSFORTESTINGTHELIBRARYOFCRYPTOGRAPHICTRANSFORMATIONSONTHEEXAMPLEOFTHEMST3CRYPTOSYSTEMBASEDONGENERALIZEDSUZUKI2-GROUPS
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.