8,486 Hits in 3.7 sec

Efficient Implementation of a Pseudorandom Sequence Generator for High-Speed Data Communications

Soo Yun Hwang
2010 ETRI Journal  
He is currently a team leader of the High-Speed Modem Research Team with ETRI, Daejeon, Korea.  ...  To deal with this issue, parallel architectures for a pseudorandom sequence generator Efficient Implementation of a Pseudorandom Sequence Generator for High-Speed Data Communications Soo Yun Hwang, Gi  ...  With the simple matrix manipulations, we can obtain efficient recursive formulas in parallel form as well as implement parallel-structure-based pseudorandom sequence generators that do not require any  ... 
doi:10.4218/etrij.10.1409.0047 fatcat:g4uexritjvhopbevvpm3w4eunu

A new class of scalable parallel pseudorandom number generators based on Pohlig-Hellman exponentiation ciphers [article]

Paul D. Beale
2015 arXiv   pre-print
The 32-bit implementation we propose has millions of possible instances, all with periods greater than 10^18.  ...  We propose a new scalable class of parallel pseudorandom number generators based on Pohlig--Hellman exponentiation ciphers.  ...  Sample C++ code for a 32-bit multi-processor MPI implementation of the Pohlig-Hellman pseudorandom number generator with pseudorandom skip can be found at http://works.bepress. com/paul_beale/.  ... 
arXiv:1411.2484v4 fatcat:xx6wrmjbybhlvmqplzl2mhgaz4

Counter-based pseudorandom number generators for CORSIKA 8

A. Augusto Alves, Anton Poctarev, Ralf Ulrich, C. Biscarat, S. Campana, B. Hegner, S. Roiser, C.I. Rovelli, G.A. Stewart
2021 EPJ Web of Conferences  
The aspects associated with the generation of high-quality random numbers on massively parallel platforms, like multi-core CPUs and GPUs, are reviewed and the deployment of counter-based engines using  ...  Moreover, an upgraded version of the Squares algorithm with highly efficient internal 128 as well as 256 bit counters is presented in this context.  ...  This work was done as part and together with the CORSIKA 8 Collaboration.  ... 
doi:10.1051/epjconf/202125103039 fatcat:hmvrxwnxxfctxeodje2aiiww7i

Class of scalable parallel and vectorizable pseudorandom number generators based on non-cryptographic RSA exponentiation ciphers [article]

Jetanat Datephanyawat, Paul D. Beale
2021 arXiv   pre-print
The advantages of the method are: the method is parallelizable by parameterization with each pseudorandom number generator instance derived from an independent 64-bit composite modulus, the method is fully  ...  Parallel supercomputer-based Monte Carlo and stochastic simulations require pseudorandom number generators that can produce distinct pseudorandom streams across many independent processes.  ...  on a single pseudorandom number generator with an extremely long period, with parallelization accomplished by subdividing the full period into nonoverlapping subsequences.  ... 
arXiv:1811.11629v2 fatcat:yqd7xcxs65drnbdiv6pbtyqkla

Parallel scrambler for high-speed applications

Chih-Hsien Lin, Chih-Ning Chen, You-Jiun Wang, Ju-Yuan Hsiao, Shyh-Jye Jou
2006 IEEE transactions on circuits and systems - 2, Analog and digital signal processing  
A new DET D-register with embedded XOR operation is used as a basic circuit block of the parallel scrambler.  ...  Measurement results show the proposed parallel scrambler can operate in 40 Gbps with 16 outputs in TSMC 0.18-m CMOS process. Index Terms-Parallel scrambler, register, XOR.  ...  Fig. 4 . 4 Parallel pseudorandom code generators with M = 16 of P(x) = X11 + X9 + 1 used in IEEE1394. Fig. 5 . 5 Example used in Example 6 with 5 parallel outputs.  ... 
doi:10.1109/tcsii.2006.875316 fatcat:ulxe42dgbjbslpygg4mpbausry


1999 Recent Advances in Numerical Methods and Applications II  
In this article we outline some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods.  ...  We describe parameterized versions of the following pseudorandom number generators: (i) linear congruential generators, (ii) shift-register generators, and (iii) lagged-Fibonacci generators.  ...  Acknowledgement The SPRNG was developed with funding from DARPA Contract Number DABT63-95-C-0123 for ITO: Scalable Systems and Software, entitled A S c alable Pseudorandom Number Generation Library for  ... 
doi:10.1142/9789814291071_0027 fatcat:dn65lmbo5be3nm4vgbhh7xq23a

Speeding up R-LWE Post-quantum Key Exchange [chapter]

Shay Gueron, Fabian Schlieker
2016 Lecture Notes in Computer Science  
In this paper, we build on the implementation of Alkim et al., and focus on improving the algorithm for generating a uniformly random polynomial.  ...  We optimize three independent directions: efficient pseudorandom bytes generation, decreasing the rejection rate during sampling, and vectorizing the sampling step.  ...  -Replace the SHAKE-128 extendable-output function (XOF) [14] , for generating pseudorandom bytes, by a faster, parallel implementation of SHA-256.  ... 
doi:10.1007/978-3-319-47560-8_12 fatcat:ouvydjyguvehlefiv74jr5djdq

Parallel random variates generator for GPUs based on normal numbers [article]

Gleb Beliakov, Michael Johnstone, Doug Creighton, Tim Wilkin
2012 arXiv   pre-print
This paper investigates the serial CPU and parallel GPU implementation of a Linear Congruential Generator based on the binary representation of the normal number α_2,3.  ...  Pseudorandom number generators are required for many computational tasks, such as stochastic modelling and simulation.  ...  These methods were compared with a serial implementation of each, run on a CPU, and also compared with parallel generators, mtgp [?] and the CUDA-SDK Mersenne twister [?] .  ... 
arXiv:1206.1187v2 fatcat:dx5onksb6veptiigyaupm3vpa4

Redundant and Flexible Pseudorandom Optical Rotary Encoder

Goran S. Miljkovic, Dragan B. Denic
2020 Elektronika ir Elektrotechnika  
Pseudorandom optical rotary encoders are single-track and use a serial pseudorandom binary code to measure absolute position.  ...  The realization and analysis of such a rotary encoder with advanced code scanning and error detection techniques, as well as an improved redundancy in operation, are presented.  ...  To generate the next bit, it is necessary to know the previous code word and the direction of rotation, and then by applying a direct or inverse law of generation, the next bit is obtained.  ... 
doi:10.5755/j01.eie.26.6.25476 fatcat:4gltg6j4hjalxnb4q3lup6sl7y

Low-Power Programmable Pseudorandom Word Generator and Clock Multiplier Unit for High-Speed SerDes Applications

Wei-Zen Chen, Guan-Sheng Huang
2008 IEEE Transactions on Circuits and Systems Part 1: Regular Papers  
The PRWG is capable of producing test patterns with sequence length of 2 7 1, 2 10 1, 2 15 1, 2 23 1, and 2 31 1 b according to CCITT recommendations, and the random word is 16-bit wide.  ...  This PRWG can be used as a low-cost substitute for external parallel test pattern generators.  ...  According to CCITT recommendations [14] , the following polynomials are implemented to generate pseudorandom words with sequence lengths of , , , , and , where (1) Fig. 2 shows a conventional programmable  ... 
doi:10.1109/tcsi.2008.916507 fatcat:5ifcpj2safa7xco77rt4cafn24

Stream cipher based on pseudorandom number generation with optical affine transformation

Toru Sasaki, Hiroyuki Togo, Jun Tanida, Yoshiki Ichioka
2000 Applied Optics  
The stream cipher uses a pseudorandom number generator ͑PRNG͒ to generate a pseudorandom bit sequence.  ...  We expect efficient execution of the method by optical parallel processing.  ...  The authors are with the Department of Material and Life Science, Graduate School of Engineering, Osaka University, 2-1 Yamadaoka, Suita, Osaka 565-0871, Japan. T.  ... 
doi:10.1364/ao.39.002340 pmid:18345143 fatcat:rzxbveyp7nct3atv5exqidmtsi

Efficient cryptographic schemes provably as secure as subset sum

Russell Impagliazzo, Moni Naor
1996 Journal of Cryptology  
The increase in efficiency in our construction is due to the fact that many bits can be generated/hashed with one application of the assumed one-way function.  ...  (Pseudorandom generators can be used for private-key encryption and universal one-way hash functions for signature schemes.)  ...  Ajtai ("Generating Hard Instances of Lattice Problems", to appear, Proc. 28th Symposium on Theory of Computing, 1996) implies that if the subset sum problem is easy on the average, then the shortest vector  ... 
doi:10.1007/bf00189260 fatcat:7u3svhebmval7mgpj7p4wwja7a

Variants of Mersenne Twister Suitable for Graphic Processors

Mutsuo Saito, Makoto Matsumoto
2013 ACM Transactions on Mathematical Software  
MTGP supports large state sizes such as 11213 bits, and uses the high parallelism of GPUs in computing many steps of the recursion in parallel.  ...  MT-GPDC creates up to 2 32 distinct parameter sets which generate sequences with high-dimensional uniformity.  ...  Other GPU-based PRNGs We compare MTGP with some other generators implemented for GPUs.  ... 
doi:10.1145/2427023.2427029 fatcat:yzbc77le2vdidlcisvoistgvuu

Multilevel-Huffman Test-Data Compression for IP Cores With Multiple Scan Chains

Xrysovalantis Kavousianos, Emmanouil Kalligeros, Dimitris Nikolos
2008 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
In this paper, we take advantage of the inherent parallelism of Huffman decoding and we present a generalized multilevel Huffman-based compression approach that is suitable for cores with multiple scan  ...  Moreover, given the compact nature of the model, it can be easily implemented into commercial EDA tools.  ...  of generating whole clusters of test bits in parallel.  ... 
doi:10.1109/tvlsi.2008.2000448 fatcat:ldab74iferfx7ai7nn6ipcx46u

Fast splittable pseudorandom number generators

Guy L. Steele, Doug Lea, Christine H. Flood
2014 SIGPLAN notices  
We describe a new algorithm SPLITMIX for an objectoriented and splittable pseudorandom number generator (PRNG) that is quite fast: 9 64-bit arithmetic/logical operations per 64 bits generated.  ...  Because the generate method has no loops or conditionals, it is suitable for SIMD or GPU implementation.  ...  Acknowledgments We thank Claire Alvis for implementing our first prototype for Fortress, Martin Buchholz for suggesting that we test sparse γ values. and Brian Goetz, Paul Sandoz, Peter Levart, Kasper  ... 
doi:10.1145/2714064.2660195 fatcat:nmjsxy63ifb3hcbjnwtgf67mea
« Previous Showing results 1 — 15 out of 8,486 results