User:Skysmith/Missing topics about Cryptography

Missing topics about Cryptography

Terms

 * A-distance -
 * adaptive chosen ciphertext -
 * adaptive chosen plaintext -
 * Agent authentication -
 * Aggregate signature -
 * Application cryptogram -
 * auctioneer role -
 * authorization architecture -
 * authorization policy -
 * automatic clearance house -
 * blind watermarking -
 * blinding technique -
 * bridge certification authority -
 * Bust (cryptography) -
 * Canonical 8-expression -
 * Captured agent trust -
 * Carry-forward verification -
 * Challenge-response identification -
 * Cipher alphabet -
 * Cipher Encoder cipher encoder -
 * cipher key -
 * classical cryptosystem -
 * clip scheme -
 * combination criteria -
 * communication channel anonymity -
 * compromising emanations -
 * contract signing -
 * control vector -
 * Core Messaging Platform -
 * correlation immunity and resilient Boolean functions -
 * Counter Mode -
 * Cryptodate -
 * Cryptoequipment -
 * Cryptographic contests cryptographic contest -
 * Cryptographic freedom -
 * Cryptographic function -
 * Cryptographic hardware -
 * Cryptographic information -
 * Cryptographic policy -
 * Cryptographically weak -
 * Cryptologic Technician Communications -
 * Cryptomaterial -
 * Cryptonet -
 * Cryptopart -
 * Cryptoprinciple -
 * Cryptosecurity -
 * Cryptoservice -
 * cut-and-choose protocol -
 * Data seal -
 * decryption exponent -
 * Decrypts -
 * derived key -
 * Derived Test Requirements -
 * designated confirmer -
 * Differential Workfactor Cryptography -
 * digital stenography -
 * disgraphic substitution -
 * domain parameter -
 * Doubletalk code -
 * electronic cases -
 * Electronics codebook mode (ECB) -
 * elliptic curve key -
 * elliptic curves for primarily proving -
 * Enciphered code -
 * endomorphic cryptosystem -
 * entity authentication -
 * exponential security -
 * fail-stop signature -
 * fair exchange -
 * Falois field -
 * field polynomial -
 * filter generator -
 * fixed-base exponentiation -
 * fixed-exponent exponentiation -
 * Givierge's maxim -
 * glue logic design -
 * Group key agreement -
 * High grade cryptosystem -
 * identity verification protocol -
 * Integrated equipment -
 * interactive argument -
 * inversion attack -
 * inversion in finite fields and rings -
 * Layered Subset Difference -
 * linear complexity -
 * Low-grade cryptosystem -
 * m-resilient -
 * Manipulation Detection Code (MDC) -
 * markle tree -
 * maximal-length linear sequence -
 * Message parts -
 * MIPS-year -
 * modular root -
 * Multiple anagramming -
 * Multiple channel cryptography -
 * Multiprecision multiplier -
 * multiprecision squaring -
 * nomendator -
 * noninteractive proof -
 * nonmalleable -
 * Open code (cryptography) -
 * optimal extension field -
 * optimal extension -
 * overspender detection -
 * overspending prevention -
 * paillier assumption -
 * pastry dough mixing -
 * physical attack (cryptography) -
 * playback control -
 * Police Administration Point -
 * Pontifex (cryptography) -
 * Pre-charged dual rail logic -
 * PRIMAlity problem -
 * Primality proving algorithm -
 * Prime generation -
 * probability primality test -
 * pseudo-Mersenne prime -
 * public key proxy signature -
 * quadratic residuality problem -
 * random bit generation -
 * Random key -
 * reactive defense password -
 * recipient anonymity -
 * relativity prime -
 * right-to-left exponentiation -
 * Room circuit -
 * secret sharing scheme -
 * Secure authentication -
 * security evaluation criteria -
 * security standards activation -
 * Self-Decrypting Archive -
 * self-shrinking generation -
 * sender anonymity -
 * side-channel analysis -
 * Signal center -
 * Signal security -
 * signed digit exponentiation -
 * simultaneous exponentiation -
 * sliding window exponentiation -
 * Structural cryptanalysis -
 * symmetric cryptosystem -
 * T method -
 * Tamper response -
 * Target LFSR -
 * Target of Evaluation -
 * Threshold signature -
 * time-stamping -
 * Trusted center -
 * unlinkability -
 * untraceability -
 * user authentication -
 * witness hiding -
 * Workfactor Reduction Field -
 * zero-K knowledge -
 * Zeroice –
 * Zig-zag exhaustion –

Algorithms

 * Cohen-Lenstra-Bosma algorithm -
 * Collision-Resistant Hash Function -
 * Davies-Meyer hash function -
 * exponentiation algorithm -
 * Fujiwara-Okomoto transform -
 * Hoh-Tsjujii inversion algorithm -
 * Knoth-Schroeppel function -
 * Lahmer's Euclidean algorithm -
 * MAC algorithm -
 * Meyer's-Schilling hash function -
 * Miyaguchi-Preneel hash function -
 * Modular Arithmetic Security Hash -
 * MonPro algorithm –
 * Most Advanced Cryptographic Algorithm -
 * random Davies-Meyer hash function -
 * Satoh's algorithm -
 * School's algorithm -
 * Shaw-Taylor's algorithm -
 * Software-optimized Encryption Algorithm -
 * Steiner's algorithm -

Ciphers

 * Field cipher -
 * Hydra Cipher -
 * J-19 (Japanese code) -
 * self-synchronising stream cipher -
 * synchronous stream cipher -

Encryption

 * Beaufort encryption -
 * Berlekamp Q-matrix -
 * Blum-Goldwasser public key encryption system -
 * Chaum-van Antwerpen undeniable signature scheme -
 * Chaum's Blind Signature Scheme -
 * encrypt-than-MAC -
 * Encrypted for transmission only (EFTO) -
 * encryption management -
 * Escrowed Encryption System -
 * GSM encryption -
 * malleable encryption scheme -
 * nonsecret encryption -
 * On-line cryptooperation -
 * Portar encryption -
 * probabilistic public-key encryption -
 * probability Signature-Encryption Padding -
 * Simplificant Asymmetric Encryption Padding -
 * straddling encryption -
 * triple encryption -
 * two-key triple encryption -
 * verifiable encryption -

Methods

 * basic Merkle-Hellman scheme -
 * BGMW method -
 * black-box attack -
 * Block Korkine-Zolotarev-reduction -
 * Bonch-Durfee attack –
 * Breckwell low density attack -
 * Brickell-Merkle-Hellman-attack -
 * Chosen message attack -
 * codebook attack -
 * correcting-block attack -
 * correlation attack for stream cipher -
 * Dixon's random squares method -
 * elliptic curve point multiplication using naling -
 * environmental attack -
 * fast correlation attack -
 * Gaussian integer method -
 * impersonation attack -
 * Ingemarsson-Tang-Wong protocol -
 * Lagarians and Odlyzko attack -
 * linear consistency attack -
 * linear cryptanalysis for block ciphers -
 * linear cryptanalysis for stream cipher -
 * linear syndrome attack -
 * MAC-verification attack -
 * Mauver's method -
 * May attack -
 * Merkle's meta-method -
 * multiset attack -
 * radio frequency attack -
 * resynchronization attack -
 * Schage and Strasse method –

Cryptosystems

 * Bonch-Frankelin identity based cryptosystem -
 * Chor-Rivest cryptosystem -
 * Cock's identity based cryptosystem -
 * Cyclic Reed-Muller code -
 * elliptic curve key agreement scheme -
 * elliptic curve public-key encryption scheme -
 * elliptic curve signature scheme -
 * Feige-Fiat-Shamir Signature scheme -
 * Fiat-Shamir signature scheme -
 * Fischlin scheme -
 * Gennaro-Halevi-Rabin scheme -
 * Guillong-Quisquater signature scheme -
 * MOV key agreement scheme -
 * Nyberg-Rueppel signature scheme -
 * Paillier signature scheme -
 * Rabin digital signature scheme -
 * RSA digital signature scheme -
 * Shamir's threshold scheme -
 * Visual secret sharing scheme –

Related technology

 * B-21 (machine), cipher machine -
 * clock-controlled generator -
 * Computer encryption -
 * Crypto machine -
 * Cryptodevice -
 * factoring circuit -
 * M-109 cipher machine -

Cryptographers

 * Alan Konheim, IBM cryptographic expert-
 * Carl Hammer, US pioneer of computer cryptanalysis-
 * Jacques Cohorry, cryptographer -
 * Jim Reeds, US cryptographer -
 * Loren Coleman (cryptologist), US cryptologist - -
 * Louis Kruh, US cryptographer –

Miscellaneous

 * Bilinear Diffie-Hellman problem -
 * Blum-Blum-Shub pseudorandom bit generator -
 * Burmester-Desmedt protocol -
 * CEPS standard -
 * Cryptographic coprocessor -
 * DC Network -
 * Della Porta's maxim -
 * Draft-Vandewalle-Govaerts knapsack -
 * EEC challenge -
 * Frobenius-Grantham privacy test -
 * Golomb's randomness postulate -
 * Group Computational Diffie-Hellman assumptions -
 * Hellmann's time-memory trade-off -
 * Jacobi-Sum Test -
 * Jenning generator -
 * Kahn's maxim -
 * Kerchoff's maxim -
 * LBS short digital signature -
 * Lucas probable prime test -
 * Mattson-Solomon polynomial -
 * Maurer's universal statistical test -
 * McGrew-Sherman OFT protocol -
 * Merkle-Hellman dominance -
 * Merkle-Hellman transformation -
 * Merkle-Hellman trapdoor -
 * Montgomery arithmetic -
 * Naor-Yung double encryption paradigm -
 * privacy and encryption -
 * RACE project -
 * Read-Muller codes -
 * Rohrbach's maxim maximum-length linear sequence -
 * Rohrback's maxim -
 * ServerHello -
 * Shannon's model -
 * Smartcard tamper resistance -
 * WAKE-ROFB -
 * Wegman-Carter construction -
 * Weizmann Institute Relation Location -
 * Xedni calculus -
 * Yoyo-game –
 * Zero-knowledge key exchange -


 * Other missing articles