1/30
Vocabulary flashcards covering core terms, mathematical definitions, algorithms, and cryptographic schemes from the INFSCI 0310 Exam 1 cheat sheet.
Natural Numbers
The set of positive counting integers: 1,2,3,….
Whole Numbers
The set of non-negative integers starting from zero: 0,1,2,….
Integers
The set of all positive, negative, and zero whole numbers: …,−2,−1,0,1,2,….
Closed Set
A mathematical set under one or more operations where performing those operations on elements of the set always yields a result that remains inside the set.
Byte
A unit of digital data consisting of 8 bits, providing an unsigned value range of 0 to 255.
Overflow
A computational condition that occurs when an arithmetic operation produces a result that is too large to fit within the available bits.
Two's Complement
A system used to represent negative integers in binary, obtained for a value x by writing x in binary, flipping every bit, and adding 1.
IEEE 754 Double
A 64-bit floating-point standard consisting of 1 sign bit, 11 exponent bits, and 52 significand/fraction bits, giving approximately 15–16 decimal digits of precision.
Underflow
A condition in floating-point computation where a calculated number is smaller in magnitude than the smallest representable non-zero number, often resulting in 0.
Truncation
The approximation method of simply dropping or removing digits past a given precision without rounding.
Round-off Error
Numerical computational error caused by the limited precision of finite computer representations.
Absolute Error
The magnitude of the difference between the true value and the computed result: ∣correct−result∣.
Relative Error
The ratio of the absolute error to the true value: ∣correct∣∣correct−result∣.
Complex Conjugate
For a complex number a+bi, the value a−bi, which satisfies (a+bi)(a−bi)=a2+b2.
Qubit
A basic unit of quantum information represented as ∣ψ⟩=α∣0⟩+β∣1⟩, where the measurement probabilities satisfy ∣α∣2+∣β∣2=1.
Divisibility (a∣b)
A mathematical relationship meaning a divides b, which holds if and only if b=ak for some integer k.
Prime Number
A positive integer greater than 1 that possesses exactly two positive divisors: 1 and itself.
Relatively Prime
The relationship between two integers a and b when gcd(a,b)=1, meaning they share no common prime factors.
Modulo (amodn)
The smallest non-negative integer remainder resulting from the division of a by n.
Modular Congruence (a≡b(modn))
An equivalence relation stating that n∣(a−b), meaning a and b share the same non-negative remainder modulo n.
Modular Multiplicative Inverse
An integer a−1 satisfying a⋅a−1≡1(modn), which exists if and only if gcd(a,n)=1.
Euclidean Algorithm
An efficient algorithm for computing the greatest common divisor (gcd) of two integers through repeated division, where the last non-zero remainder equals the GCD.
Extended Euclidean Algorithm
An algorithm that computes integers s and t satisfying sa+tb=gcd(a,b), used to calculate the modular inverse of amodn when gcd(a,n)=1.
Ring
An algebraic structure closed under addition and multiplication that includes an additive identity, additive inverses, and where multiplication distributes over addition.
Field
An algebraic structure that allows addition, subtraction, multiplication, and division by every non-zero element; Zp is a finite field when p is prime.
Shift Cipher
A monoalphabetic cipher encrypting letters as numbers via C=(P+k)mod26 and decrypting via P=(C−k)mod26.
Affine Cipher
A cipher defined by the encryption function C=(aP+b)mod26 and decryption P=a−1(C−b)mod26, requiring gcd(a,26)=1.
Kerckhoffs' Principle
The cryptographic principle stating that the security of a cryptosystem must depend only on the secrecy of the key, not on the secrecy of the algorithm.
AES (Advanced Encryption Standard)
A symmetric block cipher adopted in 2001 to replace DES, utilizing a block size of 128 bits, key sizes of 128, 192, or 256 bits, and algebraic operations over finite fields.
Euler's Totient Function (ϕ(n))
A function that counts the number of integers k from 1 to n such that gcd(k,n)=1, satisfying ϕ(pq)=(p−1)(q−1) for distinct primes p and q.
RSA (Rivest–Shamir–Adleman)
A public-key cryptosystem with public key (n,e) and private key d=e−1modϕ(n), whose encryption is c=memodn and whose security relies on the difficulty of factoring n=pq.