The Experts below are selected from a list of 220752 Experts worldwide ranked by ideXlab platform
Marc Pirlot - One of the best experts on this subject based on the ideXlab platform.
-
Following the traces. An introduction to conjoint measurement without transitivity and additivity (sept. 2002, révisé avril 2003)
European Journal of Operational Research, 2005Co-Authors: Denis Bouyssou, Marc PirlotAbstract:This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to defining three general families of models depending on the kind of trace that they use. Contrary to most conjoint measurement models, these models do not involve an Addition Operation. This allows for a simple axiomatic analysis at the cost of very weak uniqueness results.
-
Following the traces: An introduction to conjoint measurement without transitivity and additivity
European Journal of Operational Research, 2005Co-Authors: Denis Bouyssou, Marc PirlotAbstract:This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to defining three general families of models depending on the kind of trace that they use. Contrary to most conjoint measurement models, these models do not involve an Addition Operation. This allows for a simple axiomatic analysis at the cost of very weak uniqueness results.
-
An introduction to conjoint measurement without transitivity and additivity
2003Co-Authors: Denis Bouyssou, Marc PirlotAbstract:This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to deflning three general families of models depending on the kind of trace that they use. Contrary to most conjoint measurement models, these models do not involve an Addition Operation. This allows for a simple axiomatic analysis at the cost of very weak uniqueness results.
Hu Yupu - One of the best experts on this subject based on the ideXlab platform.
-
Improvement Schemes for Scalar Multiplication Algorithm in Elliptic Curve Cryptography
Computer Engineering, 2006Co-Authors: Hu YupuAbstract:This paper presents a new fast scalar multiplication algorithm on elliptic curve cryptography.This algorithm greatly reduces times of Addition Operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.By theoretic analysis and experiment,signed sliding window coding method is better than NAF algorithm and unsigned sliding window coding method,and it is also able to improve the efficiency of scalar multiplication algorithm compared with accustomed algorithm.And the optimal sliding window width is given.
Denis Bouyssou - One of the best experts on this subject based on the ideXlab platform.
-
Following the traces. An introduction to conjoint measurement without transitivity and additivity (sept. 2002, révisé avril 2003)
European Journal of Operational Research, 2005Co-Authors: Denis Bouyssou, Marc PirlotAbstract:This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to defining three general families of models depending on the kind of trace that they use. Contrary to most conjoint measurement models, these models do not involve an Addition Operation. This allows for a simple axiomatic analysis at the cost of very weak uniqueness results.
-
Following the traces: An introduction to conjoint measurement without transitivity and additivity
European Journal of Operational Research, 2005Co-Authors: Denis Bouyssou, Marc PirlotAbstract:This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to defining three general families of models depending on the kind of trace that they use. Contrary to most conjoint measurement models, these models do not involve an Addition Operation. This allows for a simple axiomatic analysis at the cost of very weak uniqueness results.
-
An introduction to conjoint measurement without transitivity and additivity
2003Co-Authors: Denis Bouyssou, Marc PirlotAbstract:This paper presents a self-contained introduction to a general conjoint measurement framework for the analysis of nontransitive and/or incomplete binary relations on product sets. It is based on the use of several kinds of marginal traces on coordinates induced by the binary relation. This framework leads to deflning three general families of models depending on the kind of trace that they use. Contrary to most conjoint measurement models, these models do not involve an Addition Operation. This allows for a simple axiomatic analysis at the cost of very weak uniqueness results.
Aliyu Danladi Hina - One of the best experts on this subject based on the ideXlab platform.
-
The Effect of Field Extension on the Group Structure of Elliptic Curves
IOSR Journal of Mathematics, 2013Co-Authors: Aliyu Danladi HinaAbstract:An elliptic curve E defined over a finite field K, E(K) is the set of solutions to the general Weierstrass polynomial E: y 2 + a1xy + a3y = x 3 + a2x 2 + a4x + a6 where the coefficients a1, a2, a3, a4, a6 є K. There exist a well defined Addition of points on each curve such that the points form an abelian group under the Addition Operation. This group is either cyclic or isomorphic to the product of two cyclic groups. These set of solutions that form the group lie in the closure of the field K over which the curve is defined. If we allow the set to lie only in a particular extension of K, the Addition Operation is well defined there too. Therefore we can associate a group to every extension K' of the field K denoted by E(K'). Will the structure of the group defined over the base field K, be affected if the same group is made to lie in the extension K' of K?
Azmi Jaafar - One of the best experts on this subject based on the ideXlab platform.
-
Hardware architectures & designs for projective elliptic curves point Addition Operation using variable levels of parallelism
2011Co-Authors: Mohammad Alkhatib, Qasem Abu Al-haija, Azmi JaafarAbstract:Although ECC protocol is considered one of the most secure schemes for information security; it also suffers in its arithmetic computations from the modular inversion Operation which is known to be time consuming Operation. In the Addition Operation, Many ECC designs that use projective coordinates over GF (p) have not considered a balance between area, hardware utilization, and performance factors which is important in many ECC applications. In this research we proposed to use the projective coordinates systems to compute the ECC point Addition Operation with no inversion Operations due to the ability to convert each inversion to several multiplication Operations that can be applied in parallel. We also present several architectures and design choices for point Addition Operation that will help to build ECC Coprocessor. These architectures consider different levels of parallelism which may give different choices in ECC design in terms of time and space. This paper proposes the different hardware architectures to design ECC Processor by varying the degree of parallelization benefiting from the inherent parallelism for ECC Addition Operation. It was shown that the throughput of the design with 4 parallel multipliers enhanced the system performance by 400% and 340% for both projections (X/Z, Y/Z), and (X/Z2, Y/Z3) respectively while the design with 5 parallel multipliers is considered the best fit for projection (X/Z, Y/Z2) due its ability to best utilize and parallelize the hardware arithmetic Operations. However, the projection (X/Z, Y/Z) when applied using 4 parallel multipliers gave the best results in terms of hardware utilization, parallelization enhancements and cost factor which make it the first choice when you design the ECC Coprocessor using projective coordinates. A trade-off between security, area and performance is which control the ECC Coprocessor design, the more parallelization you make the more area needed the less time required which will lead to a better performance.
-
hardware architectures designs for projective elliptic curves point Addition Operation using variable levels of parallelism
2011Co-Authors: Mohammad Alkhatib, Qasem Abu Alhaija, Azmi JaafarAbstract:Although ECC protocol is considered one of the most secure schemes for information security; it also suffers in its arithmetic computations from the modular inversion Operation which is known to be time consuming Operation. In the Addition Operation, Many ECC designs that use projective coordinates over GF (p) have not considered a balance between area, hardware utilization, and performance factors which is important in many ECC applications. In this research we proposed to use the projective coordinates systems to compute the ECC point Addition Operation with no inversion Operations due to the ability to convert each inversion to several multiplication Operations that can be applied in parallel. We also present several architectures and design choices for point Addition Operation that will help to build ECC Coprocessor. These architectures consider different levels of parallelism which may give different choices in ECC design in terms of time and space. This paper proposes the different hardware architectures to design ECC Processor by varying the degree of parallelization benefiting from the inherent parallelism for ECC Addition Operation. It was shown that the throughput of the design with 4 parallel multipliers enhanced the system performance by 400% and 340% for both projections (X/Z, Y/Z), and (X/Z2, Y/Z3) respectively while the design with 5 parallel multipliers is considered the best fit for projection (X/Z, Y/Z2) due its ability to best utilize and parallelize the hardware arithmetic Operations. However, the projection (X/Z, Y/Z) when applied using 4 parallel multipliers gave the best results in terms of hardware utilization, parallelization enhancements and cost factor which make it the first choice when you design the ECC Coprocessor using projective coordinates. A trade-off between security, area and performance is which control the ECC Coprocessor design, the more parallelization you make the more area needed the less time required which will lead to a better performance.