Search results

In [[cryptography]], a '''distributed point function''' is a [[cryptographic primitive]] that allows two distributed processes to share a piece of infor ...nown how to construct an efficient distributed point function from another cryptographic primitive, a [[one-way function]].{{r|gi}} ...

...used to model or implement many [[cryptographic primitive]]s, including [[cryptographic hash]]es, [[message authentication codes]], [[mask generation function]]s, ...ponge functions capture more of the practical limitations of cryptographic primitives than does the widely used [[random oracle]] model, in particular the finite ...

{{Short description|Cryptographic tool}} ...ration function''' ('''MGF''') is a cryptographic primitive similar to a [[cryptographic hash function]] except that while a hash function's output has a fixed size ...

{{short description|Proposed cryptographic primitive}} In [[cryptography]], '''black-box obfuscation''' was a proposed [[cryptographic primitive]] which would allow a [[computer program]] to be [[obfuscation (s ...

...solving the claw finding problem provides a better attack on cryptographic primitives such as [[hash function]]s. * [[Collision attack|Collision]] finding on cryptographic [[hash function]]s. ...

{{Short description|Cryptographic primitive}} [[Category:Cryptographic primitives]] ...

...nterest in cryptography because they are strongly related to cryptographic primitives such as [[One-way function|one-way permutations]] and [[Collision resistanc ...ty classes can be used to determine the existence of certain cryptographic primitives, and vice versa. ...

...sct1/libhydrogen libhydrogen]: a cryptographic library that constructs all primitives using Gimli and [[Curve25519]] [[Category:Cryptographic hash functions]] ...

| genre = [[elliptic-curve cryptography|Elliptic-curve]] cryptographic library == Cryptographic properties == ...

...s, and [[matrix group]]s have been identified as potential candidates for cryptographic applications. In contrast to non-commutative cryptography, the currently wi ...ommutative cryptographic protocols have been developed for solving various cryptographic problems like [[key exchange]], [[encryption]]-decryption, and [[authentica ...

...or]] and [[Omer Reingold]] described efficient constructions for various [[cryptographic primitive]]s in private key as well as [[public-key cryptography]]. Their r ...'Naor–Reingold''' function can be used as the basis of many [[cryptography|cryptographic]] schemes including [[Symmetric-key algorithm|symmetric encryption]], [[au ...

...following tables compare general and technical information for a number of cryptographic hash functions. See the individual functions' articles for further informat Basic general information about the [[cryptographic hash function]]s: year, designer, references, etc. ...

...erial <math>K</math>, Alice and Bob can derive a [[session key]] using a [[cryptographic hash function]]: <math>\kappa = H(K)</math>. The use of well-established zero-knowledge proof primitives such as Schnorr's scheme greatly simplifies the security proofs. Given that ...

{{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...

...ing)|multithreading]] systems, [[Systems biology|biological]] systems, and cryptographic protocols. ...ls and languages, such as [[Linda (coordination language)|Linda]], provide primitives that must be incorporated within a computation for its coordination. ...

{{short description|Constructions of cryptographic primitives that involve lattices}} '''Lattice-based cryptography''' is the generic term for constructions of [[cryptographic primitive]]s that involve [[Lattice (group)|lattices]], either in the const ...

Functional encryption generalizes several existing primitives including [[ID-based encryption|Identity-based encryption]] (IBE) and [[att ...05: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings|date=2005 | editor= Ronald Cramer |publisher=Spring ...

...id=18643410|bibcode=2008PhRvL.100v0502W|s2cid=2974264}}</ref> refers to a cryptographic model employed in [[quantum cryptography]]. It assumes that the quantum mem ...is model is to enable the secure implementation of two-party cryptographic primitives, such as [[bit commitment]], [[oblivious transfer]] and [[Smart Card#Applic ...

...r of rounds usually chosen between 8 and 32 (with 64 and even 80 used in [[cryptographic hash]]es).{{sfn|Biryukov|2005}} [[Category:Cryptographic primitives]] ...

LEA is one of the cryptographic algorithms approved by the Korean Cryptographic Module Validation Program (KCMVP) and is the national standard of Republic ...rk for evaluation of software implementations of lightweight cryptographic primitives. ...