ENSIKLOPEDIA Cari Tekan Enter untuk memulai pencarian cepat. Kembali ke Ensiklopedia Arsip Wikipedia Indonesia Sub-group hiding Sub-group hidingThe sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography. It was first introduced to build a 2-DNF homomorphic encryption scheme.[1] See also Non-interactive zero-knowledge proof References ↑ Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325–341 vtePublic-key cryptographyAlgorithmsInteger factorization Benaloh Blum–Goldwasser Cayley–Purser Damgård–Jurik GMR Goldwasser–Micali Naccache–Stern Paillier Rabin RSA Okamoto–Uchiyama Schmidt–Samoa Discrete logarithm BLS Cramer–Shoup DH DSA ECDH X25519 X448 ECDSA EdDSA Ed25519 Ed448 ECMQV EKE ElGamal signature scheme MQV Schnorr SPEKE SRP STS Lattice/SVP/CVP/LWE/SIS BLISS Kyber NewHope NTRUEncrypt NTRUSign RLWE-KEX RLWE-SIG Falcon Others AE CEILIDH EPOC HFE IES Lamport McEliece Merkle–Hellman Naccache–Stern knapsack cryptosystem Three-pass protocol XTR SQIsign SPHINCS+ Theory Discrete logarithm cryptography Elliptic-curve cryptography Hash-based cryptography Non-commutative cryptography RSA problem Trapdoor function Standardization CRYPTREC IEEE P1363 NESSIE NSA Suite B CNSA Post-Quantum Cryptography Topics Digital signature OAEP Fingerprint PKI Web of trust Key size Identity-based cryptography Post-quantum cryptography OpenPGP card vteCryptographyGeneral History of cryptography Outline of cryptography Classical cipher Cryptographic protocol Authentication protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key derivation function Secure Hash Algorithms Digital signature Kleptography Key (cryptography) Key exchange Key generator Key schedule Key stretching Keygen Machines Ransomware Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal channel Encryption Decryption End-to-end encryption Harvest now, decrypt later Information-theoretic security Plaintext Codetext Ciphertext Shared secret Trapdoor function Trusted timestamping Key-based routing Onion routing Garlic routing Kademlia Mix network Mathematics Cryptographic hash function Block cipher Stream cipher Symmetric-key algorithm Authenticated encryption Public-key cryptography Quantum key distribution Quantum cryptography Post-quantum cryptography Message authentication code Random numbers Steganography Category vteComputational hardness assumptionsNumber theoretic Integer factorization Phi-hiding RSA problem Strong RSA Quadratic residuosity Decisional composite residuosity Higher residuosity Group theoretic Discrete logarithm Diffie-Hellman Decisional Diffie–Hellman Computational Diffie–Hellman Pairings External Diffie–Hellman Sub-group hiding Decision linear Lattices Shortest vector problem (gap) Closest vector problem (gap) Learning with errors Ring learning with errors Short integer solution Non-cryptographic Exponential time hypothesis Unique games conjecture Planted clique conjecture This cryptography-related article is a stub. You can help Wikipedia by adding missing information.vte
