Demonstration of a variable data-rate free-space optical communication architecture using efficient coherent techniques by Geisler, David J., Schieler, Curt M., Yarnall, Timothy M., Stevens, Mark L., Robinson, Bryan S, Hamilton, Scott A

“…Experimental results also show a 45.6-dB scaling in data rate over a 41.7-dB range of input powers by block-repeating and combining a pseudorandom binary sequence up to 36,017 times.…”
Get full text

Piano training enhances the neural processing of pitch and improves speech perception in Mandarin-speaking children by Nan, Yun, Liu, Li, Geiser, Eveline, Shu, Hua, Gong, Chen Chen, Dong, Qi, Gabrieli, John D. E., Desimone, Robert

“…Seventy-four Mandarin-speaking children aged 4–5 y old were pseudorandomly assigned to piano training, reading training, or a no-contact control group. …”
Get full text
Get full text
Get full text
Get full text

Watermarking Cryptographic Capabilities by Cohen, Aloni(Aloni Jonathan), Holmgren, Justin Lee, Nishimaki, Ryo, Vaikuntanathan, Vinod, Wichs, Daniel

“…In this work, we study the problem of watermarking various cryptographic programs such as pseudorandom function (PRF) evaluation, decryption, and signing. …”
Get full text

ZOCB and ZOTR : tweakable blockcipher modes for authenticated encryption with full absorption by Bao, Zhenzhen, Guo, Jian, Iwata, Tetsu, Minematsu, Kazuhiko

“…This property is commonly referred to as full absorption, and this has been explored for schemes based on a permutation or a pseudorandom function (PRF). Our schemes improve the efficiency of TBC-based counterparts of OCB and OTR called OCB3 (Krovetz and Rogaway, FSE 2011) and OTR (Minematsu, EUROCRYPT 2014). …”
Get full text

Public key encryption with equality test from generic assumptions in the random oracle model by Lee, Hyung Tae, Ling, San, Seo, Jae Hong, Wang, Huaxiong

“…As a result, in combination with the FO transformation, we obtain a PKEET construction in the random oracle model if there exist a one-way PKE scheme, a one-time secure symmetric key encryption scheme, collision-resistant and one-way hash functions, and a pseudorandom function. In this sense, we remark that our PKEET construction is derived from fundamental generic assumptions only.…”
Get full text

Random obtuse triangles and convex quadrilaterals by Banerjee, Nirjhar

Get full text

Application of nonlinearity to enhance security of direct-sequence spread-spectrum (DS/SS) systems by Pang, Wen Ni

“…Hence the ideal spreading code would be a pseudorandom noise (PN) code. The current method of generating PN codes is through linear feedback shift registers (LFSRs). …”
Get full text

Authentication protocols in pervasive computing by Nguyen, L

“…We propose several digest constructions using Toeplitz matrices, integer multiplication and pseudorandom numbers. The application of digest functions leads us to develop more efficient alternatives to standard digital signatures.…”

Incremental Multiset Hash Functions and their Application to Memory Integrity Checking by Clarke, Dwaine, Devadas, Srinivas, van Dijk, Marten, Gassend, Blaise, Suh, G. Edward

“…We reduce the hardness of finding collisions to the hardness of breaking the underlying pseudorandom functions. The proven security of MSet-Mu-Hash is in the random oracle model and is based on the hardness of the discrete logarithm problem. …”
Get full text

Unified RAW Path Oblivious RAM by Ren, Ling, Ph. D. Massachusetts Institute of Technology

Get full text

CO2 Removal via an environmental green solvent, K2CO3-Glycine (PCGLY ) : Investigative analysis of a dynamic and control study by Faezah, Isa, Haslinda, Zabiri, Noorlisa, Harun, Azmi, Mohammad Shariff

“…Further investigation is carried out using the model predictive controller (MPC), in which 5000 data points are generated through pseudorandom binary sequence (PRBS) analysis for state-space model system identification. …”
Get full text

How to subvert backdoored encryption: Security against adversaries that decrypt all ciphertexts

“…We give several constructions of subliminal communication schemes under the assumption that key exchange protocols with pseudorandom messages exist (such as Diffie-Hellman, which in fact has truly random messages).…”
Get full text

Macroscopic order from reversible and stochastic lattice growth models by D'Souza, Raissa Michelle

Get full text

Multi-shape symmetric encryption mechanism for nongeneric attacks mitigation by Abdelgader, Abdelrahman Abdelgader Altigani

Get full text

An enhanced color image encryption algorithm using LT-PRNG by Mohammed Ismael, Saba

“…The confusion stage sorts the pixel based on the generated sequence by the proposed PRNG for each color, while the diffusion stage changes in the values of the pixel by using XOR operator between all colors to attain a high rate of correlation, the proposed PRNG is called ‘Logistic Tent Map Pseudorandom Number Generator ‘LT-PRNG’. The proposed scheme has been tested statistically using NIST test suit and has been analyzed to prove that it has a big keyspace, and sensitive to initial values. …”
Get full text

Performance engineering of multicore software : developing a science of fast code for the post-Moore era by Schardl, Tao Benjamin

Get full text

How to subvert backdoored encryption: Security against adversaries that decrypt all ciphertexts by Horel, Thibaut, Park, Sunoo, Richelson, Silas, Vaikuntanathan, Vinod

“…We give several constructions of subliminal communication schemes under the assumption that key exchange protocols with pseudorandom messages exist (such as Diffie-Hellman, which in fact has truly random messages).…”
Get full text

Privacy-preserving disease detection techniques in e-healthcare systems by Wang, Guoming

“…Then, with the oblivious pseudorandom function protocol (OPRF), the user retrieves the diagnosis result accurately. …”
Get full text

TriviA and uTriviA : two fast and secure authenticated encryption schemes by Chakraborti, Avik, Chattopadhyay, Anupam, Muhammad Hassan, Mridul Nandi

“…We prove that TriviA-v2 construction has at least 128-bit security for privacy and 124-bit security of authenticity under the assumption that the underlying stream cipher produces a pseudorandom bit stream. The uTriviA construction achieves at least 128-bit security for privacy and 93-bit security of authenticity under the same assumption. …”
Get full text

Performance analysis of optimum receivers for fast frequency-hopped systems over composite interference and fading channels with imperfect side information by Le, Ly Minh Duy

“…The interference can be mitigated or avoided by hopping the carrier frequency of the transmitted signal over a wide bandwidth in a pseudorandom pattern. Fading channels can cause a significant degradation in the performance of a communication system. …”
Get full text