algorithmic encryption
41P versus NP problem — Unsolved problems in computer science Is P = NP ? …
42Decisional Diffie–Hellman assumption — The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic groups. It is used as the basis to prove the security of many cryptographic protocols, most… …
43Naor-Reingold Pseudorandom Function — In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… …
44Electronic trading platform — an Electronic Trading Platform being used at the Deutsche Börse In finance, an Electronic trading platform is a computer system that can be used to place orders for financial products over a network with a financial intermediary. This includes… …
45NTRUEncrypt — ist ein asymmetrisches Verschlüsselungsverfahren, das 1996 von den Mathematikern J. Hoffstein, J.Pipher und J.H. Silverman entwickelt wurde. Es basiert lose auf Gitterproblemen, die selbst mit Quantenrechnern als nicht knackbar gelten. Allerdings …
