Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...mprovement to solving the claw finding problem provides a better attack on cryptographic primitives such as [[hash function]]s. ==Algorithms== ...
    4 KB (581 words) - 08:17, 25 May 2023
  • {{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 ...
    7 KB (1,015 words) - 15:58, 14 October 2024
  • ...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 ...
    7 KB (988 words) - 02:38, 6 February 2025
  • {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...
    13 KB (1,961 words) - 23:56, 19 October 2024
  • {{Short description|Cryptographic primitive}} [[Category:Cryptographic primitives]] ...
    4 KB (515 words) - 04:03, 22 March 2024
  • ...isbn = 978-1-4419-5905-8}}</ref> These primes allow fast modular reduction algorithms and are widely used in [[cryptography]]. They are named after Jerome Solina ...32 |status=patent |title=Method and apparatus for public key exchange in a cryptographic system |gdate=1992-10-27 |fdate=1991-09-17 |pridate= |invent1= Richard E. C ...
    4 KB (703 words) - 18:45, 20 April 2024
  • ...This design makes it easy to reuse Ascon in multiple ways (as a cipher, [[cryptographic hash|hash]], or a [[Message authentication code|MAC]]).{{sfn|Dobraunig|Eich * Ascon-Hash cryptographic hash; ...
    8 KB (1,197 words) - 10:53, 27 November 2024
  • ...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. ...
    16 KB (1,865 words) - 21:08, 6 August 2024
  • {{number theoretic algorithms}} [[Category:Algorithms]] ...
    4 KB (696 words) - 22:04, 20 January 2025
  • ...gorithm binding conditions" which are intended to reduce the risk of other algorithms developed to solve the underlying birthday problem being applicable. A memo [[Category:Cryptographic algorithms]] ...
    6 KB (786 words) - 19:36, 15 November 2024
  • {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...
    14 KB (2,067 words) - 04:37, 24 August 2024
  • {{Short description|Cryptographic hash function}} {{Infobox cryptographic hash function ...
    11 KB (1,708 words) - 18:39, 7 January 2025
  • ==Algorithms and examples== ...ithms of the addition and doubling law are given; they can be important in cryptographic computations, and the projective coordinates are used to this purpose. ...
    7 KB (1,032 words) - 20:45, 23 December 2024
  • ...attack by a quantum cryptography. Several post quantum digital signature algorithms based on hard problems in lattices are being created replace the commonly u ...all of the widely used [[Public-key cryptography|public key]] cryptography algorithms used to protect privacy and digitally sign information on the internet.<ref ...
    19 KB (2,907 words) - 17:32, 15 September 2024
  • {{Short description|Covert cryptographic channel}} ...UROCRYPT 84 workshop on Advances in Cryptology – theory and application of cryptographic techniques, pages 364–378, New York, NY, USA, 1985. Springer-Verlag New Yor ...
    11 KB (1,634 words) - 16:55, 16 April 2024
  • {{short description|Cryptographic vulnerability}} The '''ROCA vulnerability''' is a [[Cryptography|cryptographic]] weakness that allows the private key of a [[Public-key cryptography|key p ...
    10 KB (1,364 words) - 03:49, 15 January 2025
  • LEA is one of the cryptographic algorithms approved by the Korean Cryptographic Module Validation Program (KCMVP) and is the national standard of Republic ...arking framework for evaluation of software implementations of lightweight cryptographic primitives. ...
    19 KB (2,649 words) - 15:58, 26 January 2024
  • ...nd then assigned the same time value. Aggregation creates a [[Cryptography|cryptographic]] connection between all involved requests; the authenticating aggregate va :Linking creates a verifiable and ordered cryptographic link between the current and already issued time-stamp tokens. ...
    13 KB (1,730 words) - 04:20, 21 August 2023
  • ...e-based cryptography|lattices]]. Unlike older lattice based cryptographic algorithms, the [[ring learning with errors|RLWE]]-KEX is provably reducible to a know ...[[quantum computer]] of sufficient size were built, all of the public key algorithms based on these three classically hard problems would be insecure. This pub ...
    23 KB (3,540 words) - 00:09, 31 August 2024
  • {{Short description|Family of cryptographic hash functions}} {{Infobox cryptographic hash function ...
    19 KB (2,944 words) - 20:50, 12 August 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)