跟我写代码实现Word文档自加密

对于办公一族而言，一些重要的Word文档时常需要加密处理。当然，你可以使用软件自带的“文档加密”功能，但每次新建文档都需要重新设置密码，十分麻烦，因此下面将带给大家一种书写“宏”代码让Word自动加密的方法（此方法适用于最新的Word 2003）。

基于椭圆曲线的KDM安全公钥加密方案

某些场合下敌手能够获取与私钥有关消息的密文,大多现有加密方案在上述情况下是不安全的。为抵抗这种攻击,给出一般子群不可区分困难假设的一个实例——椭圆曲线子群不可区分困难假设,并设计相应的归约算法。在此基础上,提出一个基于环Z N2上椭圆曲线的公钥加密方案,并将该方案中的密文不可区分问题归约到椭圆曲线子群不可区分困难的假设上。分析结果证明,该方案在此假设下是安全的。

Properties of Self-recoverable Mechanoluminescence Phosphor Ca_(5)Ga_(6)O_(14)∶Eu^(3+) and Its Information Encryption Application

A novel self-recoverable mechanoluminescent phosphor Ca_(5)Ga_(6)O_(14)∶Eu^(3+) was developed by the high-tem-perature solid-state reaction method,and its luminescence properties were investigated.Ca_(5)Ga_(6)O_(14)∶Eu^(3+)can produce red mechanoluminescence,and importantly,it shows good repeatability.The mechanoluminescence of Ca_(5)Ga_(6)O_(14)∶Eu^(3+) results from the piezoelectric field generated inside the material under stress,rather than the charge carriers stored in the traps,which can be confirmed by the multiple cycles of mechanoluminescence tests and heat treatment tests.The mechanoluminescence color can be turned from red to green by co-doping varied concentrations of Tb^(3+),which may be meaningful for encrypted letter writing.The encryption scheme for secure communication was devised by harnessing mechanoluminescence patterns in diverse shapes and ASCII codes,which shows good encryption performance.The results suggest that the mechanoluminescence phosphor Ca_(5)Ga_(6)O_(14)∶Eu^(3+),Tb^(3+)may be applied to the optical information encryption.

MESH FREE ADAPTIVE ALGORITHM FOR SOLVING EULER EQUATIONS ON STRUCTURED GRID POINTS

A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.

Adaptive and Dynamic Mobile Phone Data Encryption Method

To enhance the security of user data in the clouds,we present an adaptive and dynamic data encryption method to encrypt user data in the mobile phone before it is uploaded.Firstly,the adopted data encryption algorithm is not static and uniform.For each encryption,this algorithm is adaptively and dynamically selected from the algorithm set in the mobile phone encryption system.From the mobile phone's character,the detail encryption algorithm selection strategy is confirmed based on the user's mobile phone hardware information,personalization information and a pseudo-random number.Secondly,the data is rearranged with a randomly selected start position in the data before being encrypted.The start position's randomness makes the mobile phone data encryption safer.Thirdly,the rearranged data is encrypted by the selected algorithm and generated key.Finally,the analysis shows this method possesses the higher security because the more dynamics and randomness are adaptively added into the encryption process.

Adaptively Secure Attribute-Based Encryption Supporting Attribute Revocation

Attribute revocation is inevitable and al- so important for Attribute-Based Encryption （ABE） in practice. However, little attention has been paid to this issue, and it retrains one of the rmin obsta-cles for the application of ABE. Most of existing ABE schemes support attribute revocation work under indirect revocation model such that all the users＇ private keys will be affected when the revo-cation events occur. Though some ABE schemes have realized revocation under direct revocation model such that the revocation list is embedded in the ciphertext and none of the users＇ private keys will be affected by revocation, they mostly focused on the user revocation that revokes the user＇s whole attributes, or they can only be proven to be selectively secure. In this paper, we first define a model of adaptively secure ABE supporting the at- tribute revocation under direct revocation model. Then we propose a Key-Policy ABE （KP-ABE） scheme and a Ciphertext-Policy ABE （CP-ABE） scheme on composite order bilinear groups. Finally, we prove our schemes to be adaptively secure by employing the methodology of dual system eno cryption.

A Self-synchronizing Stream Encryption Scheme Based on One-Dimensional Coupled Map Lattices

We present a self-synchronizing stream encryption scheme based on one-dimensional coupled map lattices which is introduced as a model with the essential features of spatiotemporal chaos, and of great complexity and diffusion capability of the little disturbance in the initial condition. To evaluate the scheme, a series of statistical tests are employed, and the results show good random-look nature of the ciphertext. Furthermore, we apply our algorithm to encrypt a grey-scale image to show the key sensitivity.

Formal Verification in 3oux Tripartite Diffie-Hellman Protocol

Security analysis of cryptographic protocols has been widely studied for many years.As far as we know,we have not found any methods to effectively analyze group key exchange protocols for the three parties yet,which did not sacrifice the soundness of cryptography.Recently,Canetti and Herzog have proposed Universally Composable Symbolic Analysis(UCSA) of two-party mutual authentication and key exchange protocol which is based on the symmetric encryption schemes.This scheme can analyze the protocols automatically and guarantee the soundness of cryptography.Therefore,we discuss group key exchange protocol which is based on Joux Tripartite Diffie-Hellman(JTDH) using UCSA.Our contribution is analyzing group key exchange protocol effectively without damaging the soundness of cryptography.

NEW CONCEPT FOR DETERMINING THE ORDERS OF SAC AND PC

The autocorrelation of a Boolean function possesses the capability to reflect such characteristics as linear structure, Strict Avalanche Criterion(SAC) and Propagation Criterion(PC)of degree k. But it can do nothing in determining the order of SAC or PC. A calculating table for the autocorrelation is constructed in this paper so as to show what is beyond the autocorrelation and how the three cryptographic characteristics are exhibited. A deeper study on the calculating table in a similar way has helped us to develop a new concept, named as the general autocorrelation, to address efficiently the problem how to determine the orders of SAC and PC. The application on the Advanced Encryption Standard(AES) shows the SAC and PC characteristics of Boolean functions of AES S-box.

Adaptive image encryption scheme based on chaotic map

Most of the existing image encryption schemes with the substitutlon-chltuslon structure are not secure and efficient. In this letter, a chaos-based pseudo-random bit generator with good statistical properties is proposed, where a simple post-processing by compressing is employed. A new adaptive image encryption scheme with the substitution-diffusion architecture is designed using the new pseu- do-random bit generator. In the scheme, the session key for the pseudo-random bit generator is dependent on the content of the image which ensures that the scheme can effectively resist knownplaintext and chosen-plaintext attacks. Theoretical analysis and computer simulation indicate that the proposed algorithm is efficient and highly secure.

Augmented Kierlik-Rosinberg Fundamental Measure Functional and Extension of Fundamental Measure Functional to Inhomogeneous Non-hard Sphere Fluids

From point of view of weighted density procedure, it is guessed that a Percus-Yevick （PY） compressibility excess free energy density, appearing in the Kierlik Rosinberg type fundamental measure functional （KR-FMF） and expressed in terms of scaled particle variables, can be substituted by a corresponding expression dictated by a more accurate Mansoori Carnahan-Starling Leland （MCSL） equation of state, while retaining the original weighting functions; it is numerically indicated that the resultant undesirable non-self-consistency between the PY type weighting function and MCSL type excess free energy density had no bad effect on the performance of the resultant augmented KR-ffMF which, on the one hand, preserves the exact low-density limit of the original KR-FMF and holds a high degree of pressure self-consistency, on the other hand, improves significantly, as expected, the predictions of density profile of hard sphere fluid at single hard wall contact location and its vicinity, and of the bulk hard sphere second order direct correlation function （DCF）, obtained from functional differentiation. The FMF is made applicable to inhomogeneous non-hard sphere fluids by supplementing a functional perturbation expansion approximation truncated at the lowest order with summation of higher order terms beyond the lowest term calculated by the FMF for an effective hard sphere fluid; the resultant extended FMF only needs second order DCF and pressure of the fluid considered at coexistence state as inputs, consequently is applicable whether the considered temperature is above critical point or below critical point. The extended MCSL-augmented KR-FMF is found to be endowed with an excellent performance for predictions of density profile and surface tension by comparing the present predictions of these two quantities with available computer simulation data for inhomogeneous hard core attractive Yukawa fluid and Lennard-3ones fluid.