Results 1  10
of
12
A SoftwareOptimized Encryption Algorithm
, 1997
"... We describe a softwareefficient encryption algorithm named SEAL 3.0. Computational cost on a modern 32bit processor is about 4 clock cycles per byte of text. The cipher is a pseudorandom function family: under control of a key (first preprocessed into an internal table) it stretches a 32bit ..."
Abstract

Cited by 56 (0 self)
 Add to MetaCart
We describe a softwareefficient encryption algorithm named SEAL 3.0. Computational cost on a modern 32bit processor is about 4 clock cycles per byte of text. The cipher is a pseudorandom function family: under control of a key (first preprocessed into an internal table) it stretches a 32bit position index into a long, pseudorandom string. This string
Evaluating Kolmogorov’s Distribution
 Journal of Statistical Software
"... Kolmogorov’s goodnessoffit measure, Dn, for a sample CDF has consistently been set aside for methods such as the D+n or D n of Smirnov, primarily, it seems, because of the difficulty of computing the distribution of Dn. As far as we know, no easy way to compute that distribution has ever been prov ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
(Show Context)
Kolmogorov’s goodnessoffit measure, Dn, for a sample CDF has consistently been set aside for methods such as the D+n or D n of Smirnov, primarily, it seems, because of the difficulty of computing the distribution of Dn. As far as we know, no easy way to compute that distribution has ever been provided in the 70+ years since Kolmogorov’s fundamental paper. We provide one here, a C procedure that provides Pr(Dn < d) with 1315 digit accuracy for n ranging from 2 to at least 16000. We assess the (rather slow) approach to limiting form, and because computing time can become excessive for probabilities>.999 with n’s of several thousand, we provide a quick approximation that gives accuracy to the 7th digit for such cases. 1
Accepted by.........................................................
, 2006
"... In this thesis, a physicsbased model of an aircraft gas turbine combustor is developed for predicting NOx and CO emissions. The objective of the model is to predict the emissions of current and potential future gas turbine engines within quantified uncertainty bounds for the purpose of assessing de ..."
Abstract
 Add to MetaCart
(Show Context)
In this thesis, a physicsbased model of an aircraft gas turbine combustor is developed for predicting NOx and CO emissions. The objective of the model is to predict the emissions of current and potential future gas turbine engines within quantified uncertainty bounds for the purpose of assessing design tradeoffs and interdependencies in a policymaking setting. The approach taken is to capture the physical relationships among operating conditions, combustor design parameters, and pollutant emissions. The model is developed using only highlevel combustor design parameters and ideal reactors. The predictive capability of the model is assessed by comparing model estimates of NOx and CO emissions from five different industry combustors to certification data. The model developed in this work correctly captures the physical relationships between engine operating conditions, combustor design parameters, and NOx and CO emissions. The NOx estimates are as good as, or better than, the NOx estimates from an established empirical model; and the CO estimates are within the uncertainty
Project ANR ICTeR True Random Number Generators in Configurable Logic Devices Version 1.02
, 2009
"... 1 The issue of random number generation is becoming crucial for the implementation of cryptographic systems in Field Programmable Logic Devices (FPLDs). Random numbers are often employed in key generation process, authentication protocols, zeroknowledge protocols, padding, in many digital signature ..."
Abstract
 Add to MetaCart
(Show Context)
1 The issue of random number generation is becoming crucial for the implementation of cryptographic systems in Field Programmable Logic Devices (FPLDs). Random numbers are often employed in key generation process, authentication protocols, zeroknowledge protocols, padding, in many digital signature schemes, and even in some encryption algorithms. For these applications, security depends greatly on the quality of the randomness source. The quality of the generated numbers is verified by statistical tests. In addition to good statistical properties of the obtained numbers, the output of the generator used in cryptography must be unpredictable. For this reason, pseudorandom generators easily that are easily implementable in digital logic devices and namely in FPLDs, are not suitable for cryptographic applications. The aim of this report is to present the stateoftheart of the true random number generators in (reconfigurable) logic devices. It evaluates sources of randomness and general principles used to extract and process randomness inside FPLDs. The report is concluded by a quantitative comparison between the main principles. Each chapter is concluded by a list of possible open problems.
Certified by…………………………………………………………………………………………
, 2009
"... The impacts of aviation emissions on human health through changes in air quality and UV irradiance Elza BrunelleYeung ..."
Abstract
 Add to MetaCart
(Show Context)
The impacts of aviation emissions on human health through changes in air quality and UV irradiance Elza BrunelleYeung
unknown title
"... Description of a class of simple, extremely fast random number generators (RNGs) with periods 2k −1 for k = ..."
Abstract
 Add to MetaCart
(Show Context)
Description of a class of simple, extremely fast random number generators (RNGs) with periods 2k −1 for k =
Random packing of hyperspheres and Marsaglia’s Parking Lot Test
, 2009
"... Many studies of randomly packed hyperspheres in multiple dimensions have been performed using Monte Carlo or Molecular Dynamics simulations to probe the behaviour of the systems. The calculations are usually initiated by randomly placing the hyperspheres in some D dimensional box until some randoml ..."
Abstract
 Add to MetaCart
(Show Context)
Many studies of randomly packed hyperspheres in multiple dimensions have been performed using Monte Carlo or Molecular Dynamics simulations to probe the behaviour of the systems. The calculations are usually initiated by randomly placing the hyperspheres in some D dimensional box until some randomly loosely packed density is achieved. Then either a compression algorithm or a particle scaling technique is used to reach higher packing fractions. The interesting aspect in the initial random placing of the hyperspheres is that it is closely related to a test of random number generators that was proposed by Marsaglia, the ”Parking Lot” test. It is this relationship that is investigated in this paper.
Cryptologic Research A SoftwareOptimized Encryption Algorithm∗
, 1996
"... Abstract. We describe the softwareefficient encryption algorithm SEAL 3.0. Computational cost on a modern 32bit processor is about 4 clock cycles per byte of text. The cipher is a pseudorandom function family: under control of a key (first preprocessed into an internal table) it stretches a 32bi ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We describe the softwareefficient encryption algorithm SEAL 3.0. Computational cost on a modern 32bit processor is about 4 clock cycles per byte of text. The cipher is a pseudorandom function family: under control of a key (first preprocessed into an internal table) it stretches a 32bit position index into a long, pseudorandom string. This string can be used as the keystream of a Vernam cipher.
Contents
, 2009
"... 2 CUDAMCML for users 4 2.1 What is CUDA and GPGPU?............................... 4 2.2 Installation......................................... 4 ..."
Abstract
 Add to MetaCart
(Show Context)
2 CUDAMCML for users 4 2.1 What is CUDA and GPGPU?............................... 4 2.2 Installation......................................... 4