- Full text PDF available (0)
Journals and Conferences
A GF(p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent… (More)
We use evolutionary computing to synthesize Boolean functions randomly. By using specific crossover and mutation operator in evolving process and modifying search space and fitness function, we get some high non-linearity functions which have other good cryptography characteristics such as autocorrelation etc. Comparing to other heuristic search techniques,… (More)
As an outstanding asymmetric cryptography, RSA algorithm has a lot of virtues and thus is well applied in the scope of IC card applications. The paper deals with the application of RSA in smart cards and the approach in which the modular exponentiation of huge number is simplified by using the Chinese Remainder Theorem. We have already succeeded in… (More)
By the relationship between the first linear spectra of a function at partial points and the Hamming weights of the sub-functions, and by the Hamming weight of homogenous Boolean function, it is proved that there exist no homogeneous bent functions of degreem inn=2m variables form>3.