Search results

Jump to navigation Jump to search

Page title matches

  • In mathematics or computer science, an '''algorithm''' is a sequence of steps for one particular method of solving a problem, s ...s, preferably data maintained in a consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on w
    2 KB (286 words) - 07:49, 10 February 2021
  • ...orithm''' is the best known and most widely used [[public key]] encryption algorithm. Like any public key system, it can be used to create [[digital signature]] The algorithm was patented <ref>{{US patent|4405829}}</ref> in 1983 by [[MIT]], but relea
    7 KB (1,171 words) - 05:48, 8 April 2024
  • 12 bytes (1 word) - 11:05, 24 September 2007
  • <!-- Text is transcluded from the Algorithm (finance)/Definition subpage-->
    88 bytes (11 words) - 05:21, 12 July 2010
  • The '''Naranjo algorithm''' is a questionnaire designed by Naranjo ''et al''<ref name="pmid7249508"> * [http://mqa.dhs.state.tx.us/QMWeb/MedSim/Naranjo.htm Naranjo algorithm]
    3 KB (432 words) - 17:35, 10 February 2024
  • 80 bytes (12 words) - 19:52, 20 May 2008
  • ...or finding the [[greatest common divisor]] (gcd) of two [[integer]]s. The algorithm does not require [[prime number|prime factorizations]] and runs efficiently == The algorithm ==
    7 KB (962 words) - 12:05, 3 May 2016
  • | title = The advent of the algorithm : the idea that rules the world
    1 KB (212 words) - 17:42, 20 February 2012
  • #REDIRECT[[Euclidean algorithm]]
    32 bytes (3 words) - 14:37, 8 August 2007
  • 182 bytes (25 words) - 05:20, 12 July 2010
  • A widely used [[public key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.
    152 bytes (19 words) - 18:53, 29 July 2010
  • 12 bytes (1 word) - 11:47, 26 September 2007
  • 39 bytes (4 words) - 06:05, 28 November 2008
  • 39 bytes (4 words) - 07:25, 29 November 2008
  • 12 bytes (1 word) - 12:13, 18 January 2008
  • ...://mathworld.wolfram.com/Algorithm.html Mathworld]<span> - Definition of ''algorithm'' on Mathworld.
    1 KB (150 words) - 07:48, 10 February 2021
  • Algorithm for finding the greatest common divisor of two integers
    101 bytes (13 words) - 15:31, 20 May 2008
  • The '''Tiny Encryption Algorithm''', or '''TEA''' | title = TEA, a Tiny Encryption Algorithm
    3 KB (367 words) - 05:49, 8 April 2024
  • 255 bytes (37 words) - 17:34, 10 February 2024
  • {{r|Euclidean algorithm}}
    888 bytes (123 words) - 17:03, 13 July 2008
  • 259 bytes (33 words) - 18:53, 29 July 2010
  • The '''International Data Encryption Algorithm''' or '''IDEA'''
    4 KB (558 words) - 05:49, 8 April 2024
  • Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human. {{r|Algorithm}}
    618 bytes (80 words) - 16:24, 11 January 2010
  • Auto-populated based on [[Special:WhatLinksHere/Naranjo algorithm]]. Needs checking by a human.
    500 bytes (64 words) - 18:51, 11 January 2010
  • 190 bytes (27 words) - 00:46, 1 October 2009
  • 176 bytes (23 words) - 14:27, 22 May 2011
  • #REDIRECT[[Euclidean algorithm]]
    32 bytes (3 words) - 18:44, 6 May 2007
  • #REDIRECT[[Euclidean algorithm]]
    32 bytes (3 words) - 15:00, 8 August 2007

Page text matches

  • ...cipher, named because it applies the Data Encryption Standard (DES) cipher algorithm three times to each data block.
    223 bytes (32 words) - 00:50, 1 October 2009
  • ...res/lec20/lec20.htm Cornell University lecture on Dijkstra's Shortest Path Algorithm] ...c.jp/ikeda/suuri/dijkstra/Dijkstra.shtml Shortest Path Problem: Dijkstra's Algorithm]
    406 bytes (51 words) - 19:42, 12 October 2013
  • ...text]], a form unintelligible to any recipient that does not know both the algorithm and a randomizing factor called a [[cryptographic key]]
    352 bytes (48 words) - 22:02, 31 July 2008
  • #REDIRECT [[RSA algorithm]]
    27 bytes (3 words) - 18:56, 29 July 2010
  • #REDIRECT [[RSA algorithm]]
    27 bytes (3 words) - 18:55, 29 July 2010
  • #REDIRECT [[RSA algorithm]]
    27 bytes (3 words) - 18:59, 29 July 2010
  • #REDIRECT[[Euclidean algorithm]]
    32 bytes (3 words) - 18:44, 6 May 2007
  • #REDIRECT [[RSA algorithm]]
    27 bytes (3 words) - 18:53, 29 July 2010
  • #REDIRECT[[Euclidean algorithm]]
    32 bytes (3 words) - 14:37, 8 August 2007
  • #REDIRECT[[Euclidean algorithm]]
    32 bytes (3 words) - 15:00, 8 August 2007
  • #REDIRECT [[RSA algorithm/Definition]]
    38 bytes (4 words) - 18:53, 29 July 2010
  • #REDIRECT [[RSA algorithm/Related Articles]]
    44 bytes (5 words) - 18:53, 29 July 2010
  • {{r|International Data Encryption Algorithm}} {{r|RSA algorithm}}
    251 bytes (31 words) - 18:32, 13 March 2024
  • A widely used sorting algorithm invented by Hoare.
    86 bytes (11 words) - 02:15, 14 November 2010
  • <!-- Text is transcluded from the Algorithm (finance)/Definition subpage-->
    88 bytes (11 words) - 05:21, 12 July 2010
  • The study of [[nervous system]]s with [[algorithm]]ic approaches.
    101 bytes (13 words) - 08:30, 14 September 2009
  • Algorithm for finding the greatest common divisor of two integers
    101 bytes (13 words) - 15:31, 20 May 2008
  • Data structured in a way that they lend themselves to [[algorithm]]ic analysis.
    115 bytes (16 words) - 16:07, 31 March 2010
  • ...case of multiple encryption, ciphertext is still the result of applying an algorithm and key to ciphertext produced by a different cryptosystem.
    411 bytes (57 words) - 18:12, 28 July 2008
  • Methods for attacking the Rivest, Shamir and Adleman public-key cryptography algorithm.
    124 bytes (14 words) - 06:55, 1 October 2009
  • In mathematics or computer science, an '''algorithm''' is a sequence of steps for one particular method of solving a problem, s ...s, preferably data maintained in a consistent [[data structure]]. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on w
    2 KB (286 words) - 07:49, 10 February 2021
  • A widely used [[public key]] encryption algorithm whose strength depends on the difficulty of integer factorisation.
    152 bytes (19 words) - 18:53, 29 July 2010
  • An algorithm that sequences elements of a list in a certain order.
    103 bytes (15 words) - 19:33, 4 September 2009
  • Value used by a computer together with a complex algorithm to encrypt and decrypt messages.
    128 bytes (18 words) - 06:28, 4 September 2009
  • The result of applying a [[encryption]] algorithm and an [[encryption key]] to [[plaintext]]]
    129 bytes (16 words) - 18:11, 28 July 2008
  • ...est known for his PhD thesis design of the [[International Data Encryption Algorithm]] at [[ETH Zurich]] under advisor [[James Massey]].
    191 bytes (24 words) - 14:23, 22 May 2011
  • Auto-populated based on [[Special:WhatLinksHere/Euclidean algorithm]]. Needs checking by a human. {{r|Algorithm}}
    618 bytes (80 words) - 16:24, 11 January 2010
  • ...ptography|Cryptographer]] who teaches at [[MIT]], co-inventor of the [[RSA algorithm]], the most widely used public key encryption technique.
    182 bytes (22 words) - 20:04, 29 July 2010
  • In [[computer graphics]], an algorithm for constructing a 3D surface mesh from scalar 3D data, e.g. as obtained fr
    170 bytes (24 words) - 05:15, 5 February 2010
  • An algorithm that produces a fixed-size digest from an input of essentially arbitrary si
    127 bytes (17 words) - 01:10, 27 November 2008
  • *[[Evolutionary algorithm]] *[[Genetic algorithm]]
    1 KB (106 words) - 12:08, 15 November 2008
  • {{r|Diamond-square algorithm}} {{r|Box-counting algorithm}}
    1 KB (184 words) - 06:32, 3 February 2010
  • ...], [[image processing|processing]] or interpreting of images by means of [[algorithm]]s executed on a [[computer]].
    176 bytes (22 words) - 16:46, 7 September 2010
  • '''Quicksort''' is a sorting [[algorithm]] developed by C. A. R. Hoare. ...ter moving the pivot value between the two separated groups, the quicksort algorithm is recursivly performed on the smaller groups.
    1 KB (181 words) - 09:18, 14 September 2013
  • * [[International Data Encryption Algorithm]], a topic in [[cryptography]]
    212 bytes (26 words) - 12:51, 31 May 2009
  • ...te]]; basic of [[Open Shortest Path First]]; sometimes called the Dijkstra algorithm
    217 bytes (28 words) - 10:40, 23 October 2009
  • "Euclid's algorithm": 98% "Euclid's Algorithm": 2%
    739 bytes (70 words) - 17:12, 10 May 2007
  • ...[[Clipper chip]]. It was to be used only in tamperproof hardware, and the algorithm was originally classified. This added to the controversy, with many people ...Feistel cipher]] with 64-bit blocks, an 80-bit key and 32 rounds. Once the algorithm was public, the first paper describing an attack on a reduced-round version
    1 KB (187 words) - 05:48, 8 April 2024
  • ...student [[Xuejia Lai]], co-designer of the [[International Data Encryption Algorithm]].
    197 bytes (24 words) - 14:30, 22 May 2011
  • Bioinformatics algorithm for comparing primary biological sequence information, such as the amino-ac
    208 bytes (25 words) - 02:09, 5 September 2009
  • ..., [[El Gamal]] (encrypt-only, not for signatures), and [[Digital Signature Algorithm]]. Supported [[block cipher]]s are [[IDEA]], [[Triple DES]], [[CAST-128]],
    910 bytes (125 words) - 05:49, 8 April 2024
  • The [[algorithm]]ic representation of one surface (e.g. that of the [[earth]]) on another (
    150 bytes (24 words) - 08:12, 1 March 2010
  • ...nted by Joan Daemen and Vincent Rijmen, and a forerunner to the [[Rijndael algorithm]], which has been adopted as the [[Advanced Encryption Standard]].
    211 bytes (29 words) - 17:13, 22 January 2010
  • ...in the field of [[geometry]]. Most problems involve efficient and robust [[algorithm]]s which can be executed on a computer.
    210 bytes (28 words) - 19:05, 12 February 2008
  • Sequential procedure or algorithm for constructing a set of mutually orthogonal vectors from a given set of l
    173 bytes (23 words) - 12:20, 22 January 2009
  • ...d and some preset algorithm can be performed on the base sized input. The algorithm then performs some function on the separate parts which have already been p
    789 bytes (131 words) - 10:30, 13 February 2009
  • ...r algebra]], Gram-Schmidt orthogonalization is a sequential procedure or [[algorithm]] for constructing a set of mutually orthogonal [[vector space|vectors]] fr ==The Gram-Schmidt orthogonalization algorithm==
    2 KB (301 words) - 06:39, 21 October 2007
  • ...eristics and generation of data which, in combination with a cryptographic algorithm, introduces or removes the concealment applied to [[plaintext]] or taken to
    346 bytes (45 words) - 11:07, 30 October 2008
  • <!--A function which subsumes the functionality of a large number of algorithm-based functions in other systems.!-->
    255 bytes (39 words) - 07:52, 5 July 2011
  • ...eterministic, is based upon how the tags respond during the anti-collision algorithm. ...dentification number. The simplest deterministic scheme is the binary tree algorithm.
    3 KB (407 words) - 21:13, 21 February 2009
View (previous 50 | ) (20 | 50 | 100 | 250 | 500)