PERFECT PANGRAM HASH : Anagram Hash Function
#DOI https://doi.org/10.5281/zenodo.18448042
A pangram is a sentence or phrase that contains each letter of an alphabet or character set at least once. A perfect pangram is an anagram of the alphabet which contains each letter exactly once.
Pangram hash generates a perfect pangram hash digest consisting of a anagram permutation of a character set. Each character in the output is unique and non-repeating.
#Hashing #Cryptography #Anagrams #Papers #Preprints
@cryptography@soc.octade.net @crypto@infosec.pub @cryptography@fed.dyne.org
@octade @cryptography@soc.octade.net @crypto @cryptography@fed.dyne.org First viewing of Pascal…in the wild. Cool, I guess.
FreePascal is secret weapon.
Features:
LLVM backend
transpile to javascript
compiles almost anywhere, probably even your toaster
FAST FAST FASTWhen sticking to the procedural method the source reads like pseudocode. This makes it useful for writing cryptography and workhorse tools that require utmost clarity.
When team Python sunset v2.7 and vaporized a decade worth of source code I abandoned Python for Pascal for all my personal fiddles. A Pascal program will compile and start while the Python interpreter is still warming up.
Why would that be used for hashes? Don’t see the point
Hash Function:
https://en.wikipedia.org/wiki/Hash/_functionI run a cryptography forum, I know what it is.
Why use this for a hash?
See the comment on line 31 in the source code.
