#phanerography

What is the antonym of kruptos ('hidden')? Phanæro-, meaning "visible". What is called "cryptography" in "crypto" is actually a branch of mathematics that grew out of cryptography

The message maps to a bit x in the message, x = M%(⌊log2(message)⌋+1), inverts the state, x^1, and the bit to the right of x is the new leftmost end of the binary string. This process is repeated n times,

The message M is input into a hash function, as Mn where n is the iteration of the function (M0, M1...Mn). Mn will here be referred to as just M. M maps to bit x = (M+R)%bits(M) in M, R is the output string

Inspired by BitLattice, I had an idea for a "hash function" that uses the ledger itself, terabytes and potentially petabyte of data, as part of the function. It maps the transaction to a path

The message M is input into a hash function, as Mn where n is the iteration of the function (M0, M1...Mn), also used as a nonce that is incremented every iteration of the function. Mn will here be referred

Two inputs, A and B, are combined similar to a zipper. The inputs map to positions on one another, recursively, and alter the state of bits at those positions, iteratively mutating every bit in both inputs.

A "hash function" where the pre-image is a "map" to traverse a "global reference number", the reference number is immutable and remains the same for anyone using the function,

Labyrinth is the equivalent of a one-way hash function, and scales to messages of arbitrary size. The building block of Labyrinth is a recursive, iterative function that is equivalent to the compression

What word do people use to distinguish between hash signatures and RSA/elliptic curves-type signatures? I thought of the distinction "rational" vs. "irrational" signatures, because

Lamport/Winternitz-type digital signatures have very large signature sizes, but can be designed with a much smaller public key size of just 1n-bit (with signatures of 32+2n-bit and a secret key of 32+2*n-bit.

If you want to learn RSA, a^x mod p, when p is a prime number, follow a cyclical sequence that loops when x = p-1. Think of it like octaves on a piano, after the sequence has looped you end up at the same

Modular exponentiation, exponentiation performed over a modulus, a^x mod n, is cyclical, the same sequence of numbers is repeated in each cycle, similar to how going up one octave on a piano gets you to

An inherent property of asymmetric cryptography is that it supports billions, trillions, quindecillion, accounts, and blockchain technology is entirely about the use of public-private key cryptography

An analysis of a critique of Pseudonym Pairs, and the bias behind it ("social mind bias", note: all humans have that, the idea that some do and some do not is just a local myth within some consensus

Susan Blackmore suggests that the skills needed for imitation, i.e. putting oneself in another's shoes, are exactly those needed in advanced social skills known as Machiavellian intelligence or Theory

What is the antonym of kruptos ('hidden')? Phanæro-, meaning "visible". From cryptography to phanerography, a look at the roots

The cryptozoic (hidden life), also called the pre-cambrian eon, was followed by the phanærozoic (visible life) eon. Public-private key systems like RSA from the 1970s and elliptic curves from the 1990s