For 10 points, name this group of integers that satisfy Fermat's Little Theorem despite being composite.
Huthnance and Warndof showed that if one of these is used as the modulus of an RSA encryption scheme, the cryptosystem still works as intended, but is more vulnerable to attacks. Any solution to Lehmer's Totient Problem is one of these numbers, which satisfy Korselt's criterion. In order for a number n to be one, it must be able divide the denominator of n minus oneth Bernoulli number. Richard Pinch is known for finding their distribution up to 10 to the 20th power, and in 1994 a team led by Alfred showed that there are infinitely many of them. Besides being squarefree and having at least three prime factors, these numbers also satisfy the congruence a to the n congruent to a modulus n, where n is one of these and a is any integer; thus, these numbers are an exception to a primality test named after a French mathematician. For 10 points, name this group of integers that satisfy Fermat's Little Theorem despite being composite.
Huthnance and Warndof showed that if one of these is used as the modulus of an RSA encryption scheme, the cryptosystem still works as intended, but is more vulnerable to attacks.
{Carmichael} numbers or {absolute Fermat pseudoprimes} [prompt on {pseudoprimes}]