Ideal latticeIn discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient.
Substituted amphetamineSubstituted amphetamines are a class of compounds based upon the amphetamine structure; it includes all derivative compounds which are formed by replacing, or substituting, one or more hydrogen atoms in the amphetamine core structure with substituents. The compounds in this class span a variety of pharmacological subclasses, including stimulants, empathogens, and hallucinogens, among others.
Substituted tryptamineSubstituted tryptamines, or serotonin analogues, are organic compounds which may be thought of as being derived from tryptamine itself. The molecular structures of all tryptamines contain an indole ring, joined to an amino (NH2) group via an ethyl (−CH2–CH2−) sidechain. In substituted tryptamines, the indole ring, sidechain, and/or amino group are modified by substituting another group for one of the hydrogen (H) atoms. Well-known tryptamines include serotonin, an important neurotransmitter, and melatonin, a hormone involved in regulating the sleep-wake cycle.
Ring learning with errors key exchangeIn cryptography, a public key exchange algorithm is a cryptographic algorithm which allows two parties to create and share a secret key, which they can use to encrypt messages between themselves. The ring learning with errors key exchange (RLWE-KEX) is one of a new class of public key exchange algorithms that are designed to be secure against an adversary that possesses a quantum computer. This is important because some public key algorithms in use today will be easily broken by a quantum computer if such computers are implemented.
Learning with errorsIn cryptography, Learning with errors (LWE) is a mathematical problem that is widely used in cryptography to create secure encryption algorithms. It is based on the idea of representing secret information as a set of equations with errors. In other words, LWE is a way to hide the value of a secret by introducing noise to it. In more technical terms, it refers to the computational problem of inferring a linear -ary function over a finite ring from given samples some of which may be erroneous.
