User:Ale Qube/Books/a-Qube




WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ]

a-Qube - Research

Directed acyclic graph

Graph theory

Directed graph

Cycle graph

Topological sorting

Binary decision diagram

Strongly connected component

Graph (discrete mathematics)

Coppersmith–Winograd algorithm

Dense graph

Maximum flow problem

Longest path problem

Shortest path problem

Causal loop

Delaunay triangulation

Network science

Data structure

Interpretation (logic)

Decision tree

Vickrey auction

Incentive compatibility

Multiunit auction

Generalized second-price auction

Vickrey–Clarke–Groves auction

Expected utility hypothesis

Bayesian-optimal mechanism

Deterministic finite automaton

Nondeterministic finite automaton

State transition table

State diagram

Vertex (graph theory)

Virtual finite-state machine

Unified Modeling Language

UML state machine

Mealy machine

Moore machine

Specification and Description Language

String (computer science)

Semiring

Empty string

Finite-state transducer

DFA minimization

Implication table

Moore reduction procedure

Strategy (game theory)

Probability distribution

Equivalence class

Common knowledge (logic)

Choice function

A priori probability

Von Neumann–Morgenstern utility theorem

Combinatorial game theory

Subgame perfect equilibrium

Information set (game theory)

Singleton (mathematics)

Perfect Bayesian equilibrium

Stackelberg competition

Rock–paper–scissors

Max-dominated strategy

Determinacy

Risk dominance

Curve fitting

Function (mathematics)

Interpolation

Extrapolation

Uncertainty

Polynomial regression

Polynomial interpolation

Cloverleaf interchange

Ordinary least squares

Trigonometric functions

Parametric equation

Arc length

Least squares adjustment

Curve-fitting compaction

Estimation theory

Function approximation

Goodness of fit

Levenberg–Marquardt algorithm

Nonlinear regression

Overfitting

Smoothing

Probability distribution fitting

Spline interpolation

Smoothing spline

Time series

Linear trend estimation

Lagrange polynomial

Numerical analysis

Newton–Cotes formulas

Numerical integration

Shamir's Secret Sharing

Finite field arithmetic

Information-theoretic security

Verifiable secret sharing

Homomorphic secret sharing

Partial password

Merkle–Hellman knapsack cryptosystem

Public-key cryptography

RSA (cryptosystem)

Subset sum problem

Digital signature

Superincreasing sequence

NP-completeness

Greedy algorithm

Coprime integers

Modular multiplicative inverse

Extended Euclidean algorithm

Integer factorization

RSA problem

Symmetric-key algorithm

Primality test

Carmichael function

Fermat's little theorem

Euler's theorem

Coppersmith's attack

Semantic security

Deterministic algorithm

Chosen-ciphertext attack

Exponentiation by squaring

RSA Factoring Challenge

Integer factorization records

Shor's algorithm

Generalized Riemann hypothesis

RSA numbers

Wiener's attack

Fermat's factorization method

Pollard's p − 1 algorithm

Random number generation

Euclidean algorithm

Chinese remainder theorem

Blinding (cryptography)

Adaptive chosen-ciphertext attack

Padding (cryptography)

Optimal asymmetric encryption padding

Branch predictor

Simultaneous multithreading

Fast Fourier transform

Cryptographic protocol

Non-repudiation

Bit array

Key generation

Discrete uniform distribution

Digital Signature Algorithm

Adversary (cryptography)

Negligible function

Oracle machine

Euler's totient function

Trapdoor function

Permutation

Cryptographic hash function

Full Domain Hash

Chosen-plaintext attack

Digital signature forgery

Malleability (cryptography)

Collision resistance

Certificate revocation list

Keystroke logging

Elliptic-curve cryptography

EdDSA

ElGamal signature scheme

Schnorr signature

Pointcheval–Stern signature algorithm

Rabin signature algorithm

Pairing

Undeniable signature

Signatures with efficient protocols

Zero-knowledge proof

Secure multi-party computation

Public key infrastructure

Certificate authority

Public key certificate

Interoperability

Key escrow

Blind signature

Advanced electronic signature

Detached signature

Digital signature in Estonia

Electronic signatures and law

GNU Privacy Guard

Server-based signatures

Probabilistic signature scheme

Pseudorandom number generator

Interactive proof system

Turing machine

PP (complexity)

Probabilistic Turing machine

Computational indistinguishability

Graph isomorphism problem

Statistically close

Proof of knowledge

Witness-indistinguishable proof

Zero-knowledge password proof

Quadratic residue

Graph coloring

One-way function

Complement (complexity)

Non-interactive zero-knowledge proof

Arrow information paradox

Feige–Fiat–Shamir identification scheme

Decision problem

Computational complexity theory

Pseudo-polynomial time

Knapsack problem

Combinatorial optimization

Knapsack cryptosystems

Polynomial-time approximation scheme

Hybrid algorithm

Meet-in-the-middle attack

Baby-step giant-step

Approximation algorithm

Quadratic knapsack problem

Karp's 21 NP-complete problems

Change-making problem

Combinatorial auction

Continuous knapsack problem

Cutting stock problem

List of knapsack problems

Packing problems

Visual cryptography

Differential cryptanalysis

Cryptanalysis

Block cipher

Randomness

Data Encryption Standard

Known-plaintext attack

Ciphertext-only attack

Exclusive or

Cipher

Affine transformation

Higher-order differential cryptanalysis

Truncated differential cryptanalysis

Impossible differential cryptanalysis

Connectionless communication

Connection-oriented communication

Datagram

Transport layer

Network layer

Signaling (telecommunications)

Latency (engineering)

Asynchronous transfer mode

Message switching

Multi-bearer network