Search results

In information theory, the entropy of a random variable is the average level of "information", "surprise", or "uncertainty" inherent to the variable's...

Synthetic geometry (sometimes referred to as axiomatic geometry or even pure geometry) is geometry without the use of coordinates. It relies on the axiomatic...

Secret sharing (also called secret splitting) refers to methods for distributing a secret among a group, in such a way that no individual holds any intelligible...

In computer security, challenge-response authentication is a family of protocols in which one party presents a question ("challenge") and another party...

In cryptography, MDC-2 (Modification Detection Code 2, sometimes called Meyer–Schilling,[citation needed] standardized in ISO 10118-2) is a cryptographic...

The large sieve is a method (or family of methods and related ideas) in analytic number theory. It is a type of sieve where up to half of all residue classes...

A hash chain is the successive application of a cryptographic hash function to a piece of data. In computer security, a hash chain is a method used to...

Maths Mansion is a British educational television series for school Years 4 to 6 (nine to eleven year olds) that ran from 19 September 2001 to 26 March...

The Scheirer–Ray–Hare (SRH) test is a statistical test that can be used to examine whether a measure is affected by two or more factors. Since it does...

The Queuing Rule of Thumb (QROT) is a mathematical formula, known as the queuing constraint equation when it is used to find an approximation of servers...

Greenberg's conjecture is either of two conjectures in algebraic number theory proposed by Ralph Greenberg. Both are still unsolved as of 2021. The first...