Minimal idealIn the branch of abstract algebra known as ring theory, a minimal right ideal of a ring R is a non-zero right ideal which contains no other non-zero right ideal. Likewise, a minimal left ideal is a non-zero left ideal of R containing no other non-zero left ideals of R, and a minimal ideal of R is a non-zero ideal containing no other non-zero two-sided ideal of R . In other words, minimal right ideals are minimal elements of the partially ordered set (poset) of non-zero right ideals of R ordered by inclusion.
Post-quantum cryptographyIn cryptography, post-quantum cryptography (PQC) (sometimes referred to as quantum-proof, quantum-safe or quantum-resistant) refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against a cryptanalytic attack by a quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem.
Ideal theoryIn mathematics, ideal theory is the theory of ideals in commutative rings. While the notion of an ideal exists also for non-commutative rings, a much more substantial theory exists only for commutative rings (and this article therefore only considers ideals in commutative rings.) Throughout the articles, rings refer to commutative rings. See also the article ideal (ring theory) for basic operations such as sum or products of ideals.
Fractional idealIn mathematics, in particular commutative algebra, the concept of fractional ideal is introduced in the context of integral domains and is particularly fruitful in the study of Dedekind domains. In some sense, fractional ideals of an integral domain are like ideals where denominators are allowed. In contexts where fractional ideals and ordinary ring ideals are both under discussion, the latter are sometimes termed integral ideals for clarity. Let be an integral domain, and let be its field of fractions.
Maximum length sequenceA maximum length sequence (MLS) is a type of pseudorandom binary sequence. They are bit sequences generated using maximal linear-feedback shift registers and are so called because they are periodic and reproduce every binary sequence (except the zero vector) that can be represented by the shift registers (i.e., for length-m registers they produce a sequence of length 2m − 1). An MLS is also sometimes called an n-sequence or an m-sequence. MLSs are spectrally flat, with the exception of a near-zero DC term.
Random walkIn mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space. An elementary example of a random walk is the random walk on the integer number line which starts at 0, and at each step moves +1 or −1 with equal probability. Other examples include the path traced by a molecule as it travels in a liquid or a gas (see Brownian motion), the search path of a foraging animal, or the price of a fluctuating stock and the financial status of a gambler.
Radical of an idealIn ring theory, a branch of mathematics, the radical of an ideal of a commutative ring is another ideal defined by the property that an element is in the radical if and only if some power of is in . Taking the radical of an ideal is called radicalization. A radical ideal (or semiprime ideal) is an ideal that is equal to its radical. The radical of a primary ideal is a prime ideal. This concept is generalized to non-commutative rings in the Semiprime ring article.
Elliptic-curve cryptographyElliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security. Elliptic curves are applicable for key agreement, digital signatures, pseudo-random generators and other tasks. Indirectly, they can be used for encryption by combining the key agreement with a symmetric encryption scheme.
Circuit underutilizationCircuit underutilization also chip underutilization, programmable circuit underutilization, gate underutilization, logic block underutilization refers to a physical incomplete utility of semiconductor grade silicon on a standardized mass-produced circuit programmable chip, such as a gate array type ASIC, an FPGA, or a CPLD. In the example of a gate array, which may come in sizes of 5,000 or 10,000 gates, a design which utilizes even 5,001 gates would be required to use a 10,000 gate chip.
Logic gateA logic gate is an idealized or physical device that performs a Boolean function, a logical operation performed on one or more binary inputs that produces a single binary output. Depending on the context, the term may refer to an ideal logic gate, one that has, for instance, zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device (see ideal and real op-amps for comparison). In the real world, the primary way of building logic gates uses diodes or transistors acting as electronic switches.
