Massimo Regoli
"Tor Vergata" University of Rome, Ingegneria, Faculty Member
Research Interests:
Research Interests:
Starting from the late 60’s many experiments have been performed to verify the violation Bell’s inequality by Einstein–Podolsky–Rosen (EPR) type correlations. The idea of these experiments being that: (i) Bell’s inequality is a... more
Starting from the late 60’s many experiments have been performed to verify the violation Bell’s inequality by Einstein–Podolsky–Rosen (EPR) type correlations. The idea of these experiments being that: (i) Bell’s inequality is a consequence of locality, hence its experimental violation is an indication of non locality; (ii) this violation is a typical quantum phenomenon because any classical system making local choices (either deterministic or random) will produce correlations satisfying this inequality. Both statements (i) and (ii) have been criticized by quantum probability on theoretical grounds (not discussed in the present paper) and the experiment discussed below has been devised to support these theoretical arguments. We emphasize that the goal of our experiment is not to reproduce classically the EPR correlations but to prove that there exist perfectly local classical dynamical systems violating Bell’s inequality. The conclusions of the present experiment are: (I) no contradi...
Research Interests:
This work follows the paper of the authors: Strongly asymmetric PKD cryptographic algorithms, which introduces a new family of algorithms for key exchange (the double - parametrization algorithm), and here we discuss possible... more
This work follows the paper of the authors: Strongly asymmetric PKD cryptographic algorithms, which
introduces a new family of algorithms for key exchange (the double - parametrization algorithm), and here we discuss
possible configuration of a particular case (a model ) of this family. The present paper describes the implementation
of a model based on matrices described in the following.. The approach will be discussed in the following. Moreover
we will show the problems encountered and solved in the final implementation and the technical issues.
introduces a new family of algorithms for key exchange (the double - parametrization algorithm), and here we discuss
possible configuration of a particular case (a model ) of this family. The present paper describes the implementation
of a model based on matrices described in the following.. The approach will be discussed in the following. Moreover
we will show the problems encountered and solved in the final implementation and the technical issues.
Research Interests:
We prove that the structure of the classical dynamical system, constructed in [AcImRe01] to reproduce the EPR correlations, is a natural consequence of the combination of the general theory of classical dynamical systems with the... more
We prove that the structure of the classical dynamical system, constructed in [AcImRe01] to reproduce the EPR correlations, is a natural consequence of the combination of the general theory of classical dynamical systems with the extension of von Neumann measurement theory, proposed in [Ac93] to include in it the requirements of locality and causality. We then prove some a priori estimates which guarantee the convergence of the simulation procedure. The program to run the experiment is available from the WEB-page: http://volterra.mat.uniroma2.it.
Research Interests:
The present talk describes the result of joint researches in collaboration with Masanori Ohya, Massimo Regoli, Satoshi Iriyama. Its goal is to discuss the main ideas, general construction and abstract scheme of a new class of... more
The present talk describes the result of joint researches in collaboration with Masanori Ohya, Massimo Regoli, Satoshi Iriyama. Its goal is to discuss the main ideas, general construction and abstract scheme of a new class of cryptographic algorithms.\\ Using toy model realizations we will illustrate the above abstract scheme showing how some known PKA algorithms and variants of them can be recovered from the above mentioned construction. \\ Finally we discuss the resiliency of the above scheme to attacks (comparative breaking complexity).
Research Interests:
This is a revised version with respect to the one submitted on Mon, 3 Jul 2000. By mistake an earlier version and not the final one was submitted. We prove that the locality condition is irrelevant to Bell in equality. We check that the... more
This is a revised version with respect to the one submitted on Mon, 3 Jul 2000. By mistake an earlier version and not the final one was submitted. We prove that the locality condition is irrelevant to Bell in equality. We check that the real origin of the Bell’s inequality is the assumption of applicability of classical (Kolmogorovian) probability theory to quantum mechanics. We describe the chameleon effect which allows to construct an experiment realizing a local, realistic, classical, deterministic and macroscopic violation of the Bell inequalities. Index: – Inequalities among numbers – The Bell inequality – Implications of the Bell’s inequalities for the singlet correlations – Bell on the meaning of Bell’s inequality – Critique of Bell’s “vital assumption” – The role of the counterfactual argument in Bell’s proof – Proofs of Bell’s inequality based on counting arguments
Research Interests:
Research Interests:
Strongly asymmetric public key agreement (SAPKA) is a class of key exchange between Alice and Bob that was introduced in 2011. The greatest difference from the standard PKA algorithms is that Bob constructs multiple public keys and Alice... more
Strongly asymmetric public key agreement (SAPKA) is a class of key exchange between Alice and Bob that was introduced in 2011. The greatest difference from the standard PKA algorithms is that Bob constructs multiple public keys and Alice uses one of these to calculate her public key and her secret shared key. Therefore, the number of public keys and calculation rules for each key differ for each user. Although algorithms with high security and computational efficiency exist in this class, the relation between the parameters of SAPKA and its security and computational efficiency has not yet been fully clarified. Therefore, our main objective in this study was to classify the SAPKA algorithms according to their properties. By attempting algorithm attacks, we found that certain parameters are more strongly related to the security. On this basis, we constructed concrete algorithms and a new subclass of SAPKA, in which the responsibility of maintaining security is significantly more asso...
Research Interests:
A new public key agreement (PKA) algorithm, called the strongly-asymmetric algorithm (SAA-5), was introduced by Accardi et al. The main differences from the usual PKA algorithms are that Bob has some independent public keys and Alice... more
A new public key agreement (PKA) algorithm, called the strongly-asymmetric algorithm (SAA-5), was introduced by Accardi et al. The main differences from the usual PKA algorithms are that Bob has some independent public keys and Alice produces her public key by using some part of the public keys from Bob. Then, the preparation and calculation processes are essentially asymmetric. This algorithms has several free parameters more than the usual symmetric PKA algorithms and the velocity of calculation is largely dependent on the parameters chosen; however, the performance of it has not yet been tested. The purpose of our study was to discuss efficient parameters to share the key with high speeds in SAA-5 and to optimize SAA-5 in terms of calculation speed. To find efficient parameters of SAA-5, we compared the calculation speed with Diffie–Hellman (D-H) while varying values of some parameters under the circumstance where the length of the secret shared key (SSK) was fixed. For optimizat...
Research Interests:
A new class of public key agreement (PKA) algorithms called strongly-asymmetric algorithms (SAA) was introduced in a previous paper by some of the present authors. This class can be shown to include some of the best-known PKA algorithms,... more
A new class of public key agreement (PKA) algorithms called strongly-asymmetric algorithms (SAA) was introduced in a previous paper by some of the present authors. This class can be shown to include some of the best-known PKA algorithms, for example the Diffie–Hellman and several of its variants. In this paper, we construct a new version of the previous construction, called SAA-5, improving it in several points, as explained in the Introduction. In particular, the construction complexity is reduced, and at the same time, robustness is increased. Intuitively, the main difference between SAA-5 and the usual PKA consists of the fact that in the former class, B (Bob) has more than one public key and A (Alice) uses some of them to produce her public key and others to produce the secret shared key (SSK). This introduces an asymmetry between the sender of the message (B) and the receiver (A) and motivates the name for this class of algorithms. After describing the main steps of SAA-5, we d...
Research Interests:
Research Interests:
ABSTRACT The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its... more
ABSTRACT The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its properties. The RNA sequences have some sections called Introns. Introns, derived from the term ``intragenic regions,'' are non-coding sections of precursor mRNA (pre-mRNA) or other RNAs, that are removed (spliced out of the RNA) before the mature RNA is formed. Once the introns have been spliced out of a pre-mRNA, the resulting mRNA sequence is ready to be translated into a protein. The corresponding parts of a gene are known as introns as well. The nature and the role of Introns in the pre-mRNA is not clear and it is under ponderous researches by biologists but, in our case, we will use the presence of Introns in the RNA-Crypto System output as a strong method to add chaotic non coding information and an unnecessary behavior in the access to the secret key to code the messages. In the RNA-Crypto System algorithm the introns are sections of the ciphered message with non-coding information as well as in the precursor mRNA.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
In the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC... more
In the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka 2011)] a new scheme to produce public key agreement (PKA) algorithms was proposed and some examples based on polynomials (toy models) were discussed. In the present paper we introduce a non-commutative realization of the above mentioned scheme and prove that non-commutativity can be an essential ingredient of security in the sense that, in the class of algorithms constructed, under some commutativity assumptions on the matrices involved, we can find a breaking strategy, but dropping these assumptions we can not, even if we assume, as we do in all the attacks discussed in the present paper, that discrete logarithms have zero cost.
Research Interests:
We analyze a key agreement algorithm realization, not using Diffie-Hellman approach, but using matrix powers and conjugation. Introduced in a theoretical frame by Sakalauskas et. al. in 2007, it is here implemented in J2ME on mobile... more
We analyze a key agreement algorithm realization, not using Diffie-Hellman approach, but using matrix powers and conjugation. Introduced in a theoretical frame by Sakalauskas et. al. in 2007, it is here implemented in J2ME on mobile devices (Nokia N70 equipped with Symbian S60 operating system). We study its appli-ability and performances and compare them with Elliptic Curve and standard Diffie-Hellman
Research Interests:
Proposes a method using a neuro-fuzzy based model for identification of “off-standard” configurations of large electric distribution network components. The method provides an automatic procedure for off-line processing of historical... more
Proposes a method using a neuro-fuzzy based model for identification of “off-standard” configurations of large electric distribution network components. The method provides an automatic procedure for off-line processing of historical loading data that are made available by an existing monitoring and control system of the grid. The method is based on a version of Simpson's (1993) min-max paradigm, optimized with
Research Interests:
ABSTRACT Standby energy is actually one of the largest electrical end use with the largest potential energy savings in the residential sector. In the paper, a model of the residential customer's demand using a bottom-up approach,... more
ABSTRACT Standby energy is actually one of the largest electrical end use with the largest potential energy savings in the residential sector. In the paper, a model of the residential customer's demand using a bottom-up approach, implemented in a load simulator, has been used in order to evaluate the impact of standby end users on Italian average households' daily load shape. Finally, some more diffuse standby power demand management options have been simulated thus allowing predict possible impacts directly on daily load shape.
Research Interests:
ABSTRACT The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its... more
ABSTRACT The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its properties. The RNA sequences has some sections called Introns. Introns, derived from the term "intragenic regions", are non-coding sections of precursor mRNA (pre-mRNA) or other RNAs, that are removed (spliced out of the RNA) before the mature RNA is formed. Once the introns have been spliced out of a pre-mRNA, the resulting mRNA sequence is ready to be translated into a protein. The corresponding parts of a gene are known as introns as well. The nature and the role of Introns in the pre-mRNA is not clear and it is under ponderous researches by Biologists but, in our case, we will use the presence of Introns in the RNA-Crypto System output as a strong method to add chaotic non coding information and an unnecessary behaviour in the access to the secret key to code the messages. In the RNA-Crypto System algoritnm the introns are sections of the ciphered message with non-coding information as well as in the precursor mRNA.
ABSTRACT The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its... more
ABSTRACT The RNA-Crypto System (shortly RCS) is a symmetric key algorithm to cipher data. The idea for this new algorithm starts from the observation of nature. In particular from the observation of RNA behavior and some of its properties. In particular the RNA sequences have some sections called Introns. Introns, derived from the term "intragenic regions", are non-coding sections of precursor mRNA (pre-mRNA) or other RNAs, that are removed (spliced out of the RNA) before the mature RNA is formed. Once the introns have been spliced out of a pre-mRNA, the resulting mRNA sequence is ready to be translated into a protein. The corresponding parts of a gene are known as introns as well. The nature and the role of Introns in the pre-mRNA is not clear and it is under ponderous researches by Biologists but, in our case, we will use the presence of Introns in the RNA-Crypto System output as a strong method to add chaotic non coding information and an unnecessary behaviour in the access to the secret key to code the messages. In the RNA-Crypto System algorithm the introns are sections of the ciphered message with non-coding information as well as in the precursor mRNA.
Research Interests:
Research Interests:
This work follows the paper of the authors: Strongly asymmetric PKD cryptographic algorithms, which introduces a new family of algorithms for key exchange (the double - parametrization algorithm), and here we discuss possible... more
This work follows the paper of the authors: Strongly asymmetric PKD cryptographic algorithms, which introduces a new family of algorithms for key exchange (the double - parametrization algorithm), and here we discuss possible configuration of a particular case (a model ) of this family. The present paper describes the implementation of a model based on matrices described in the following.. The approach will be discussed in the following. Moreover we will show the problems encountered and solved in the final implementation and the technical issues.
Research Interests:
Our goal is to discuss the main ideas, general construction and abstract scheme of a new class of cryptographic algorithms. Using toy model realizations we will illustrate the above abstract scheme showing how some known PKA algorithms... more
Our goal is to discuss the main ideas, general construction and abstract scheme of a new class of cryptographic algorithms. Using toy model realizations we will illustrate the above abstract scheme showing how some known PKA algorithms and variants of them can be recovered from the above mentioned construction. Finally we discuss the resiliency of the above scheme to attacks (comparative breaking complexity).
Research Interests:
ABSTRACT Demand side management (DSM) actions have still large possibilities in the residential sector. In the paper, a model of the residential customer's demand implemented in a load simulator using a bottom-up approach has been... more
ABSTRACT Demand side management (DSM) actions have still large possibilities in the residential sector. In the paper, a model of the residential customer's demand implemented in a load simulator using a bottom-up approach has been used to evaluate the impact of DSM actions on Italian average households' daily load shape. The results thus obtained demonstrate that the model, since providing in parametrical terms, the anticipation of effects of some demand management actions prior to actual implementation or experimentation, can be usefully adopted by electricity distributors for assessing the technical-economical evaluations that are typically the very preliminary step toward demand management actions implementation.
Standby energy is actually one of the largest electrical end use with the largest potential energy savings in the residential sector. In the paper, a model of the residential customer's demand using a bottom-up approach,... more
Standby energy is actually one of the largest electrical end use with the largest potential energy savings in the residential sector. In the paper, a model of the residential customer's demand using a bottom-up approach, implemented in a load simulator, has been used in order to evaluate the impact of standby end users on Italian average households' daily load shape.
Research Interests:
Research Interests:
ABSTRACT We introduce a new symmetric cryptographic algorithm, based on the biological principle of redundancy presents in pre-mRNA ribbon. This algorithm has very good security and statistical properties. In addition it suggests a non... more
ABSTRACT We introduce a new symmetric cryptographic algorithm, based on the biological principle of redundancy presents in pre-mRNA ribbon. This algorithm has very good security and statistical properties. In addition it suggests a non trivial information theoretical interpretration of the redundancy mechanism in DNA sequences which does not seem to be present in the biological literature: according to this interpretation the introns do not directly code information, but play an essential role in the decoding procedure. Furthermore, using strategic functions, the algorithm is able to confound the standard statistical tests (like Test-U01 or Die-Harder) responding in a nonsignificant way. The final result shows that rely on statistical tests as well as there's never sufficient, sometimes is also not necessary.
Research Interests:
Research Interests:
We introduce a new symmetric cryptographic algorithm, based on the biological principle of redundancy. This algorithm has very good security and statistical properties. In addition, it suggests a nontrivial information-theoretical... more
We introduce a new symmetric cryptographic algorithm, based on the biological principle of redundancy. This algorithm has very good security and statistical properties. In addition, it suggests a nontrivial information-theoretical interpretation of the redundancy mechanism in DNA sequences which does not seem to be present in biological literature: according to this interpretation the introns do not directly code information, but play an essential role in the decoding procedure.
Research Interests:
We construct a family of classical deterministic dynamical systems (triples formed by a state space, an initial distribution, a dynamics) parametrized by pairs of vectors (a,b) in the unit circle in ℝ2. The systems describe pairs of... more
We construct a family of classical deterministic dynamical systems (triples formed by a state space, an initial distribution, a dynamics) parametrized by pairs of vectors (a,b) in the unit circle in ℝ2. The systems describe pairs of particles and the dynamics is strictly local, i.e. the dynamics [Formula: see text] of particle j=1,2 depends only on one of the two unit vectors, but not the other. To each particle one associates a family of ± 1-valued observables [Formula: see text](j = 1,2), also parametrized by vectors a in the unit circle in ℝ2. Moreover we assume that, if observable [Formula: see text] is measured on particle j=1,2, then the dynamics of this particle will be [Formula: see text] (chameleon effect). Using these ingredients we prove that the dynamics and the initial distributions of the given systems can be chosen in such a way that, if the observable [Formula: see text] is measured on particle j=1,2, then the EPR correlations - cos (a1-a2) are reproduced. This theor...