Search results

...ften have a key space of size <math>2^{128}</math> or greater, making such attacks infeasible with current technology. [[Category:Cryptographic attacks]] ...

* <math>N_A</math> and <math>N_B</math> are [[cryptographic nonce|nonces]] generated by A and B respectively ...https://apps.dtic.mil/dtic/tr/fulltext/u2/a463948.pdf A taxonomy of replay attacks]. In ''Proceedings of the 7th IEEE Computer Security Foundations Workshop'' ...

...used to decrypt or sign data. The term is generally used in the context of attacks which search memory much more efficiently than simply testing each sequence ...tecting differences in the statistical properties of the data that make up cryptographic keys while the latter relies on determining specific byte patterns that mus ...

...ort description|Cryptographic protocol designed to resist quantum computer attacks}} ...pelmann, and Peter Schwabe that is designed to resist [[quantum computer]] attacks.<ref name="cf">{{cite web|url=https://newhopecrypto.org/index.shtml|title=N ...

{{Short description|Class of cryptographic attacks}} '''Coppersmith's attack''' describes a class of [[cryptographic attack]]s on the [[public-key cryptography|public-key cryptosystem]] [[RSA ...

...erial <math>K</math>, Alice and Bob can derive a [[session key]] using a [[cryptographic hash function]]: <math>\kappa = H(K)</math>. ...vulnerable to some attacks including unknown key-share and key-replication attacks" <ref name="cryptanalysis1">{{cite journal|last=Toorani|first=Mohsen|date=3 ...

...often have to be padded (expanded) to be compatible with the underlying [[cryptographic primitive]]. The attack relies on having a "padding [[Oracle machine|oracle ...used within symmetric [[block cipher]]s.<ref name=Vau02/> Variants of both attacks continue to find success more than one decade after their original publicat ...

...cryptanalysis. The 3-subset variant opens up the possibility to apply MITM attacks on ciphers, where it is not trivial to divide the keybits into two independ ...st using double-DES and suggested [[triple-DES]] as a minimum, due to MITM attacks (Double-DES is very susceptible to a MITM attack, as DES could easily be sp ...

A limitation with MITM attacks is the amount of intermediate values that needs to be stored. In order to c A in most cases far more useful feature provided by partial-matching in MITM attacks, is the ability to compare intermediate values computed at different rounds ...

| genre = [[elliptic-curve cryptography|Elliptic-curve]] cryptographic library In order to avoid [[Small subgroup confinement attack|small subgroup attacks]],<ref>{{cite book |last1=van Oorschot |first1=Paul C. |last2=Wiener |first ...

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

...of rounds does not ''always'' make weak ciphers into strong ones, as some attacks do not depend on the number of rounds.{{sfn|Biryukov|Wagner|1999}} ...r of rounds usually chosen between 8 and 32 (with 64 and even 80 used in [[cryptographic hash]]es).{{sfn|Biryukov|2005}} ...

* <math>N_A</math> and <math>N_B</math> are [[cryptographic nonce|nonces]] generated by A and B respectively ...first4=Ming-Yung | last4=Ko | first5=Yung-Hsiang | last5=Chen | title=Two attacks on Neuman-Stubblebine authentication protocols | place=Tainan, Taiwan | yea ...

...mprovement to 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 hash function}} {{Infobox cryptographic hash function ...

{{Short description|Cryptographic attack}} A '''time/memory/data tradeoff attack''' is a type of [[cryptanalysis|cryptographic attack]] where an attacker tries to achieve a situation similar to the [[sp ...

...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. ...

{{Short description|Cryptographic attack}} ...the keystream. While some Boolean functions are vulnerable to correlation attacks, stream ciphers generated using such functions are not inherently insecure. ...

{{Short description|Cryptographic attack on the RSA system}} ...er's attack''', named after cryptologist Michael J. Wiener, is a type of [[cryptographic attack]] against [[RSA (algorithm)|RSA]]. The attack uses [[simple continue ...

The '''rebound attack''' is a tool in the [[cryptanalysis]] of [[cryptographic hash function]]s. The attack was first published in 2009 by Florian Mendel, The Rebound Attack is a type of statistical attack on [[Cryptographic hash function|hash functions]], using techniques such as [[Rotational crypt ...