ECC Algorithm Research Articles

An Improvised ECC Mechanism with Probabilistic Approach

ABSTRACT Elliptic curve cryptography provides a secure means of exchanging keys among communicating hosts using the Diffie-Hellman Key Exchange algorithm. Encryption and decryption of texts and messages have also been attempted. In Ramasamy, Prabakar, Devi, and Suguna (2009),,the authors presented the implementation of ECC by first transforming the message into an affine point on the EC and then applying the knapsack algorithm on ECC encrypted message over the finite field GF(p). The authors in their decryption process used elliptic curve discrete logarithm to get back the plain text. This may form a computationally infeasible problem if the values are large enough in generating the plain text. In Krishna (2011), the author mapped the basin value randomly on the output of ECC to generate the cipher text. In the present work the output of ECC algorithm is iterated by the values which are randomly picked from the basin values to provide a probabilistic approach to the output which makes the algorithm free from the chosen cipher text attack. Thus by having key lengths of even much less than 160 bits, the present algorithm provides sufficient strength against crypto analysis and whose performance can be compared with standard algorithms such as RSA.

음성 데이터 보안을 위한 효율적인 ECC 암호 알고리즘 설계 및 구현

Many people is preferred to mVoIP which offers call telephone-quality and convenient UI as well as free of charge. On the other hand, security of mVoIP is becoming an issue as it using Internet network may have danger about wiretapping. Although traditionally encryption algorithm of symmetric key for security of voice data has been used, ECC algorithm of public key type has been preferring for encryption because it is stronger in part the strength of encryption than others. However, the existing way is restricted by lots of operations in poor mobile environment. Thus this paper proposes the efficiency of resource consumption way by reducing cryptographic operations.

Radiation therapy with unflattened photon beams: Dosimetric accuracy of advanced dose calculation algorithms

PurposeTo compare the dosimetric accuracy of advanced dose calculation algorithms for flattened (FF) and unflattened (FFF) photon beams. Material and methodsWe compared the enhanced collapsed cone (eCC) algorithm implemented in OncentraMasterplan and the XVMC (MC) code in Monaco. Test plans were created for 10MV FF and FFF beams. Single beam tests were delivered to radiochromic films positioned within a solid water phantom and evaluated with 1D γ-index analysis. Conformal plans were verified with ion chambers in an anthropomorphic thorax phantom. IMRT plans were applied to the Delta4 system and evaluated with γ-criteria of 3% and 3mm. Results1D γ-index evaluation revealed significantly lower (p<0.05) average γmean-values of 0.46±0.22 for MC calculated FFF profiles compared to average values of 0.53±0.27 detected for FF beams. Respective values for eCC were 0.42±0.27/0.38±0.26 (FF/FFF). When considering off-axis profiles separately, we found significantly reduced average γmean-values for FFF and both algorithms (MC: 0.55±24 vs. 0.45±0.21, eCC: 0.41±0.24 vs. 0.35±0.22). No significant differences were detected on-axis. Absolute dosimetry in the anthropomorphic phantom revealed superior results for MC based dose calculation, with mean deviations of 0.8±0.8/0.0±1.0% compared to −0.1±1.7/−0.5±0.1.7% (FF/FFF) for the eCC algorithm. IMRT plans showed similar results for both linac modes. ConclusionsThe dose calculation accuracy for unflattened beams was found to be at least as high as for flattened beams. The slightly improved dose calculation accuracy observed for off-axis profiles for single FFF beams did not directly translate into better verification results for composite IMRT plans.

Dosimetrischer Vergleich eines erweiterten Collapsed-Cone-Algorithmus mit einem neuen kommerziell verfügbaren Monte-Carlo-Algorithmus anhand klinisch relevanter Fälle

Comparison of the dosimetric accuracy of the enhanced collapsed cone (eCC) algorithm with the commercially available Monte Carlo (MC) dose calculation for complex treatment techniques. A total of 8 intensity-modulated radiotherapy (IMRT) and 2 stereotactic body radiotherapy (SBRT) lung cases were calculated with eCC and MC algorithms with the treatment planning systems (TPS) Oncentra MasterPlan 3.2 (Nucletron) and Monaco 2.01 (Elekta/CMS). Fluence optimization as well as sequencing of IMRT plans was primarily performed using Monaco. Dose prediction errors were calculated using MC as reference. The dose-volume histrogram (DVH) analysis was complemented with 2D and 3D gamma evaluation. Both algorithms were compared to measurements using the Delta4 system (Scandidos). Recalculated with eCC IMRT plans resulted in lower planned target volume (PTV) coverage, as well as in lower organs-at-risk (OAR) doses up to 8%. Small deviations between MC and eCC in PTV dose (1-2%) were detected for IMRT cases, while larger deviations were observed for SBRT (up to 5%). Conformity indices of both calculations were similar; however, the homogeneity of the eCC calculated plans was slightly better. Delta4 measurements confirmed high dosimetric accuracy of both TPS. Mean dose prediction errors < 3% for PTV suggest that both algorithms enable highly accurate dose calculations under clinical conditions. However, users should be aware of slightly underestimated OAR doses using the eCC algorithm.

Reconfigurable Elliptic Curve Crypto-Hardware Over the Galois Field GF(2163)

Problem statement: In the last decade, many hardware designs of elliptic curves cryptography have been developed, aiming to accelerate the scalar multiplication process, mainly those based on the Field Programmable Gate Arrays (FPGA), the major issue concerned the ability of embedding this strategic and strong algorithm in a very few hardware. That is, finding an optimal solution to the one to many problem: Portability against power consumption, speed against area and maintaining security at its highest level. Our strategy is to hardware execute the ECC algorithm that reposes on the ability of making the scalar multiplication over the GF(2163) in a restricted number of clock cycles, targeting the acceleration of the basic field operations, mainly the multiplication and the inverse process, under the constraint of hardware optimization. Approach: The research was based on using the efficient Montgomery add and double algorithm, the Karatsuba-Offman multiplier and the Itoh-Tsjuii algorithm for the inverse component. The hardware implementation was based upon an optimized Finite State Machine (FSM), with a single cycle 163 bits multiplier and a script generated field squarer. The main characteristics of the design concerned the elimination of the different internal component to component delays, the minimization of the global clocking resources and a strategic separation of the data path from the control part. Results: The working frequency of our design attained the 561 MHz, allowing 161786 scalar multiplications per second, outperforming one of the best state of the art implementations (555 MHz); the other contribution concerns the acceleration of the field inverse scheme with a frequency of 777.341 MHz. Conclusion: The results indicated that using different optimizations at the hardware level improve efficiently the acceleration of the ECC scalar multiplication and the choice of the target circuit gratefully enhances propagation delays and increases frequency.