69 resultados para algebraic attacks
Resumo:
A formalism based on a chiral quark model (chi QM) approach complemented with a one-gluon-exchange model, to take into account the breakdown of the SU(6)circle times O(3) symmetry, is presented. The configuration mixing of wave functions for nucleon and resonances are derived. With few adjustable parameters, differential cross-section and polarized-beam asymmetry for the gamma p -> eta p process are calculated and successfully compared with the data in the center-of-mass energy range from threshold to 2 GeV. The known resonances S-11(1535), S-11(1650), P-13(1720), D-13(1520), and F-15(1680), as well as two new S-11 and D-15 resonances, are found to be dominant in the reaction mechanism. Moreover, connections among the scattering amplitudes of the chi QM approach and the helicity amplitudes, as well as decay widths of resonances, are established. Possible contributions from the so-called missing resonances are investigated and found to be negligible.
Resumo:
A 3-dimensional non-commutative oscillator with no mass term but with an appropriate momentum-dependent potential admits a conserved Runge-Lenz vector, derived from the dual description in momentum space. The trajectories lie on ellipses. The dynamical symmetry allows for an algebraic determination of the bound-state spectrum and extends to o(4,2). (c) 2010 Elsevier B.V. All rights reserved.
Resumo:
The expressions used for describing the angular distribution of oriented and aligned reagent molecules are derived. The algebraic forms of orientation and alignment parameters of molecules in the excited states are obtained for two-photon excitation. The reagent molecules after absorbing two-photon may produce the higher order orientation and alignment than doing one-photon. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
文中研究由密文的完整性检查而导致的数据保密性问题,提出一个新的安全概念——加密方案在密文验证攻击下的不可区分性(IND-CVA:indistinguishability ofencryption scheme under ciphertext verification attacks)来刻画加密方案在这种情况下的保密安全性。IND-CVA允许敌手访问加密oracle和密文验证oracle。与IND-CPA和IND-CCA相比,IND-CVA比IND-CPA稍微强些,但要比IND-CCA弱得多。IND-CVA能使多数常用的加密方案(如:OTP,CBC,及CTR)得以满足。并且,这个IND-CVA可以恰当地刻画安全信道的保密安全性。将认证方案和加密方案结合起来是保证通信安全的一种常用方法。然而,在IND-CVA模型下,当利用认证方案来加强保密安全性的时候,却有可能反而破坏了原有的保密安全性。IND-CVA揭示了完整性对保密性的影响,准确刻画了安全信道的保密性要求,为协议设计提供了有益的参考。
Resumo:
Modelica建模软件会产生高指标的微分代数方程(DAE),因为现有数值求解器一般不能直接对高指标DAE进行求解,所以Modelica建模软件必须对高指标DAE进行指标约简。为提高Modelica建模软件性能,针对现有指标约简算法,展开了理论分析和实验比较,着重对负权二部图算法进行了详细分析,并给出了负权二部图算法的时间复杂度。理论分析和实验结果表明,负权二部图算法相对Pantelides算法有较好的性能,因此可以考虑在Modelica建模软件中使用负权二部图算法来提高性能。
Resumo:
Compared with other existing methods, the feature point-based image watermarking schemes can resist to global geometric attacks and local geometric attacks, especially cropping and random bending attacks (RBAs), by binding watermark synchronization with salient image characteristics. However, the watermark detection rate remains low in the current feature point-based watermarking schemes. The main reason is that both of feature point extraction and watermark embedding are more or less related to the pixel position, which is seriously distorted by the interpolation error and the shift problem during geometric attacks. In view of these facts, this paper proposes a geometrically robust image watermarking scheme based on local histogram. Our scheme mainly consists of three components: (1) feature points extraction and local circular regions (LCRs) construction are conducted by using Harris-Laplace detector; (2) a mechanism of grapy theoretical clustering-based feature selection is used to choose a set of non-overlapped LCRs, then geometrically invariant LCRs are completely formed through dominant orientation normalization; and (3) the histogram and mean statistically independent of the pixel position are calculated over the selected LCRs and utilized to embed watermarks. Experimental results demonstrate that the proposed scheme can provide sufficient robustness against geometric attacks as well as common image processing operations. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness against rotation, scaling, and translation, but few are resistant to cropping, nonisotropic scaling, random bending attacks (RBAs), and affine transformations. Seo and Yoo present a geometrically invariant image watermarking based on affine covariant regions (ACRs) that provide a certain degree of robustness. To further enhance the robustness, we propose a new image watermarking scheme on the basis of Seo's work, which is insensitive to geometric distortions as well as common image processing operations. Our scheme is mainly composed of three components: 1) feature selection procedure based on graph theoretical clustering algorithm is applied to obtain a set of stable and nonoverlapped ACRs; 2) for each chosen ACR, local normalization, and orientation alignment are performed to generate a geometrically invariant region, which can obviously improve the robustness of the proposed watermarking scheme; and 3) in order to prevent the degradation in image quality caused by the normalization and inverse normalization, indirect inverse normalization is adopted to achieve a good compromise between the imperceptibility and robustness. Experiments are carried out on an image set of 100 images collected from Internet, and the preliminary results demonstrate that the developed method improves the performance over some representative image watermarking approaches in terms of robustness.