PERFECT PANGRAM HASH : Anagram Hash Function
PERFECT PANGRAM HASH : Anagram Hash Function
A pangram is a sentence or phrase that contains each letter of an alphabetor character set at least once. A perfect pangram is an anagram of thealphabet which contains each letter exactly once. Pangram hash generates a perfect pangram hash digest consisting of aanagram permutation of a character set. Each character in the output isunique and non-repeating. Below is purely procedural source code written in the FreePascalprogramming language. Instructions and explanatory comments are locatedin the source code. A plain text source file is embedded in the PDFdocument. Additional resource files are also embedded in the PDF file.
computer programming, combinatrics, anagrams, Cryptography, FreePascal, hash function, cryptology, permutation
computer programming, combinatrics, anagrams, Cryptography, FreePascal, hash function, cryptology, permutation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!