Results 1  10
of
1,285
ON THE DISTRIBUTION OF HAWKINS ’ RANDOM “PRIMES”
"... Abstract. Hawkins introduced a probabilistic version of Erathostenes ’ sieve and studied the associated sequence of random “primes ” (pk)k≥1. Using various probabilistic techniques, many authors have obtained sharp results concerning these random “primes”, which are often in agreement with certain ..."
Abstract
 Add to MetaCart
Abstract. Hawkins introduced a probabilistic version of Erathostenes ’ sieve and studied the associated sequence of random “primes ” (pk)k≥1. Using various probabilistic techniques, many authors have obtained sharp results concerning these random “primes”, which are often in agreement
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 1277 (4 self)
 Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical
The Generation of Large Random Prime Numbers
, 1999
"... p = 561. Wait a second. You might be asking yourself how I plan to raise 2 to the 560th power. The answer is by using the repeated squares method. I calculate a table of values for 2 2 k by computing 2 2 k 1 2 (mod 561) for 0 k log 2 561. I know that 2 560 = 2 512 2 32 2 16 = ..."
Abstract
 Add to MetaCart
p = 561. Wait a second. You might be asking yourself how I plan to raise 2 to the 560th power. The answer is by using the repeated squares method. I calculate a table of values for 2 2 k by computing 2 2 k 1 2 (mod 561) for 0 k log 2 561. I know that 2 560 = 2 512 2 32 2 16 = 2 2 9 2 2 5 2 2 4 , so I just multiply the correct values together from our table, compute the modulous, and I'm done. Let's work this out as an example. k 2 2 k (mod 561) 0 2 1 4 2 16 3 256 4 460 5 103 6 511 7 256 8 460 9 103 2 560 = 2 2 9 2 2 5 2<F5.
On the time course of perceptual choice: the leaky competing accumulator model
 PSYCHOLOGICAL REVIEW
, 2001
"... The time course of perceptual choice is discussed in a model based on gradual and stochastic accumulation of information in nonlinear decision units with leakage (or decay of activation) and competition through lateral inhibition. In special cases, the model becomes equivalent to a classical diffus ..."
Abstract

Cited by 480 (19 self)
 Add to MetaCart
diffusion process, but leakage and mutual inhibition work together to address several challenges to existing diffusion, randomwalk, and accumulator models. The model provides a good account of data from choice tasks using both timecontrolled (e.g., deadline or response signal) and standard reaction time
The reviewing of object files: Object specific integration of information
 Cognitive Psychology
, 1992
"... A series of experiments explored a form of objectspecific priming. In all experiments a preview field containing two or more letters is followed by a target letter that is to be named. The displays are designed to produce a perceptual interpretation of the target as a new state of an object that pr ..."
Abstract

Cited by 462 (4 self)
 Add to MetaCart
A series of experiments explored a form of objectspecific priming. In all experiments a preview field containing two or more letters is followed by a target letter that is to be named. The displays are designed to produce a perceptual interpretation of the target as a new state of an object
Polyalphabetic Symmetric Key Algorithm Using Randomized Prime Numbers
"... Abstract Cryptography is an art and science. It is a playing major role in information and security division. The main aim of the cryptography is protecting the data from unauthorized users or hackers. “Cryptography is subject contains two parts one is encryption and another one decryption. Encrypt ..."
Abstract
 Add to MetaCart
Abstract Cryptography is an art and science. It is a playing major role in information and security division. The main aim of the cryptography is protecting the data from unauthorized users or hackers. “Cryptography is subject contains two parts one is encryption and another one decryption. Encryption is a process converting the plain text to cipher text using some keys. Decryption is a process of converting the cipher text to plain text using the keys”. There are several algorithms in cryptography to encode and decode the data based on the key. This paper discusses types of cryptography and different keys in cryptography. The paper can give brief description about symmetric key algorithms and we are proposing new algorithm in symmetric key cryptography. The proposed algorithm contains two levels of Exclusive OR (XOR) operation. This algorithm is useful in transmission of messages and data between one user and another. situation the both parties use the additional key, which is common to both parties. First they will do the encryption or decryption with the same key, and again do the encryption or decryption with their own key. Example for public key algorithms is RSA, Diffie Hellman key exchange protocol. B. Symmetric key algorithms Symmetric algorithms is also called as secrete key algorithms. In secrete key algorithms both parties (Sender, Receiver) will use the same key to encrypt or decrypt the data. Example for symmetric key algorithms is DES, AES, Triple DES, and Blowfish.
Chapter 16 RNASeq Analysis of Gene Expression and Alternative Splicing by DoubleRandom Priming Strategy
"... Transcriptome analysis by deep sequencing, more commonly known as RNAseq is, becoming the method of choice for gene discovery and quantitative splicing detection. We published a doublerandom priming RNAseq approach capable of generating strandspecific information [Li et al., Proc Natl Acad Sci U ..."
Abstract
 Add to MetaCart
Transcriptome analysis by deep sequencing, more commonly known as RNAseq is, becoming the method of choice for gene discovery and quantitative splicing detection. We published a doublerandom priming RNAseq approach capable of generating strandspecific information [Li et al., Proc Natl Acad Sci
Randompriming in vitro recombination: an effective tool for directed evolution. Nucleic Acids Res
, 1998
"... A simple and efficient method for in vitro mutagenesis and recombination of polynucleotide sequences is reported. The method involves priming template polynucleotide(s) with randomsequence primers and extending to generate a pool of short DNA fragments which contain a controllable level of point mu ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
A simple and efficient method for in vitro mutagenesis and recombination of polynucleotide sequences is reported. The method involves priming template polynucleotide(s) with randomsequence primers and extending to generate a pool of short DNA fragments which contain a controllable level of point
An efficient system for nontransferable anonymous credentials with optional anonymity revocation
, 2001
"... A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out by the same user cannot be linked. An anonymous credential system is of significant practical relevance ..."
Abstract

Cited by 308 (13 self)
 Add to MetaCart
because it is the best means of providing privacy for users. In this paper we propose a practical anonymous credential system that is based on the strong RSA assumption and the decisional DiffieHellman assumption modulo a safe prime product and is considerably superior to existing ones: (1) We give
Results 1  10
of
1,285