INFSCI 0310 — Exam 1 Study Guide: Numbers, Bits, Modular Math & Cryptography

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/30

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core terms, mathematical definitions, algorithms, and cryptographic schemes from the INFSCI 0310 Exam 1 cheat sheet.

31 Terms

1
New cards

Natural Numbers

The set of positive counting integers: 1,2,3,…1, 2, 3, \dots.

2
New cards

Whole Numbers

The set of non-negative integers starting from zero: 0,1,2,…0, 1, 2, \dots.

3
New cards

Integers

The set of all positive, negative, and zero whole numbers: …,−2,−1,0,1,2,…\dots, -2, -1, 0, 1, 2, \dots.

4
New cards

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.

5
New cards

Byte

A unit of digital data consisting of 8 bits8\text{ bits}, providing an unsigned value range of 00 to 255255.

6
New cards

Overflow

A computational condition that occurs when an arithmetic operation produces a result that is too large to fit within the available bits.

7
New cards

Two's Complement

A system used to represent negative integers in binary, obtained for a value xx by writing xx in binary, flipping every bit, and adding 11.

8
New cards

IEEE 754 Double

A 64-bit64\text{-bit} floating-point standard consisting of 1 sign bit1\text{ sign bit}, 11 exponent bits11\text{ exponent bits}, and 52 significand/fraction bits52\text{ significand/fraction bits}, giving approximately 15–16 decimal digits15\text{--}16\text{ decimal digits} of precision.

9
New cards

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 00.

10
New cards

Truncation

The approximation method of simply dropping or removing digits past a given precision without rounding.

11
New cards

Round-off Error

Numerical computational error caused by the limited precision of finite computer representations.

12
New cards

Absolute Error

The magnitude of the difference between the true value and the computed result: ∣correct−result∣|\text{correct} - \text{result}|.

13
New cards

Relative Error

The ratio of the absolute error to the true value: ∣correct−result∣∣correct∣\frac{|\text{correct} - \text{result}|}{|\text{correct}|}.

14
New cards

Complex Conjugate

For a complex number a+bia + bi, the value a−bia - bi, which satisfies (a+bi)(a−bi)=a2+b2(a + bi)(a - bi) = a^2 + b^2.

15
New cards

Qubit

A basic unit of quantum information represented as ∣ψ⟩=α∣0⟩+β∣1⟩|\psi\rangle = \alpha|0\rangle + \beta|1\rangle, where the measurement probabilities satisfy ∣α∣2+∣β∣2=1|\alpha|^2 + |\beta|^2 = 1.

16
New cards

Divisibility (a∣ba \mid b)

A mathematical relationship meaning aa divides bb, which holds if and only if b=akb = ak for some integer kk.

17
New cards

Prime Number

A positive integer greater than 11 that possesses exactly two positive divisors: 11 and itself.

18
New cards

Relatively Prime

The relationship between two integers aa and bb when gcd⁡(a,b)=1\gcd(a, b) = 1, meaning they share no common prime factors.

19
New cards

Modulo (a mod na \bmod n)

The smallest non-negative integer remainder resulting from the division of aa by nn.

20
New cards

Modular Congruence (a≡b(modn)a \equiv b \pmod n)

An equivalence relation stating that n∣(a−b)n \mid (a - b), meaning aa and bb share the same non-negative remainder modulo nn.

21
New cards

Modular Multiplicative Inverse

An integer a−1a^{-1} satisfying a⋅a−1≡1(modn)a \cdot a^{-1} \equiv 1 \pmod n, which exists if and only if gcd⁡(a,n)=1\gcd(a, n) = 1.

22
New cards

Euclidean Algorithm

An efficient algorithm for computing the greatest common divisor (gcd⁡\gcd) of two integers through repeated division, where the last non-zero remainder equals the GCD.

23
New cards

Extended Euclidean Algorithm

An algorithm that computes integers ss and tt satisfying sa+tb=gcd⁡(a,b)sa + tb = \gcd(a, b), used to calculate the modular inverse of a mod na \bmod n when gcd⁡(a,n)=1\gcd(a, n) = 1.

24
New cards

Ring

An algebraic structure closed under addition and multiplication that includes an additive identity, additive inverses, and where multiplication distributes over addition.

25
New cards

Field

An algebraic structure that allows addition, subtraction, multiplication, and division by every non-zero element; Zp\mathbb{Z}_p is a finite field when pp is prime.

26
New cards

Shift Cipher

A monoalphabetic cipher encrypting letters as numbers via C=(P+k) mod 26C = (P + k) \bmod 26 and decrypting via P=(C−k) mod 26P = (C - k) \bmod 26.

27
New cards

Affine Cipher

A cipher defined by the encryption function C=(aP+b) mod 26C = (aP + b) \bmod 26 and decryption P=a−1(C−b) mod 26P = a^{-1}(C - b) \bmod 26, requiring gcd⁡(a,26)=1\gcd(a, 26) = 1.

28
New cards

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.

29
New cards

AES (Advanced Encryption Standard)

A symmetric block cipher adopted in 20012001 to replace DES, utilizing a block size of 128 bits128\text{ bits}, key sizes of 128128, 192192, or 256 bits256\text{ bits}, and algebraic operations over finite fields.

30
New cards

Euler's Totient Function (ϕ(n)\phi(n))

A function that counts the number of integers kk from 11 to nn such that gcd⁡(k,n)=1\gcd(k, n) = 1, satisfying ϕ(pq)=(p−1)(q−1)\phi(pq) = (p - 1)(q - 1) for distinct primes pp and qq.

31
New cards

RSA (Rivest–Shamir–Adleman)

A public-key cryptosystem with public key (n,e)(n, e) and private key d=e−1 mod ϕ(n)d = e^{-1} \bmod \phi(n), whose encryption is c=me mod nc = m^e \bmod n and whose security relies on the difficulty of factoring n=pqn = pq.