Search

Quantum random number generators (QRNGs) produce random numbers based on the intrinsic probabilistic nature of quantum mechanics, making them true random number generators. In this paper, we design and fabricate an embedded QRNG that produces random numbers based on fluctuations of spontaneous emission and absorption in a light-emitting diode. To achieve a robust and reliable QRNG, we compare some usual post-processing methods and select the finite impulse response method for a real-time device. This device could pass the National Institute of Standards and Technology tests, the generation rate is 1 Mbit/s, and the randomness of the output data is invariant in time. [ABSTRACT FROM AUTHOR]

The dual-scrambling scheme that combines position transformation and bit-plane transformation is a popular image encryption scheme. However, such schemes need more key information, and the encryption and decryption processes are complicated. In addition, the existing quantum image dual-scrambling schemes mainly deal with square images. In this paper, we propose a hybrid scrambling encryption scheme for multi-mode quantum image representation (MQIR) images based on random permutation, in which the H × W quantum image is represented in MQIR. A random number generator factor s uniquely associates one of the random permutations of integers from 1 to a positive integer, so as to hybrid scramble both the pixel position and the binarized position of each pixel value. Meanwhile, the quantum circuits and some examples of scrambling are given. Furthermore, various analyses of the performance of this scheme were conducted, including effectiveness, key space, and computational complexity. By modifying the random generation factor to construct multiple binary grayscale images, the simulated results on the IBM Quantum Cloud platform demonstrate that the proposed quantum image encryption scheme is effective. In comparison to existing quantum image dual scrambling schemes, it is both simple and effective, offering a large key space, lower computational complexity, and applicability to non-square quantum images. [ABSTRACT FROM AUTHOR]

In this work, a new efficient cryptographic scheme based on the concept of chaotic map and optimized watermarking scheme is proposed. In the optimized watermarking scheme, a combination of discrete wave transformation (DWT), hessenberg decomposition (HD), and singular value decomposition (SVD) are used. In this, the host image is first broken down into several sub-bands using multi-level DWT, and the resulting coefficients are then fed into HD during the embedding phase. Simultaneous watermark operation is performed on SVD. Finally, the scale factor embeds the watermark into the host image. The Differential evolution method is used to find the best scaling factor for the optimized watermarking scheme. The resulting watermarked image is then encrypted by the session key based scheme. In this scheme for each image encryption, a new random session key will be produced. The presented approach uses 64-bit plaintext and a variable size key that will be decided at the time of encryption for encrypting an image. Since session keys change with each transmission, this approach does not involve extracting and remembering session keys in order to produce subsequent session keys. IoT devices are used to test the developed method for security. The experiment's findings shows that the suggested method works better than the current scheme in several aspects. [ABSTRACT FROM AUTHOR]

In an AI-immersing age, scholars look for new possibilities of employing AI technology to their fields, and how to strengthen security and protect privacy is no exception. In a coverless data hiding domain, the embedding capacity of an image generally depends on the size of a chosen database. Therefore, choosing a suitable database is a critical issue in coverless data hiding. A novel coverless data hiding approach is proposed by applying deep learning models to generate texture-like cover images or code images. These code images are then used to construct steganographic images to transmit covert messages. Effective mapping tables between code images in the database and hash sequences are established during the process. The cover images generated by a two-dimensional fractional Brownian motion (2D FBM) are simply called fractional Brownian images (FBIs). The only parameter, the Hurst exponent, of the 2D FBM determines the patterns of these cover images, and the seeds of a random number generator determine the various appearances of a pattern. Through the 2D FBM, we can easily generate as many FBIs of multifarious sizes, patterns, and appearances as possible whenever and wherever. In the paper, a deep learning model is treated as a secret key selecting qualified FBIs as code images to encode corresponding hash sequences. Both different seeds and different deep learning models can pick out diverse qualified FBIs. The proposed coverless data hiding scheme is effective when the amount of secret data is limited. The experimental results show that our proposed approach is more reliable, efficient, and of higher embedding capacity, compared to other coverless data hiding methods. [ABSTRACT FROM AUTHOR]

Optical communications providing huge capacity and low latency remain vulnerable to a range of attacks. In consequence, encryption at the optical layer is needed to ensure secure data transmission. In our previous work, we proposed LightPath SECurity (LPSec), a secure cryptographic solution for optical transmission that leverages stream ciphers and Diffie–Hellman (DH) key exchange for high-speed optical encryption. Still, LPSec faces limitations related to key generation and key distribution. To address these limitations, in this paper, we rely on Quantum Random Number Generators (QRNG) and Quantum Key Distribution (QKD) networks. Specifically, we focus on three meaningful scenarios: In Scenario A, the two optical transponders (Tp) involved in the optical transmission are within the security perimeter of the QKD network. In Scenario B, only one Tp is within the QKD network, so keys are retrieved from a QRNG and distributed using LPSec. Finally, Scenario C extends Scenario B by employing Post-Quantum Cryptography (PQC) by implementing a Key Encapsulation Mechanism (KEM) to secure key exchanges. The scenarios are analyzed based on their security, efficiency, and applicability, demonstrating the potential of quantum-enhanced LPSec to provide secure, low-latency encryption for current optical communications. The experimental assessment, conducted on the Madrid Quantum Infrastructure, validates the feasibility of the proposed solutions. [ABSTRACT FROM AUTHOR]

Data encryption is an essential building block in modern electronic systems to prevent spying and hacking. Every day more and more objects produce electronic data, and this needs to be encrypted before being transmitted. Hence, designing devices, circuits, and systems for data encryption that can be integrated in all kinds of objects and that consume low amounts of energy is highly necessary. Here, this work reports the fabrication of flexible and transparent electronic circuits consisting of devices that exhibit threshold‐type resistive switching with a high degree of stochasticity. The cycle‐to‐cycle variability of switching voltages and state currents is significant but confined within a well‐defined range, which is consistent across multiple devices. This allows to design an efficient protocol for true random number generation. The circuits are fabricated with only synthetic 2D materials, can be fabricated in a scalable manner, and can be integrated in any object. [ABSTRACT FROM AUTHOR]

This paper proposes a highly secure image encryption technique based on chaotic synchronization. Firstly, through the design of a synchronization controller, we ensure that the master–slave chaotic extremum-coded random number generators (ECRNGs) embedded in separated transmitters and receivers are fully synchronized to provide synchronized dynamic random sequences for image encryption applications. Next, combining these synchronized chaotic sequences with the AES encryption algorithm, we propose an image segmentation and multi-encryption method to enhance the security of encrypted images and realize a secure image transmission system. Notably, in the design of the synchronization controller, the transient time before complete synchronization between the master and slave ECRNGs is effectively controlled by specifying the eigenvalues of the matrix in the synchronization error dynamics. Research results in this paper also show that complete synchronization of ECRNGs can be achieved within a single sampling time, which significantly contributes to the time efficiency of the image transmission system. As for the image encryption technique, we propose the method of image segmentation and use the synchronized dynamic random sequences generated by the ECRNGs to produce the keys and initialization vectors (IVs) required for AES-CBC image encryption, greatly enhancing the security of the encrypted images. To highlight the contribution of the proposed segmented image encryption, statistical analyses are conducted on the encrypted images, including histogram analysis (HA), information entropy (IE), correlation coefficient analysis (CCA), number of pixels change rate (NPCR), and unified average changing intensity (UACI), and compared with existing literature. The comparative results fully demonstrate that the proposed encryption method significantly enhances image encryption performance. Finally, under the network transmission control protocol (TCP), the synchronization of ECRNGs, dynamic keys, and IVs is implemented as well as segmented image encryption and transmission, and a highly secure image transmission system is realized to validate the practicality and feasibility of our design. [ABSTRACT FROM AUTHOR]

A study was conducted on the tensile stress of an epoxy resin (Resoltech® 1050/1056). This was done by gathering a sample of 39 tensile strength data under consistent levels of stress. The tensile stress resistance is often characterized using a three-parameter Weibull distribution and the reliability of this characterization, given by confidence intervals (CIs). This approach commonly utilizes data-resampling techniques to estimate the CI of its parameters. CIs are constructed from six existing point-estimation methods. Herein, the jackknife was carried out to calculate the CIs using 39 subsamples and bootstrap methods using 100 or 200 subsamples. To date, there have been no studies exploring the effectiveness of subsampling methods for constructing CIs related to tensile strength. In this study, jackknifed and bootstrapped samples are used to implement the percentile method and three variations of the bias correction methods. We then performed simulations to evaluate the reliability of these methods using a Weibull random number generator. Our results showed that while the bias-corrected approach generated the most stable CIs from replicate samples, its accuracy was contingent on the point-estimation method employed. We also found that the different methods for calculating CIs resulted in significantly varying widths of the CIs. [ABSTRACT FROM AUTHOR]

COVID-19 pandemic has made the medical industry around the world under unprecedented and growing pressure. To preserve the integrity and protection of medical data for transmission and for secure diagnosis, this work suggests an encryption method for the protection of privacy of COVID-19 patient's data by securing medical images based on elliptic curve cryptography. This is done through amalgamating three different types of stages by using elliptic curve cryptography. First, the coordinates of pixels of medical images are scrambled using elliptic curve and encrypt the coordinates of pixels, which help in decreasing the correlation between the image's pixels. The second stage empowers the first stage by encrypting the group of pixels from previous outputs irrespective whether the pixel value lies on the curve or not based on the multiplication modulo operation of elliptic curve cryptography. Finally, the group of pixels from the previous output is encrypted by XORing with the key generated from ECC DHKE (Elliptic Curve Cryptography Diffie–Hellman Key Exchange). The NIST test suite examines and verifies the statistical characteristics of the binary sequences for $2^{10}$ 2 10 bits and $2^{16}$ 2 16 bits that are created by cryptographic random or pseudorandom number generators. The outcomes of the experiments indicate how the suggested approach satisfies the security requirements of COVID-19 images of patients in terms of high effectiveness in encryption quality, resilient against many statistical analyses and attacks and also performs better than some recent schemes. This work also evaluated comparisons of quantitative, differential, time consumptions and computational complexity with several recent schemes. [ABSTRACT FROM AUTHOR]

Magnetic tunnel junction (MTJ)-based true random number generators (TRNG), which are promisingly utilized as hardware accelerators for probabilistic computing, may suffer intrinsic performance drifting and fluctuation in the probability space and performance variations in device arrays. In order to preventively avoid these concerns, it is necessary to develop strategies that can help MTJ-based TRNG to be self-stabilized and calibration-free. Here, we derived a simple and easily handleable strategy that only depends on the current sampled state of an MTJ device without any historical or statistic information or a pre-calibrated probabilistic switching property to dynamically tune its sampling probability for the next sampling operation. In this way, the long-term sampling probability of the MTJ can be proved to automatically converge into a desired probability with little fluctuation and drifting. We further experimentally demonstrate such a self-stabilized MTJ-based TRNG. Our results show that the TRNG can generate binary random numbers with any destined probability regardless of its initial state. Furthermore, the TRNG also displays the desired capability of excellently hedging against performance drifting and fluctuations. All these combined allow the self-stabilized TRNG without calibration to be more viable for high-quality entropy source applications. [ABSTRACT FROM AUTHOR]

In the case of quantum random number generators based on single-photon arrivals, the physical properties of single-photon detectors, such as time-tagger clocks and dead time, influence the stochastic properties of the generated random numbers. This can lead to unwanted correlations among consecutive samples. We present a method based on extending the insensitive periods after photon detections. This method eliminates the unwanted stochastic effects at the cost of reduced generation speed. We calculate performance measures for our presented method and verify its correctness with computer simulations and measurements conducted on an experimental setup. Our algorithm has low complexity, making it convenient to implement in QRNG schemes, where the benefits of having uncorrelated output intervals exceed the disadvantages of the decreased rate. [ABSTRACT FROM AUTHOR]

To study the spatial distribution of the intensity of an X-ray source of electric discharge plasma, a new-type coded aperture, which is a structure of intersecting mutually perpendicular transparent and opaque strips with the widths selected using a random number generator, has been used. The radiation passed through the coded aperture has produced a complex pattern of the coded image, which has been recorded on a Fuji TR fluorescent imaging plate without a protective coating. A mathematical procedure based on the iterative method of solving an incorrectly posed problem given by the Fredholm integral equation of the first kind has been applied to reconstruct the spatial distribution of plasma radiation intensity from this pattern. It has been shown that the use of the coded aperture not only has increased significantly the light intensity of the recording system in comparison with a pinhole camera, but also has made it possible to obtain a spatial resolution of the discharge plasma no worse than the resolution of the pinhole camera. The applicability of the developed iterative method for both sources close to point ones and extended emitting objects has been demonstrated. [ABSTRACT FROM AUTHOR]

Quantum random number generation (QRNG) leveraging intrinsic quantum uncertainty has attracted significant interest in the field of integrated photonic architecture, with applications in quantum cryptography, tests of quantum nonlocality, and beyond. The demand for compact, low-energy consumption, robust, fast, and cost-effective QRNGs integrated into photonic chips is highlighted, whereas most previous works focused on bulk optics. Here, based on the metalens array entangled source, we experimentally realized a miniaturized, high-dimensional quantum random number generator via a meta-device without post-randomness extraction. Specifically, the device has a high-density output with 100 channels per square millimeter. This chip-scale quantum randomness source can obtain random number arrays without post-randomness extraction and enable compact integration for quantum applications needing secure keys or randomness. Our approach demonstrates potential in secure key generation and randomness for quantum applications. [ABSTRACT FROM AUTHOR]

The use of physical unclonable functions (PUFs) linked to the manufacturing process of the electronic devices supporting applications that exchange critical data over the Internet has made these elements essential to guarantee the authenticity of said devices, as well as the confidentiality and integrity of the information they process or transmit. This paper describes the development of a configurable PUF/TRNG module based on ring oscillators (ROs) that takes full advantage of the structure of modern programmable devices offered by Xilinx 7 Series families. The proposed architecture improves the hardware efficiency with two main objectives. On the one hand, we perform an exhaustive statistical characterization of the results derived from the exploitation of RO configurability. On the other hand, we undertake the development of a new version of the module that requires a smaller amount of resources while considerably increasing the number of output bits compared to other proposals previously reported in the literature. The design as a highly parameterized intellectual property (IP) module connectable through a standard interface to a soft- or hard-core general-purpose processor greatly facilitates its integration into embedded solutions while accelerating the validation and characterization of this element on the same electronic device that implements it. The studies carried out reveal adequate values of reliability, uniqueness, and unpredictability when the module acts as a PUF, as well as acceptable levels of randomness and entropy when it acts as a true random number generator (TRNG). They also illustrate the ability to obfuscate and recover identifiers or cryptographic keys of up to 4096 bits using an implementation of the PUF/TRNG module that requires only an array of 4 × 4 configurable logic blocks (CLBs) to accommodate the RO bank. [ABSTRACT FROM AUTHOR]

The triboelectric nanogenerator (TENG) has the potential to serve as a high-entropy energy harvester, enabling the self-powered operation of Internet of Things (IoT) devices. True random number generator (TRNG) is a common feature of encryption used in IoT data communication, ensuring the security of transmitted information. The benefits of multiplexing TENG and TRNG in resource-constrained IoT devices are substantial. However, current designs are limited by the usage scenarios and throughput of the TRNG. Specifically, we propose a structurally and environmentally friendly design based on the contact–separation structure, integrating heat fluctuation and charge decay as entropy sources. Furthermore, filtering and differential algorithms are recommended for data processing based on TENG characteristics to enhance randomness. Finally, a TENG-based TRNG is fabricated, and its performance is verified. Test results demonstrate a random number throughput of 25 Mbps with a randomness test pass rate approaching 99%, demonstrating suitability for resource-constrained IoT applications. [ABSTRACT FROM AUTHOR]

Introduction: The development of certain immune-mediated diseases (IMD) in patients with inflammatory bowel diseases [IBD; Crohn's disease (CD), ulcerative colitis (UC)] has been linked to treatment of IBD. Hair loss in some patients may be due to immune-mediated alopecia areata (AA). Risk factors and outcomes of AA in patients with IBD have not been previously explored. Methods: This was a retrospective, multi-center case–control study. Cases were identified as individuals who developed IBD before AA diagnosis. Controls comprised of those who were never diagnosed with AA and treated contemporaneously, selected using random number generator. We extracted demographic and IBD treatment history. Severity of Alopecia Tool (SALT) was used to stratify AA severity. AA outcomes and interventions were compared within controls. Results: We identified 58 cases and 90 controls. Cases had significantly higher rate of tumor necrosis factor α antagonist (anti-TNF) use compared to controls (40.7% vs. 20.0%, p = 0.006). Both groups had similar IBD disease location, behavior, and related surgery. Majority of cases had endoscopic remission or mild disease activity at AA diagnosis. There was no difference in partial or complete improvement of AA between those who stopped or continued IBD therapy (p = 0.57). Those with severe AA were significantly less likely to have complete (0% vs 33.3%, p = 0.01) or any improvement (50% vs 84.9%, p = 0.02) of AA compared to those with non-severe AA. Discussion: Individuals with IBD who later develop AA were more likely to have been on anti-TNF at time of AA onset. Severity of AA was a significant predictor of AA resolution. Fortunately many patients had improvement in their AA despite continuation of IBD therapy. [ABSTRACT FROM AUTHOR]

Apart from simulating biological synapses, memristors can also be used in the secure encryption by exploiting their inherent random resistive switching (RS) properties. In this work, nonvolatile Ta/BiFeO3/ZrO2/Pt memristor is fabricated with 2 nm inserting BiFeO3 layer. At a high compliance current of 10 mA, it presents gradual RS characteristics during the set process, which resulting in 30 conductance states. Synaptic behavior can be successfully mimicked by precise conductance modulating under pulse electrical stimulation. Whereas under a low compliance current of 500 µA, it exhibits abrupt RS behavior, and the set voltage ranged from 0.3–0.8 V, which can be effectively as an entropy source for true random number generator (TRNG). Due to its Shannon entropy of 300 bits is 0.99987, Hamming weights and intra‐Hamming distances tend to be 50%. Furthermore, the software simulation of encryption and decryption of cat image is achieved by combining the key generated by TRNG. The controllable electrical properties of the Ta/BiFeO3/ZrO2/Pt device can be modulated by the compliance current, thus meeting the computing or safety requirements, which provides a solid foundation for the development of integrating computation and security at the hardware level. [ABSTRACT FROM AUTHOR]

Copyright of Misan Journal of Academic Studies is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Pseudorandom number generators (PRNGs) are an essential tool in cryptography; they produce secret keys to encrypt messages or mask the content by combining it with a random sequence. This study introduces an efficient pseudorandom number generator for a new cryptographic application. The PRNG structure comprises two chaotic digital IIR filters of the second and third order and a 4D hyperchaotic system. In this system, the first chaotic sequence is used as the input to the filters, and the second chaotic sequence is used to select the values of the pseudorandom sequence from the outputs of filters. The cryptosystem algorithm utilizes the pseudorandom sequence produced by the proposed PRNG to create a matrix mask and XOR it with a source image after being permuted with a new technique. The permutation method involves shuffling the positions of the original image using a matrix derived from two mathematical operations (modulo and division) and the final chaotic sequence. For heightened security, the shuffled image is subsequently divided into blocks and mixed using the third chaotic sequence. Statistical and frequency tests demonstrate that the proposed PRNG has strong randomness, high uncertainty, and an absence of discernible statistical patterns. Furthermore, simulation, experimental results, and performance analysis confirm that the new cryptosystem exhibits high security and resilience against various attacks, including differential and statistical attacks. [ABSTRACT FROM AUTHOR]

The article discusses how public gardens, such as botanical gardens and arboreta, can serve as valuable resources for scientific research by providing curated plant collections that offer high levels of biodiversity. These living collections allow researchers to explore ecological and evolutionary questions, such as the impact of phylogenetic history on plant trait evolution and plant-soil interactions. Public gardens prioritize scientific inquiry and conservation, recording plant provenance and housing replicates for each species to study within-species variation, local adaptation, and niche evolution. The article emphasizes the importance of utilizing public garden collections to address pressing ecological questions and understand how evolution shapes species' responses to changing environments. [Extracted from the article]

Abstract Pseudo-random number generators (PRNGs) are deterministic algorithms that generate sequences of numbers approximating the properties of random numbers, which are widely utilized in various fields. In this paper, we present a Genetic Algorithm Optimized Generative Adversarial Network (hereinafter referred to as GAGAN), which is designed for the effective training of discrete generative adversarial networks. In situations where non-differentiable activation functions, such as the modulo operation, are employed and traditional gradient-based backpropagation methods are inapplicable, genetic algorithms are utilized to optimize the parameters of the generator network. Based on this framework, we propose a novel recursive PRNG. Given that a PRNG can be constructed from one-way functions and their associated hardcore predicates, our proposed generator consists of two neural networks that simulate these functions and serve as the state transition function and the output function, respectively. The proposed PRNG has been rigorously tested using stringent benchmarks such as the NIST Statistical Test Suite (SP800-22) and the Chinese standard for random number generation (GM/T 0005-2021). Additionally, it has demonstrated outstanding performance in terms of Hamming distance. The results indicate that the proposed GAN-based PRNG has achieved a high degree of randomness and is highly sensitive to variations in the input.

Pseudo-random number generators (PRNGs) are deterministic algorithms that generate sequences of numbers approximating the properties of random numbers, which are widely utilized in various fields. In this paper, we present a Genetic Algorithm Optimized Generative Adversarial Network (hereinafter referred to as GAGAN), which is designed for the effective training of discrete generative adversarial networks. In situations where non-differentiable activation functions, such as the modulo operation, are employed and traditional gradient-based backpropagation methods are inapplicable, genetic algorithms are utilized to optimize the parameters of the generator network. Based on this framework, we propose a novel recursive PRNG. Given that a PRNG can be constructed from one-way functions and their associated hardcore predicates, our proposed generator consists of two neural networks that simulate these functions and serve as the state transition function and the output function, respectively. The proposed PRNG has been rigorously tested using stringent benchmarks such as the NIST Statistical Test Suite (SP800-22) and the Chinese standard for random number generation (GM/T 0005-2021). Additionally, it has demonstrated outstanding performance in terms of Hamming distance. The results indicate that the proposed GAN-based PRNG has achieved a high degree of randomness and is highly sensitive to variations in the input. [ABSTRACT FROM AUTHOR]

In this paper, a new encryption algorithm Twine-Mersenne was developed based on the Twine algorithm with the addition of a random number generator for the dynamic generation of S-boxes. Dynamic generation of random numbers based on the Mersenne Twister helps to increase the cryptographic strength of the proposed algorithm. The algorithm we propose solves the issues of optimizing the costs of computing and energy resources of internet of things (IoT) devices, using a combination of lightweight cryptographic principles and fuzzy logic, and also provides reliable security and intelligent authentication of the mobile application user. The paper also considers the practical implementation of the proposed algorithm based on Arduino ESP32, a device with limited computing resources. In addition to this, fuzzy logic has found its practical application in the field of intelligent user authentication in developed mobile applications based on Arduino Studio for mobile cellular applications. As a result, the proposed lightweight encryption algorithm has proven itself to be an effective tool in ensuring the security of data transmission and communication between IoT devices. [ABSTRACT FROM AUTHOR]

This study introduces a novel approach to address the limitations observed in existing random number generator (RNG) designs, focusing on the resolution for insufficiently covered problem statements and study purposes. In response to these challenges, we propose a high-throughput metastable-based RNG tailored for cryptography applications. Our design is featured with a two-layer transient effect ring oscillator (TERO) architecture, meticulously crafted to mitigate the locking phenomenon and enhance RNG randomness. Leveraging interleaved two-layer TEROs, realised through NAND and NOR SR latches, our RNG achieves unpredictable irregular sampling, crucial for cryptographic applications. To further enhance irregular sampling, the first layer of the RNG employs a multiplexer that selects inputs randomly. This multiplexer is governed by selection signals generated by the second layer of the RNG, ensuring superior randomness. Implemented using TSMC 40-nm CMOS process, our RNG passed the FIPS 140–1 randomness test at a clock frequency of 100 MHz, boasting a remarkable throughput of 50 Mbps. This study represents a significant advancement in RNG technology, addressing previous shortcomings and paving the way for high-speed communication systems' secure cryptographic applications. [ABSTRACT FROM AUTHOR]

Background: The disruption of health and medical education by the COVID-19 pandemic made educators question the effect of online setting on students' learning, motivation, self-efficacy and preference. In light of the health care staff shortage online scalable education seemed relevant. Reviews on the effect of online medical education called for high quality RCTs, which are increasingly relevant with rapid technological development and widespread adaption of online learning in universities. The objective of this trial is to compare standardized and feasible outcomes of an online and an onsite setting of a research course regarding the efficacy for PhD students within health and medical sciences: Primarily on learning of research methodology and secondly on preference, motivation, self-efficacy on short term and academic achievements on long term. Based on the authors experience with conducting courses during the pandemic, the hypothesis is that student preferred onsite setting is different to online setting. Methods: Cluster randomized trial with two parallel groups. Two PhD research training courses at the University of Copenhagen are randomized to online (Zoom) or onsite (The Parker Institute, Denmark) setting. Enrolled students are invited to participate in the study. Primary outcome is short term learning. Secondary outcomes are short term preference, motivation, self-efficacy, and long-term academic achievements. Standardized, reproducible and feasible outcomes will be measured by tailor made multiple choice questionnaires, evaluation survey, frequently used Intrinsic Motivation Inventory, Single Item Self-Efficacy Question, and Google Scholar publication data. Sample size is calculated to 20 clusters and courses are randomized by a computer random number generator. Statistical analyses will be performed blinded by an external statistical expert. Discussion: Primary outcome and secondary significant outcomes will be compared and contrasted with relevant literature. Limitations include geographical setting; bias include lack of blinding and strengths are robust assessment methods in a well-established conceptual framework. Generalizability to PhD education in other disciplines is high. Results of this study will both have implications for students and educators involved in research training courses in health and medical education and for the patients who ultimately benefits from this training. Trial registration: Retrospectively registered at ClinicalTrials.gov: NCT05736627. SPIRIT guidelines are followed. [ABSTRACT FROM AUTHOR]

Prospective application of quantum technologies for reinforcement learning (RL) is an exciting surge in quantum fields. Quantum random number generators (QRNGs) produce high‐frequency random bits, with advantages of true randomness and device independence over pseudo‐random numbers. This work explores a new approach, called the quantum random numbers for multi‐armed bandit (QRN‐MAB) algorithm, for multi‐user access in wireless communication system upon random bits. The primary objective of the algorithm is to attain a stable assignment state without further exchange. QRN‐MAB utilizes random bits to learn channel features and conducts concurrent exchange to attain stability. This work finds that the intrinsic randomness property used in QRN‐MAB enables arrangement to maintain high accuracy and outperforms other classical algorithms. Additionally, the algorithm exhibits strong adaptability when the environment changes over time and quantum random numbers are advantageous over other pseudo‐random methods in achieving the target. This work provides an effective way for quantum technologies applications in RL and unfolds a promising avenue to stabilize assignment among multiple users. [ABSTRACT FROM AUTHOR]

This study explores memristor-based true random number generators (TRNGs) through their evolution and optimization, stemming from the concept of memristors first introduced by Leon Chua in 1971 and realized in 2008. We will consider memristor TRNGs coming from various entropy sources for producing high-quality random numbers. However, we must take into account both their strengths and weaknesses. The comparison with CMOS-based TRNGs will serve as an illustration that memristor TRNGs stand out due to their simpler circuits and lower power consumption— thus leading us into a case study involving electroless YMnO3 (YMO) memristors as TRNG entropy sources that demonstrate good security properties by being able to produce unpredictable random numbers effectively. The end of our analysis sees us pinpointing challenges: post-processing algorithm optimization coupled with ensuring reliability over time for memristor-based TRNGs aimed at next-generation security applications. [ABSTRACT FROM AUTHOR]

Background: Engaging in physical activity (PA) during adolescence is beneficial for health and positive development. However, most adolescent girls have low PA levels, and there is a need for interventions outside of school hours. This pilot randomised controlled trial aimed to explore the preliminary effectiveness of three different remote PA interventions in increasing adolescent girls' moderate-to- vigorous PA (MVPA), fitness and psychosocial outcomes. Methods: Girls living in the UK or Ireland, aged between 13 and 16 years old, who wished to increase their activity levels, were eligible for the study. Using a random number generator, participants (n = 153; 14.8y ± 1.4) were randomised into one of three 12-week intervention groups (i) PA programme, (ii) Behaviour change support, or (iii) Combined PA programme and Behaviour change support, or (iv) a Comparison group. Outcome measures included accelerometer and self-reported PA, physical fitness (cardiorespiratory fitness; 20 m shuttle run, muscular endurance; push up, muscular strength; long jump), and psychosocial assessments (perceived competence; body appreciation; self-esteem; behavioural regulation). Linear mixed models were used to analyse differences between each intervention arm and the comparison group immediately postintervention (12 weeks) and at follow up (3-months post-intervention), while adjusting for potential confounders. Results: Participation in the PA programme group was associated with higher perceived competence (0.6, 95% CI 0.1 to 1.2), identified regulation (0.7, 95% CI 0.2 to 1.1) and intrinsic motivation (0.9, 95% CI 0.2 to 1.6) at post-intervention. Participation in the Behaviour change group was associated with higher perceived competence at post-intervention (0.6, 95% CI 0.1 to 1.2), and higher push-up scores at the 3-month follow-up (4.0, 95% CI 0.0 to 7.0). Participation in the Combined group was also associated with higher perceived competence at post-intervention (0.8, 95% CI 0.2 to 1.4), and higher push-up scores at the 3-month follow-up (5.0, 95% CI 1.0 to 8.0). No other significant differences were found between the intervention arms and the comparison group. Conclusion: Results suggest perceived competence increased across all intervention arms, while the PA programme group enhanced autonomous motivation in the short term. Intervention arms with behaviour change support appear most promising in improving muscular endurance. However, a larger scale trial is needed for a better understanding of between-group differences and the impact of intervention arms on MVPA and fitness, given the small sample size and short-term follow-up. [ABSTRACT FROM AUTHOR]

In this letter, a novel secret merchant‐4 (SM4) cryptographic circuit implementation is proposed against higher order power analysis attacks (PAAs). Four different random number generators (RNGs) are embedded into the SM4 architecture for breaking the correlation between the processed data and monitored power dissipation against PAAs. Firstly, fake keys are created by the first RNG to scramble the critical information related with the actual secret key. Furthermore, the second RNG controls the implementations of substitution boxes (Sboxes) with composite fields or look‐up tables randomly while the third RNG randomizes the substitution locations with respect to these Sboxes. Ultimately, the fourth RNG randomly swaps the behaviors of the fake SM4 and true SM4 to further break the critical correlation. Under the assistance of the four embedded RNGs, the proposed SM4 cryptographic architecture is capable of resisting against fourth‐order PAAs effectively with a 300 Mbps throughput and 165,354 μm2 area after synthesizing in the TSMC 90 nm process design kits (PDK). [ABSTRACT FROM AUTHOR]

Pseudo-random number generators (PRNGs) are important cornerstones of many fields, such as statistical analysis and cryptography, and the need for PRNGs for information security (in fields such as blockchain, big data, and artificial intelligence) is becoming increasingly prominent, resulting in a steadily growing demand for high-speed, high-quality random number generators. To meet this demand, the multiple deep-dynamic transformation (MDDT) algorithm is innovatively developed. This algorithm is incorporated into the skewed tent map, endowing it with more complex dynamical properties. The improved one-dimensional discrete chaotic mapping method is effectively realized on a field-programmable gate array (FPGA), specifically the Xilinx xc7k325tffg900-2 model. The proposed pseudo-random number generator (PRNG) successfully passes all evaluations of the National Institute of Standards and Technology (NIST) SP800-22, diehard, and TestU01 test suites. Additional experimental results show that the PRNG, possessing high novelty performance, operates efficiently at a clock frequency of 150 MHz, achieving a maximum throughput of 14.4 Gbps. This performance not only surpasses that of most related studies but also makes it exceptionally suitable for embedded applications. [ABSTRACT FROM AUTHOR]

A cryptography algorithm for data transfer encryption provides confidentiality, requires considerable computing power, and is not commonly implemented in embedded systems with limited computing power, such as Programmable Logic Controller (PLC). PLC is the core component for automation and control in industrial automation. For decades, PLC has prioritized speed over security; program execution in PLC must be as efficient as possible. The cryptography algorithm uses a seed, the initialization vector, to encrypt the data with the cryptography key to strengthen the encryption. Pseudo Random Number Generator (PRNG) can be used as the initialization vector. This paper proposes the XORasm PRNG algorithm, the lightweight XORshift-based algorithm with a modified seed from the system's clock. The applied methodology generates and visualizes PRNG, tests the randomness, and implements the PRNG on compact PLC. XORasm is evaluated statistically with runs-test in simulation by comparing the algorithm to one of the simulated compact PLC's PRNG implementations. The findings from this research are that p-values demonstrate that XORasm is statistically and significantly more random than the current implementation, and there is evidence that XORasm's generated data distribution is practically random at a 99.95% confidence level, suitable for implementation in embedded systems as a lightweight PRNG. [ABSTRACT FROM AUTHOR]

Fluid flow throttling is common in industrial and building services engineering. Similar tunnel throttling of vehicular flow is caused by the abrupt number reduction of roadway lane, as the tunnel has a lower lane number than in the roadway normal segment. To predict the effects of tunnel throttling of annular freeway vehicular flow, a three-lane continuum model is developed. Lane III of the tunnel is completely blocked due to the need of tunnel rehabilitation, etc. There exists mandatory net lane-changing rate from lane III to lane II just upstream of the tunnel entrance, which is described by a model of random number generated through a golden section analysis. The net-changing rate between adjacent lanes is modeled using a lane-changing time expressed explicitly in algebraic form. This paper assumes that the annular freeway has a total length of 100 km, a two-lane tunnel of length 2 km with a speed limit of 80 km/h. The free flow speeds on lanes I, II and III are assumed to be 110, 100 and 90 km/h respectively. Based on the three-lane continuum model, numerical simulations of vehicular flows on the annular freeway with such a tunnel are conducted with a reliable numerical method of 3rd-order accuracy. Numerical results reveal that the vehicular flow has a smaller threshold of traffic jam formation in comparison with the case without tunnel throttling. Vehicle fuel consumption can be estimated by interpolation with time averaged grid traffic speed and an assumed curve of vehicle performance. The vehicle fuel consumption is lane number dependent, distributes with initial density concavely, ranging from 5.56 to 8.00 L. Tunnel throttling leads to an earlier traffic jam formation in comparison with the case without tunnel throttling. [ABSTRACT FROM AUTHOR]

Recent advancements in communication technologies have highlighted the pivotal role of information security for all individuals and entities. In response, researchers are increasingly focusing on cryptographic solutions to ensure the reliability of confidential information. Recognizing the superiority of chaotic systems preference as entropy source of cryptographic systems, this paper proposes a novel true random number generator (TRNG) design by combining four different chaotic systems outputs, tailored for real-time video encryption application. These chaotic systems are continuous-time Lorenz and fractional-order Chen-Lee systems, as well as discrete-time Logistic and Tent maps. This study generates true random bit (TRB) sequences at a high bit rate (25 Mbps) through the hardware implementations of four distinct chaotic systems to have the best statistical randomness in the resulting output. Then, the cryptographic true random key bits (8-bit at 25 MHz frequency) are employed in the post-processing with real-time video data by using the XOR operation, a fundamental post-processing algorithm. The real-time video encryption application is executed on an experimental assembly, composed of a Field Programmable Gate Array (FPGA) development kit, an OV7670 camera module, a VGA monitor, and prototype circuit boards for the chaotic systems. To evaluate the effectiveness of the proposed encryption system, several security assessments are conducted. These include NIST SP 800 − 22 statistical tests, FIPS 140-1 standards, chi-square tests, histogram and correlation analysis, and NPCR and UACI differential attack resilience tests. Consequently, the findings suggest that the presented real-time embedded cryptosystem is robust and suitable for secure communications, particularly in the realm of video transmission. [ABSTRACT FROM AUTHOR]

In the era of information, emerging hardware security primitives, i.e., hardware random number generators and physically unclonable functions, hold profound promise for the establishment of exceptionally secure network information systems. Nonetheless, these potential solutions are constrained by inherent drawbacks, including the need for additional error correction circuits or algorithms, heightened susceptibility to environmental interference, and limited data density. This paper demonstrates the extremely high‐density, physical‐unclonable cryptographic keys by harnessing stochastically ferroelectric domain polarizations in Aurivillius ferroelectric material CaBi2Nb2O9 (CBNO). Ferroelectric polarization of CBNO nanodomains can serve as a robust source of physical unclonable entropy. Through the application of high‐speed voltage pulses, the inherent randomness of ferroelectric polarizations can be enhanced, thereby yielding cryptographic keys characterized by remarkable uniformity, uniqueness, and negligible environmental sensitivity. More importantly, the voltage pulse operations facilitate the configurability of the ferroelectric cryptographic keys with no correlation. An unprecedented data density of 435 Gbit µm−2 is therefore achievable with a miniaturized CBNO of less than 1 um2. Notably, the reconfigured keys successfully pass the National Institute of Standards and Technology random number tests without requiring additional post‐processing steps. Emanating from the inherent attributes of the material, these high‐density ferroelectric keys confer intrinsic advantages to information security, evincing substantial resistance to duplication or cloning. [ABSTRACT FROM AUTHOR]

Randomness extraction is a key problem in cryptography and theoretical computer science. With the recent rapid development of quantum cryptography, quantum‐proof randomness extraction has also been widely studied, addressing the security issues in the presence of a quantum adversary. In contrast with conventional quantum‐proof randomness extractors characterizing the input raw data as min‐entropy sources, it is found that the input raw data generated by a large class of trusted‐device quantum random number generators can be characterized as the so‐called reverse block source. This fact enables us to design improved extractors. Two novel quantum‐proof randomness extractors for reverse block sources that realize real‐time block‐wise extraction are proposed specifically. In comparison with the general min‐entropy randomness extractors, the designs achieve a significantly higher extraction speed and a longer output data length with the same seed length. In addition, they enjoy the property of online algorithms, which process the raw data on the fly without waiting for the entire input raw data to be available. These features make the design an adequate choice for the real‐time post‐processing of practical quantum random number generators. Applying the extractors to the raw data generated by a widely used quantum random number generator, a simulated extraction speed as high as 300 Gbps is achieved. [ABSTRACT FROM AUTHOR]

Background: Gross anatomy has been taught over the years by cadavers' dissection, plastic models and atlases. This study is aimed to compare conventional teaching methods of anatomy with that of 3D cyber anatomy. Materials & Methods: This longitudinal cross-sectional study with prospective type was conducted in Khyber Girls Medical College Peshawar, having a sample size of 233 from three different colleges, using Open-Source Statistics for Public Health sample size calculator. Using random number generator 80 students were made to attempt a pretest and a post-test consisting of 20 MCQs prior to and after completion of GIT and Renal module respectively. Results: Out of 585 students, 240 (80 from each medical college) students took part in the study with 144 female students. Mean age of the students was 20.7 +/-1.07 years. College 2 had highest post-test mean score. The mean difference of test scores between post-test and pre-test among all colleges were statically significant as calculated by paired sample T-test. There was significant difference in mean score of post-tests among 3 colleges which was find out by One-way ANOVA. Post hoc tests identified that post test scores of college 2 was statically different from college 1 and college 3. Our results also showed a significant difference in post-test scores between gender with female students scoring higher than male students. Conclusion: There was no difference in academic performance between the students taught either by conventional method or 3D cyber anatomy and a better performance of female students as compared to male students was also noted. [ABSTRACT FROM AUTHOR]

Pseudo-random number generators are predominantly utilised as entropy sources in encryption and seeding processes, however, they are deterministic by nature. This paper presents the analysis and design methodology of an on-chip quantum noise source that may suitably be used as an entropy source in true random number generators. Quantum tunnelling is achieved through the strong biasing of a MOS structure to generate gate-referred shot noise. Structures are fabricated in a commercial 40 nm process and the sampled noise is tested against the NIST SP800-90B and SP800-22 test suites, showing a maximal entropy of 0.985 at a bias current of 1500 µA with a consistent pass rate across all NIST tests. [ABSTRACT FROM AUTHOR]

This paper introduces a low-complexity start–stop true random number generator (TRNG) utilizing jitter in ring oscillators (ROs). Incorporating phase detectors enhances entropy extraction from the same number of ROs. The raw bits undergo online post-processing using the SHA-1 algorithm, which is widely supported by many programming languages. The output bit streams pass all NIST statistical tests (SP 800-22 and SP-90B). Bits are generated on demand, enhancing security by preventing eavesdropping during continuous bit production. The TRNG maintains its performance regardless of the FPGA manufacturer. [ABSTRACT FROM AUTHOR]

The incorporation of randomness into stochastic computing can provide ample opportunities for applications such as simulated annealing, non‐polynomial hard problem solving, and Bayesian neuron networks. In these cases, a considerable number of random numbers with an accurate and configurable probability distribution function (PDF) are indispensable. Preferably, these random numbers are provided at the hardware level to improve speed, efficiency, and parallelism. In this paper, how spin‐orbit torque magnetic tunnel junctions (SOT‐MTJs) with high barriers are suitable candidates for the desired true random number generators is demonstrated. Not only do these SOT‐MTJs perform excellently in speed and endurance, but their randomness can also be conveniently and precisely controlled by a writing voltage, which makes them a well‐performed Bernoulli bit. By utilizing these SOT‐MTJ‐based Bernoulli bits, any PDF, including Gaussian, uniform, exponential, Chi‐square, and even arbitrarily defined distributions can be realized. These PDF‐configurable true random number generators can then promise to advance the development of stochastic computing and broaden the applications of the SOT‐MTJs. [ABSTRACT FROM AUTHOR]

The telecommunications industry has made huge strides, and multimedia information transmission is exploding. Text, sound, and video can all be used to create multimedia data. As a result, having systems in place to protect private or sensitive data and keep its security is critical. In this article, completely random numbers were generated in two different ways, and the extent of their randomness was tested in many ways to ensure their suitability for use in different cryptographic applications. The proposed models in this article depend on a chaos based Pseudo-random number generators (PRNGs). PRNGs, which create bit sequences, have evolved into a critical component in many industries, including encrypted communication, Wireless communication using a spread spectrum, computational simulations, RF identification networks, and coding for error correction. The PRNGs is designed by combining the memristor that is discrete with the logistic map and the memristor that is discrete with sine map both separately to construct the novel algorithms called a two-dimensional memristive logistic map (2D-MLM) and two dimensional memristive sine map (2D-MSM) and each cycle yields a sequence of 32 random bits. The binary64 dual precision format is employed for arithmetic using floating-point in accordance with the IEEE 754-2008 standard. To assess the generator's performance, several statistical analyses are utilized. The results of the tests that evaluated the presented algorithms showed that the space key was improved and increased by 3.2% compared to other generators, and the performance speed was increased by 12.22%. The findings reveal that the sequences that are created have an elevated degree of unpredictability and a high level of security, which renders them excellent for cryptographic use in terms of the speed, the large key space, and high data rate. [ABSTRACT FROM AUTHOR]

Introduction: Carboxymethylcellulose/polyethylene oxide, also known as Oxiplex gel, is commonly used during lumbar discectomy operations. It serves to cover the surgical site, preventing adhesions and providing relief from pain and symptoms. However, there is ongoing debate regarding the extent of its beneficial effects on postoperative pain intensity, level of disability, and overall improvement of musculoskeletal conditions. Therefore, the objective of this study is to evaluate the advantages and limitations of using Oxiplex gel in lumbar laminectomy procedures specifically for herniated discs. Methods: A randomized controlled trial was conducted on 56 consecutive patients who were candidates for unilateral lumbar discectomy on one lumbar surface. The patients were chosen based on their clinical manifestations and imaging findings. After the initial assessment, the patients underwent either laminectomy or laminotomy surgery. Following the surgery, the patients were randomly assigned to either the intervention group (receiving Oxiplex gel) or the control group. This assignment was done using a computerized random number generator. Assessments were conducted before the operation, as well as 3 and 6 months post-surgery for all patients. Results: There was no significant difference found between the Oxiplex gel and control groups in terms of radicular and low back pain intensity, as well as disability scores, at different time points after surgery (p = 0.336, p = 0.65, and p = 0.336, respectively). Additionally, there were no significant differences found in the prevalence of sexual or sphincteric disorders between the two groups during postoperative assessments (p = 0.639 and p = 0.15, respectively). Furthermore, no significant differences were observed in the results of the postsurgical neuromuscular evaluation under different lower extremities conditions between the two groups. Conclusions: Based on our findings, it was observed that Oxiplex gel did not demonstrate any improvement in post-unilateral lumbar discectomy symptoms or musculoskeletal power. [ABSTRACT FROM AUTHOR]

In the last two decades or so, a large number of image ciphers have been written. The majority of these ciphers encrypt only one image at a time. Few image ciphers were written which could encrypt multiple images in one session. The current era needs speedy multiple image ciphers to address its varied needs in different settings. Motivated by this dictation, the current study has ventured to write a multi-image cipher based on the fleet of pawns walking in the large hypothetical chessboard. This walk of pawns on the chessboard has been ingeniously linked with transferring the pixels from the plain image to the scrambled image. The confusion effects have been realized through the XOR operation between the scrambled image and the key image. The plaintext sensitivity has been incorporated by embedding the SHA-384 hash codes of the given large combined plain image. Moreover, the Henon map has been employed to spawn the streams of random numbers. Besides, Blum Blum Shub random number generator has been used to further cement the security of the proposed cipher. We got a computational time of 0.2278 seconds and an encryption throughput of 5.5782 MBit/seconds by using the four images with a size of 256×256. Apart from that, the information entropy gained is 7.9993. Lastly, the cipher has been subjected to an array of validation metrics to demonstrate its aversion to the myriad threats from the cryptanalysis savvy. We contend that the proposed work has great potential for some real-world applications. [ABSTRACT FROM AUTHOR]

In the context of the second quantum revolution, the ability to manipulate quantum systems is already used for various techniques and a growing number of technology demonstrators, mostly with low energy photons. In this frame, our intention is to extend quantum technologies to gamma photons. Our aim is to take advantage of resources brought by entanglement with higher energy particles, particularly electron-positron annihilation quanta. Tools for low frequency quantum experiments are not suitable for penetrant radiation, consequently we need to use effects typical to the keV-MeV energy range instead. High energy photon protocols would include fundamental properties testing, industrial imaging, quantum random number generators, quantum simulators, military applications and improvement of already existing medical procedures. In this paper we review some important steps in the study of annihilation photon correlations, we point out the experimental differences and necessities with respect to the energy increase in quantum photonic experiments and we describe the design of a quantum gamma device we propose for experiments meant to prove feasibility of gamma ray based protocols. The perspective behind our project is to evidence the possibility to communicate via entangled quanta through media which are not transparent for low energy photons. [ABSTRACT FROM AUTHOR]

This article provides an analysis of a fundamental issue in Yijing studies （易学), that is, how to obtain a gua (卦, or hexagram) from Yijing divination. It modifies existing interpretations of the Dayan Divination method (大衍筮法) and proposes a new algorithm, thereby discovers the probability distribution of all gua in Yijing (易卦). The sixty-four hexagrams (重卦, 或六爻卦) of Yijing have appeared during the Shang Dynasty (ca BCE 1600-1046) and became prevalent during the Zhou Dynasty (ca BCE 1045-256), forming the foundation of Yijing. The images of gua (卦象, 64 hexagrams with six lines (爻) each and 8 trigrams (单卦) with three lines) constitute a systematic whole. Any interpretation of Yijing needs to be based on the full set of gua images. Yijing is well known as the foremost origin of all the Chinese classics, and the "divine intent" revealed by the Yijing gua is the source from which various concepts as well as their interpretations of Chinese civilization are drawn. As Yijing being a divination book, the "divine revelation" embodied in the gua serves as the authentic source in Chinese tradition to seek guidance for all kinds of risk decision-making. Regardless of applications of wide variety, the wisdom of Fuxi (伏羲, ca BCE 4600-?), the archaic sage of Chinese civilization and the root source of Yijing, has been congealed and conveyed through Yijing gua. How to acquire a gua related to "my issue," viz., how to get know the divine intent from Heaven guiding the matters of my concern is the key question to all Yijing users. The answer involves three stages: requesting in earnest; throwing divination to obtain the gua; interpreting the underlying meaning of gua. Of them, the legitimacy of the request depends on sincerity of the prayer; the interpretation of mystic revelation of the acquired gua benefits from collective experience and intelligence. The divination throw, the stage in the middle, however, relies on the Dayan Divination method, which is the only authentic way to obtain a gua in Yijing. The Dayan Divination method is essentially a random number generator. The four numbers entailed from the divination process represent the four primary symbols (四象): 6 (六) represents the Great Yin (⚏, 老阴), 7 (七) represents the Lesser Yang (⚎, 少阳), 8 (八) represents the Lesser Yin (⚍, 少阴), and 9 (九) represents the Great Yang (⚌, 老阳). The probabilities to obtain the random number 6, 7, 8, 9 are 1/16, 5/16, 7/16, and 3/16, respectively. (This probability distribution is way different from the simplified method used in the public commoners known as the "coin flipping method.") With the Dayan Divination, the probability distribution of the entire system of gua in Yijing can be inferred, which is of significant importance for examining and calculating the connections and evolutions among gua. (See Appendix II) In Appendix I, the author provides a thorough analysis of Shao Yong's "doubling method" and its close association with Leibniz's binary algorithm. With the new perspective created by the binary coding, he is therefore convinced that the Shao Yong-Leibniz sequence is indeed a substantial advancement in the overall ordering of gua in Yijing, and subsequently proposes an innovative approach enabling, extending and deepening Yijing studies. [ABSTRACT FROM AUTHOR]

All quantum random number generators based on measuring value indefinite observables are at least three-dimensional because the Kochen–Specker Theorem and the Located Kochen–Specker Theorem are false in dimension two. In this article, we construct quantum random number generators based on measuring a three-dimensional value indefinite observable that generates binary quantum random outputs with the same randomness qualities as the ternary ones: the outputs are maximally unpredictable. [ABSTRACT FROM AUTHOR]

In this paper, we provide a complete set of algorithms aimed at the design and security evaluation of oscillator-based True Random Number Generators (TRNG). While depending on some TRNG design assumptions, the proposed algorithms use as inputs the statistical parameters of the underlying random physical process such as the clock jitter originating from the thermal noise and give a lower bound of the entropy rate of the generated bit stream as output. We describe the general structure of a TRNG composed of multiple free-running oscillators and samplers, the outputs of which are post-processed by an entropy conditioner. Depending on the specification of the entropy conditioner, which can usually be any Boolean function, we describe several algorithmic optimizations. We then explain how to compute and efficiently manage the entropy rate at the output of such a post-processing block and at the output of the generator as a whole. [ABSTRACT FROM AUTHOR]

Background: Atherosclerotic cardiovascular disease (ASCVD) continues to be a significant contributor to global mortality, impacting over 523 million individuals worldwide. Dyslipidemia stands as one of the foremost risk factors for ASCVD. Thus, prioritizing the reduction of low-density lipoprotein cholesterol (LDL-C) levels is essential in mitigating cardiovascular complications. Objective: This study aimed to evaluate the lipid-lowering activity of a dietary supplement containing monoglucosyl rutin (MR) in individuals with low to mild hypercholesterolemia. Methods: This was a randomized, placebo-controlled, double-blind, parallel-group study conducted from April 20 to December 24, 2022. The study population included 56 healthy Japanese adult participants with LDL-C levels between 120-139 mg/dL who were randomly allocated to either the MR or placebo groups (n = 28/group) using a computerized random number generator. 200 mg of MR or placebo divided into 3 tablets was given daily; participants were instructed to take 1 tablet with water after each meal for 12 weeks. The main focus was on measuring the serum LDL-C level as the primary outcome, with additional attention given to secondary outcomes such as serum high-density lipoprotein cholesterol (HDL-C), total cholesterol, and non-HDL-C levels. The study also evaluated the percentage of participants achieving serum LDL-C levels below 120 mg/dL after the 12-week intervention. Assessments were conducted after 4, 8, and 12 weeks of intervention. Results: There were 54 (27 in each group) participants in the per-protocol set (PPS) and 53 (placebo group, 26; MR group, 27) participants in the modified PPS (mPPS). A statistically significant group difference in serum LDL-C levels was observed (P < 0.05), with a 5.0% decrease from preintervention to after 12 weeks. The reduction in LDL-C levels coincided with statistically significant decreases in total cholesterol levels, non-HDL-C levels, and the LDL-C/HDL-C ratio. During the study period, there was no adverse event or concern about the safety of MR. Conclusions: MR has potential as a preventive or therapeutic tool for improving improve long-term health and reducing cardiovascular morbidity. [ABSTRACT FROM AUTHOR]