WO2016070855A1 - Procédé de production de codes variables - Google Patents

Procédé de production de codes variables Download PDF

Info

Publication number
WO2016070855A1
WO2016070855A1 PCT/CR2014/000005 CR2014000005W WO2016070855A1 WO 2016070855 A1 WO2016070855 A1 WO 2016070855A1 CR 2014000005 W CR2014000005 W CR 2014000005W WO 2016070855 A1 WO2016070855 A1 WO 2016070855A1
Authority
WO
WIPO (PCT)
Prior art keywords
events
numbers
asynchronous
random
event
Prior art date
Application number
PCT/CR2014/000005
Other languages
English (en)
Spanish (es)
Inventor
Carlos Luis CORDERO JIMÉNEZ
Original Assignee
Monitoreo Tecnológico, S.A.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Monitoreo Tecnológico, S.A. filed Critical Monitoreo Tecnológico, S.A.
Priority to PCT/CR2014/000005 priority Critical patent/WO2016070855A1/fr
Publication of WO2016070855A1 publication Critical patent/WO2016070855A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators

Definitions

  • the present invention relates to the technological field as it is a process of generating codes from asynchronous or pseudo-asynchronous events by means of a manual or automatic command.
  • asynchrony is defined as "Lack of temporal coincidence in the facts.” In engineering it is considered “asynchronous”, a phenomenon or event that is completely isolated and without continuation or correspondence in time with another event, whether or not similar.
  • the asynchronous event-based model makes the advantages of multithreaded applications available to the user, while avoiding many of the complex problems inherent in multithreaded design. Using a class that supports this model can allow you to:
  • each output can be described by a Boolean function of its input variables. That is, the outputs of a combinational network depend only on their inputs.
  • the element that is replaced by the variable symbol is called the variable value.
  • a Boolean constant is a value belonging to the set ⁇ 0,1 ⁇ .
  • the values of the outputs, at a given time do not depend exclusively on the values of the inputs at that time, but also depend on the previous state or internal state.
  • bistable The bistable sequential system is the bistable, and of this, the type D (or bolt) is the most commonly used today.
  • a random number is generated by a mathematical formula or with the help of software that is responsible for generating it through an algorithm.
  • a set of variable numbers can be said to be obtained in such a way that every number obtained has the same probability of being chosen and the choice of one does not depend on the choice of the other. Whenever random numbers are generated, there is talk of a set of numbers in a range (1, n) in which the probability that one of those numbers is chosen will always be 1 / n.
  • Variable numbers are normally used to represent reality through mathematical models such as that of the daily climate (with certainty it is not known what the weather of a particular day will be), since the weather of one day does not depend on the weather of the previous day, so the probability of rain today does not influence the probability of rain tomorrow.
  • average points are used and plotted on a Cartesian plane, to later draw the line that allows identifying which are the closest points and in this way have a minimum range and margin of error on the calculation that is being made at a variable.
  • Variable number sets are very useful in probability and statistics, because their use allows empirically estimating various probabilities and hopes.
  • Variable numbers are always being used in web applications with which you interact every day, a way to simulate variable numbers can be using "javascript" with the random method.
  • Variable numbers generated with JavaScript can be used for countless things on a web page: display a random banner, a different header, a phrase, generate a security code, etc. 2.3. Types of random numbers:
  • a value generator for a random variable is achieved in two steps: • First you have to define a random number generator evenly distributed between 0 and 1.
  • a sequence is a segment of the numbers produced by the generator: a sequence ends where the next one begins.
  • a variable number generator consists of a function that returns the values of a sequence of real numbers, (ui, U2,..., N ), where each u is in the range [0, 1]
  • the first element of the sequence is called the initial seed of the series, and from it it must be possible to generate the rest of the sequence so that it is reproducible.
  • the generated sequence must be quite long, in order to allow long simulations and / or with many random variables. • It must be computed very efficiently, since each simulation could require the generation of a considerable number of variable numbers, of the order of millions.
  • the condition of uniformity must also be met for all sub-sequences of size k of the generated sequence. That is, the u ⁇ must be distributed evenly in [0, 1] the pairs (u ⁇ , u ⁇ + i) must be distributed evenly in the plane [0, 1] x [0, 1] the triplets (u ⁇ , u ⁇ + I, u ⁇ + 2) must be distributed evenly in the cube [0, 1] 3 . Ensuring the k-uniformity of the sequences is crucial for simulation experiments.
  • the series obtained can be replayed.
  • the most frequently used are based on electrical circuits equipped with a noise source (often a resistor or a semiconductor diode) that is amplified, sampled and compared with a reference signal to produce bit sequences. For example, if the noise is less than the reference a 0 is produced and if a 1 is greater.
  • a noise source often a resistor or a semiconductor diode
  • the 1's do not have the same probability as the 0's, so they must be post-processed to obtain random bit sequences.
  • Arithmetic They are deterministic algorithms that are executed by the computer.
  • N ⁇ + 1 (aN ⁇ + c) mod m where "a” is the multiplier and "m" the module.
  • the sequence is periodic: when a number reappears a second time, the sequence is repeated.
  • the period depends on the values of a, c and m, as well as the initial value; the maximum possible is m.
  • each new random integer Ni is obtained by manipulating the bits of the previous number, Ni— 1. In C language, this can easily be done 0 using operators on bits, » «, ⁇ ,
  • p (x) be defined in a finite interval, (a, b), and M an upper bound of p (x).
  • the value x appears with a probability density p (x), although not all the values we obtain in the method are used.
  • a variable with chi-square distribution with k degrees of freedom can be obtained by adding the squares of k variables with distribution N (0, 1).
  • a variable with Erlang-k distribution can be obtained by adding k variables with exponential distribution.
  • sequences of maximum period m are obtained. For example, if m is a power of 2, it would be enough that c is odd and "a" equals
  • the autocorrelation test verifies the correlation between random numbers and compares them with the desirable zero correlation.
  • the GAP test (of gaps or distance): is used to ensure that the recurrence ⁇ 0 of each particular digit in a number flow occurs with a random interval. The KS test is then used to compare these intervals with the expected length of gaps.
  • the Poker test test groups of numbers together like a poker hand and! 5 compare each hand with the expected hand using the Chi-square test.
  • test run up and down it is usually the main test used to verify the dependence. Detects if a statistically unacceptable pattern that increases or decreases exists between adjacent numbers in a flow of numbers.
  • the invention is mainly used in the field of statistics, systems simulation, key generation for information encryption.
  • Number banks are currently generated by two main methods, the first is through algorithms that take a "seed" which is a presumed number chosen from a selection and with that seed through specialized algorithms it generates a set of numbers which actually they are predictable) by what they are called pseudo variables.
  • the second method is through devices that take numbers generated by variable physical phenomena, these phenomena can be white noise, thermal noise, cosmic noise, atmospheric variables, etc. These values are unpredictable or
  • the behavior of complex living beings is determined by events
  • the present invention consists of a method to generate codes from asynchronous or pseudo-asynchronous events consists in collecting numbers from numerous 5 sources, each source sends the number asynchronously by means of a command manual or automatic The collection of numbers collected is grouped into groups to form asynchronous codes of different sizes.
  • the source is software that takes the least significant bit of a computer clock and sends it via Internet protocols to the collector. This software can be any instant messaging system such as MSN Messenger, ICQ, Yahoo! Messenger, Aol Instant Messenger, Google talk. The source can send larger numbers.
  • the process generates codes or keys for communications, system simulation or encrypted transactions from asynchronous events. For this, the process starts from the digitization of an event, the specific time of occurrence of the event is recorded. That time is sent to a server and when it is on that server the least significant bit of the time sent consisting of a one or a zero is selected. The union of all events constitutes an unrepeatable row of codes whose flow must be continuous.
  • This process allows the collection and grouping of events from various remote sources.
  • software is used that takes an event registered in an electronic device and sends it to a central computer which groups it together to form large chains of events.
  • the process sends the recorded event using a manual command or an automatic pseudo asynchronous, asynchronous or synchronous command.
  • You could use one or more bits taken from the clock of an electronic device as a recorded event.
  • the method could use as a source of the registered number the value of the clock generated by an integrated circuit of a computer equipment, cell phone, appliances; the watch
  • the method uses a computer, a cell phone, a smart device, an electronic tablet, an electronic phone book, microprocessor devices, microcontrollers, machines as a sending device for the registered number. sequential logics, slot machines, ATMs, video game consoles.
  • the software that facilitates it can be instant messaging systems which requires human, animal or machine interaction, instant messaging systems MSN Messenger, ICQ, Yahoo! Messenger, Aol Instant Messenger, Google talk, search engines and internet, social networks and use as a means of communication the
  • the events generated are grouped in the order of arrival, in random order, in groups of variable size, in arrangements sequentially or randomly.
  • the number of events sent to the central computer is greater than one and an array of centralized or distributed servers is used as the central computer.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Le procédé pour produire des codes à partir d'événements asynchrones ou pseudo-asynchrones consiste à recueillir des numéros de nombreuses sources, chaque source envoie le numéro de manière asynchrone par l'intermédiaire d'une commande naturelle ou automatique. La collection de numéros recueillie se groupe pour former des codes asynchrones de différentes tailles. La source est un logiciel qui prend le bit le moins important de l'horloge d'un ordinateur et l'envoie par l'intermédiaire d'un protocole Internet au collecteur. Ce logiciel peut être n'importe quel système de messagerie instantanée tel que MSN Messenger, ICQ, Yahoo! Messenger, Aol Instant Messenger, Google talk. La source peut envoyer des numéros de plus grande taille.
PCT/CR2014/000005 2014-11-06 2014-11-06 Procédé de production de codes variables WO2016070855A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CR2014/000005 WO2016070855A1 (fr) 2014-11-06 2014-11-06 Procédé de production de codes variables

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CR2014/000005 WO2016070855A1 (fr) 2014-11-06 2014-11-06 Procédé de production de codes variables

Publications (1)

Publication Number Publication Date
WO2016070855A1 true WO2016070855A1 (fr) 2016-05-12

Family

ID=55908625

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CR2014/000005 WO2016070855A1 (fr) 2014-11-06 2014-11-06 Procédé de production de codes variables

Country Status (1)

Country Link
WO (1) WO2016070855A1 (fr)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060069706A1 (en) * 2004-09-28 2006-03-30 Dejan Lazich Random number generator and method for generating random numbers
EP1840731A2 (fr) * 2006-03-31 2007-10-03 Sap Ag Système et procédé pour générer des nombres pseudo-aléatoires
WO2008133590A1 (fr) * 2007-04-30 2008-11-06 Telefonaktiebolaget Lm Ericsson (Publ) Procédé servant à établir un nombre aléatoire pour une sécurité et un chiffrement, et appareil de communications
US20120173599A1 (en) * 2010-12-29 2012-07-05 Hon Hai Precision Industry Co., Ltd. System and method for generating true random numbers using computing device
GB2502541A (en) * 2012-05-30 2013-12-04 Ibm Balancing consumption of random data using multiple sources with different levels of entropy
GB2508447A (en) * 2013-03-28 2014-06-04 Randomize Ltd Testing software by generating pseudorandom control signals

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060069706A1 (en) * 2004-09-28 2006-03-30 Dejan Lazich Random number generator and method for generating random numbers
EP1840731A2 (fr) * 2006-03-31 2007-10-03 Sap Ag Système et procédé pour générer des nombres pseudo-aléatoires
WO2008133590A1 (fr) * 2007-04-30 2008-11-06 Telefonaktiebolaget Lm Ericsson (Publ) Procédé servant à établir un nombre aléatoire pour une sécurité et un chiffrement, et appareil de communications
US20120173599A1 (en) * 2010-12-29 2012-07-05 Hon Hai Precision Industry Co., Ltd. System and method for generating true random numbers using computing device
GB2502541A (en) * 2012-05-30 2013-12-04 Ibm Balancing consumption of random data using multiple sources with different levels of entropy
GB2508447A (en) * 2013-03-28 2014-06-04 Randomize Ltd Testing software by generating pseudorandom control signals

Similar Documents

Publication Publication Date Title
Ma et al. A machine learning attack resistant multi-PUF design on FPGA
Tuncer The implementation of chaos-based PUF designs in field programmable gate array
Vassilev et al. The importance of entropy to information security
CN109614790A (zh) 基于反馈环puf的轻量级认证设备及认证方法
Hussain et al. A built-in-self-test scheme for online evaluation of physical unclonable functions and true random number generators
Dang Changes in federal information processing standard (FIPS) 180-4, secure hash standard
AU2021200063B2 (en) Systems and computer-implemented methods for generating pseudo random numbers
Hussain et al. BIST-PUF: Online, hardware-based evaluation of physically unclonable circuit identifiers
Zhu et al. A novel iris and chaos-based random number generator
Pundir et al. Novel technique to improve strength of weak arbiter PUF
CN115686437A (zh) 随机数生成方法、装置、计算机设备和存储介质
US20160110165A1 (en) Quality detecting method, random number generator, and electronic device
KR20170092601A (ko) 재료 샘플에 존재하는 물리적 변화를 이용하여 난수를 생성하기 위한 시스템 및 방법
WO2016070855A1 (fr) Procédé de production de codes variables
CN113946882B (zh) 基于施密特触发器的超低功耗弱物理不可克隆函数电路
Zacharias et al. Chaotic ring oscillator based true random number generator implementations in fpga
Garipcan et al. A gigabit TRNG with novel lightweight post-processing method for cryptographic applications
Sahithi et al. Delay based physical unclonable function for hardware security and trust
CN102915520A (zh) 一种基于Kirkman女生问题解决方案的图像置乱方法
Aghaie et al. PUFs physical learning: accelerating the enrollment via delay-based model extraction
Tan et al. Study of linearly cross-coupled chaotic systems for a random bit generator
KR20200003111A (ko) 난수 생성기
Stojanovski et al. Construction of Markov partitions in PL1D maps
De Micco et al. RO-based PRNG: FPGA implementation and stochastic analysis
Tobin et al. Secrecy and Randomness: Encoding Cloud data Locally using a One-Time Pad

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: CR2015-000100

Country of ref document: CR

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14905399

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14905399

Country of ref document: EP

Kind code of ref document: A1