The entropy of a distributed computation random number generation from memory interleaving

Antoniadis, Karolos; Blanchard, Peva; Guerraoui, Rachid; Stainer, Julien

doi:10.1007/s00446-017-0311-5

Cited by 3 publications

(4 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], the authors investigated the processes that exchange data through shared memory in distributed systems, in order to establish the possibility of randomly obtaining them from the main scheduler. They present a general method of calculating these values by classifying distributed algorithms according to their scheme of access to shared memory.…”

Section: Subject Area Analysis and Related Decisionsmentioning

confidence: 99%

A Method for Determining the Effectiveness of a Distributed System for Detecting Abnormal Manifestations

SAVENKO¹,

Каштальян²

2022

CSIT

View full text Add to dashboard Cite

mandatory step, which is carried out to confirm the correctness, feasibility and feasibility of the developed solutions, including architecture, method of maintaining system integrity. In order to conduct a study on the effectiveness of the use of self-organized distributed systems, anomalies in computer systems were identified in relation to the evaluation criteria. Determining the specifics of the application of the system also affects the choice of criteria for evaluating effectiveness. The method of determining the effectiveness of the proposed solutions for the developed self-organized distributed system for detecting anomalies in computer systems has been developed. Software has been developed to ensure the functioning of a self-organized distributed anomaly detection system in computer systems to confirm the feasibility of the proposed solutions. Experimental studies with the developed implementation of a self-organized distributed system for detecting anomalies in computer systems according to the obtained coefficients confirmed the effectiveness of the proposed solutions and the developed distributed system for its operation in the computer network.

show abstract

Section: Subject Area Analysis and Related Decisionsmentioning

confidence: 99%

A Method for Determining the Effectiveness of a Distributed System for Detecting Abnormal Manifestations

SAVENKO¹,

Каштальян²

2022

CSIT

View full text Add to dashboard Cite

show abstract

“…It guarantees that the zero solution of the error equation is asymptotically stable. From the chaos generalized synchronization (GS) theorem [28], systems (8) and (13) as well as (9) and (14) are GS with respect to the transformation = for any initial value ( (0), (0)) ∈ R 3 × R 3 and ( (0), (0)) ∈ R 3 × R 3 . Since is invertible, systems (13) and (14) are also chaotic.…”

Section: -Dimensional Chaotic Generalized Synchronic Systemsmentioning

confidence: 99%

“…where = 1, 2, 3, and are defined by (8) and (13), and and are defined by (9) and (14). First, introduce transformations 11 , 12 , 13 , and 14 : R → {0, 1, .…”

Section: Numerical Simulationsmentioning

confidence: 99%

“…Pseudorandom numbers have wide range of applications in many fields, such as physical systems simulation [3][4][5][6], information encryption [7][8][9][10][11][12][13], entertainment [14,15], and computer simulation [16][17][18][19][20]. In the practical applications, pseudorandom algorithm has almost replaced the stochastic indicator and random number generator based on the hardware.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Robust Chaos of Cubic Polynomial Discrete Maps with Application to Pseudorandom Number Generators

Han

Lee

Zang

et al. 2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Based on the robust chaos theorem of S-unimodal maps, this paper studies a kind of cubic polynomial discrete maps (CPDMs) and sets up a novel theorem. This theorem gives general conditions for the occurrence of robust chaos in the CPDMs. By using the theorem, we construct a CPDM. The parameter regions of chaotic robustness of the CPDM are larger than these of Logistic map. By using a fixed point arithmetic, we investigate the cycle lengths of the CPDM and a Logistic map. The results show that the maximum cycle lengths of 1000 chaotic sequences with length 3×107 generated by different initial value conditions exponentially increase with the resolutions. When the resolutions reach 10-7~10-13, the maximum cycle lengths of the cubic polynomial chaotic sequences are significantly greater than these of the Logistic map. When the resolution reaches 10-14, there is the situation without cycle for 1000 cubic polynomial chaotic sequences with length 3×107. By using the CPDM and Logistic map, we design four chaos-based pseudorandom number generators (CPRNGs): CPRNGI, CPRNGII, CPRNGIII, and CPRNGIV. The randomness of two 1000 key streams consisting of 20000 bits is tested, respectively, generated by the four CPRNGs. The result suggests that CPRNGIII based on the cubic polynomial chaotic generalized synchronic system has better performance.

show abstract

Generating True Random Numbers Based on Multicore CPU Using Race Conditions and Chaotic Maps

2020

View full text Add to dashboard Cite

The entropy of a distributed computation random number generation from memory interleaving

Cited by 3 publications

References 35 publications

A Method for Determining the Effectiveness of a Distributed System for Detecting Abnormal Manifestations

A Method for Determining the Effectiveness of a Distributed System for Detecting Abnormal Manifestations

Robust Chaos of Cubic Polynomial Discrete Maps with Application to Pseudorandom Number Generators

Generating True Random Numbers Based on Multicore CPU Using Race Conditions and Chaotic Maps

Contact Info

Product

Resources

About