Applying elliptic curve cryptography to a chaotic synchronisation system: neural-network-based approach

Elliptic curves cryptography was introduced independently by Victor Miller (Miller, 1986) and Neal Koblitz (Koblitz, 1987(Koblitz, ) in 1985. .At that time elliptic curve cryptography was not actually seen as a promising cryptographic technique.As time progress and further research and intensive development done especially on the implementation side, elliptic curve cryptography is now being implemented widely.Elliptic curves cryptography offers smaller key size, bandwidth savings and faster in implementations when compared to the RSA (Rivest-Shamir-Adleman) cryptography which based its security on the integer factorization problem.The most interesting feature of the elliptic curves is the group structure of the points generated by the curves, where points on the elliptic curves form a group.The security of elliptic curves cryptography relies on the elliptic curves discrete logarithm problem.The elliptic curve discrete logarithm problem is analogous to the ordinary algebraic discrete logarithm problem, l = g x , where given the l and g, it is infeasible to compute the x.Elliptic curve discrete logarithm problem deals with solving for n the relation P = nG.Given the point P and the point G, then it is very hard to find the integer n.To implement the discrete logarithm problem in elliptic curve cryptography, the main task is to compute the order of group of the curves or in other words the number of points on the curve.Computation to find the number of points on a curve, has given rise to several point counting algorithms.The Schoof and the SEA (Schoof-Elkies-Atkin) point counting algorithms will be part of the discussion in this chapter.This chapter is organized as follows: Section 2, gives some preliminaries on elliptic curves, and in section 3, elliptic curve discrete logarithm problem is discussed.Some relevant issues on elliptic curve cryptography is discussed in section 4, in which the Diffie-Hellman key exchange scheme, ElGamal elliptic curve cryptosystem and elliptic curve digital signature scheme are discussed here accompanied with some examples.Section 5 discussed the two point counting algorithms, Schoof algorithm and the SEA (Schoof-Elkies-Atkin) algorithm.Following the discussion in section 5, section 6 summaries some similarities and the differences between these two algorithms.Section 7 gives some brief literature on these two point counting algorithms.Finally, section 8 is the concluding remarks for this chapter. Elliptic curvesElliptic curves obtained their name from their relation to elliptic integrals that arise from the computation of the arc length of ellipses (Lawrence & Wade, 2006).Elliptic curves are www.intechopen.com Cryptography and Security in Computing1 1 2 3 4 2 2 4 Fig. 1.1. 2(1 ) (1 ) yx x x   www.intechopen.com

There have been many digital signature schemes were developed based on the discrete logarithm problem on a finite field. In this study, we use the elliptic curve discrete logarithm problem to build new collective signature schemes. The cryptosystem on elliptic curve allows to generate digital signatures with the same level of security as other cryptosystems but with smaller keys. To extend practical applicability and enhance the security level of the group signature protocols, we propose two new types of collective digital signature schemes based on the discrete logarithm problem on the elliptic curve: i) the collective digital signature scheme shared by several signing groups and ii) the collective digital signature scheme shared by several signing groups and several individual signers. These two new types of collective signatures have combined the advantages of group digital signatures and collective digital signatures. These signatures have a fixed size and do not depend on the number of members participating in the creation of the final collective signature. One of the advantages of the proposed collective signature protocols is that they can be deployed on top of the available public key infrastructures.

A promising direction for constructing cryptographically stable pseudo-random sequence generators is an application of transformations in a group of points of elliptic and hypereliptic curves. This will allow building evidence-stable crypto algorithms, the problem of finding the private key in which is associated with solving a theoretically complex elliptic curve discrete logarithm problem. This paper proposes a method for generating pseudo-random sequences of the maximal period using transformations on elliptic curves. This method consists in the application of recurrent transformations with sequential formation of elements of points group of elliptic curves. This allows providing the maximum period of pseudo-random sequences with the reduction of the problem of finding the private key to the solution of the theoretically complex elliptic curve discrete logarithm problem. The block diagram of the device for generating pseudo-random sequences and the scheme for generating the internal states of the generator are given. We also present the results of statistical testing of some generators, which show that the generated sequences are indistinguishable in a statistical sense from truly random ones.KeywordsPseudo-random sequencesElliptic curvesMaximum period

In 2013 the Editor of Journal of Vibration and Control and SAGE became aware of a peer review ring involving assumed and fabricated identities that appeared to centre around Peter Chen at National Pingtung University of Education, Taiwan (NPUE). SAGE and the Editor then began a complex investigation into the case during the rest of 2013 and 2014. Following an unsatisfactory response from Peter Chen, NPUE was notified. NPUE were serious in addressing the Journal and SAGE’s concerns. NPUE confirmed that the institution was investigating Peter Chen. SAGE subsequently uncovered a citation ring involving the above mentioned author and others. We regret that individual authors have compromised the academic record by perverting the peer review process and apologise to readers. On uncovering problems with peer review and citation SAGE immediately put steps in place to avoid similar vulnerability of the Journal to exploitation in the future. More information may be found at www.sagepub.co.uk/JVC_Statement_2014 . The Journal and SAGE understand from NPUE that Peter Chen has resigned his post at NPUE. The following articles are retracted because after thorough investigation evidence points towards them having at least one author or being reviewed by at least one reviewer who has been implicated in the peer review ring and/or citation ring. All authors have had an opportunity to respond to the allegations and proposed actions. OnlineFirst articles (these articles will not be published in an issue) Chen CY, Chen T-H, Chen Y-H, Yu S-E and Chung P-Y (2013) Information technology system modeling an integrated C-TAM-TPB model to the validation of ocean tidal analyses Journal of Vibration and Control Epub ahead of print 7 May 2013. doi: 10.1177/1077546312472924 Chang R-F, Chen CY, Su F-P and Lin H-C (2013) A two-step approach for broadband digital signal processing technique Journal of Vibration and Control Epub ahead of print 26 April 2013. doi: 10.1177/1077546312472925 Chen TH, Chang CJ, Yu SE, Chung PY and Liu C-K (2013) Nonlinear information analysis and system management technique: the influence of design experience and control complexity Journal of Vibration and Control Epub ahead of print 12 April 2013. doi: 10.1177/1077546312473321 Chen CY, Shih BY, Chen YH, Yu SE and Liu YC (2013) The exploration of a 3T flow model using vibrating NXT: II. Model validation Journal of Vibration and Control Epub ahead of print 10 April 2013. doi: 10.1177/1077546312470481 Chen CY, Shih BY, Chen YH, Yu SE and Liu YC (2013) The exploration of 3T flow model using vibrating NXT: I. model formulation Journal of Vibration and Control Epub ahead of print 6 February 2013. doi: 10.1177/1077546312467360 Lin M-L and Chen C-W (2013) Stability analysis of fuzzy-based NN modeling for ecosystems using fuzzy Lyapunov methods Journal of Vibration and Control Epub ahead of print 6 February 2013. doi: 10.1177/1077546312466687 Chen CY, Chen TH, Chen YH and Chiu J (2012) A multi-stage method for deterministic-statistical analysis: a mathematical case and measurement studies Journal of Vibration and Control Epub ahead of print 20 December 2012. doi: 10.1177/1077546312466579 Shih BY, Lin MC and Chen CY (2012) Autonomous navigation system for radiofrequency identification mobile robot e-book reader Journal of Vibration and Control Epub ahead of print 13 December 2012. doi: 10.1177/1077546312466578 Chang RF, Chen CY, Su FP, Lin HC and Lu C-K (2012) Multiphase SUMO robot based on an agile modeling-driven process for a small mobile robot Journal of Vibration and Control Epub ahead of print 13 December 2012. doi: 10.1177/1077546312464993 Shih B-Y, Lin Y-K, Cheng M-H, Chen C-Y and Chiu C-P (2012) The development of an application program interactive game-based information system Journal of Vibration and Control Epub ahead of print 12 December 2012. doi: 10.1177/1077546312464682 Chen C-Y, Chang C-J and Lin C-H (2012) On dynamic access control in web 2.0 and cloud interactive information hub: technologies Journal of Vibration and Control Epub ahead of print 12 December 2012. doi: 10.1177/1077546312464992 Shin BY, Chen CY and Hsu KH (2012) Robot cross platform system using innovative interactive theory and selection algorithms for Android application Journal of Vibration and Control Epub ahead of print 13 November 2012. doi: 10.1177/1077546312463757 Articles published in an issue Chen C-W (2014) Applications of neural-network-based fuzzy logic control to a nonlinear time-delay chaotic system Journal of Vibration and Control 20 (4): 589-605. Epub ahead of print 5 November 2012. doi: 10.1177/1077546312461370 Chen C-W (2014) A review of intelligent algorithm approaches and neural-fuzzy stability criteria for time-delay tension leg platform systems Journal of Vibration and Control 20 (4): 561-575. Epub ahead of print 5 November 2012. doi: 10.1177/1077546312463759 Chen C-Y, Chang C-J and Lin C-H (2014) On dynamic access control in web 2.0 and cloud interactive information hub: trends and theories Journal of Vibration and Control 20 (4): 548-560. Epub ahead of print 5 November 2012. doi: 10.1177/1077546312463762 Lin M-L and Chen C-W (2014) Stability conditions for ecosystem modeling using the fuzzy Lyapunov method Journal of Vibration and Control 20 (2): 290-302. Epub ahead of print 23 October 2012. doi: 10.1177/1077546312451301 Chen C-H, Kuo C-M, Hsieh S-H and Chen C-Y (2014) Highly efficient very-large-scale integration (VLSI) implementation of probabilistic neural network image interpolator Journal of Vibration and Control 20 (2): 218-224. Epub ahead of print 22 October 2012. doi: 10.1177/1077546312458822 Chen C-Y (2014) Wave vibration and simulation in dissipative media described by irregular boundary surfaces: a mathematical formulation Journal of Vibration and Control 20 (2): 191-203. Epub ahead of print 22 October 2012. doi: 10.1177/1077546312464258 Chen C-H, Yao T-K, Dai J-H and Chen C-Y (2014) A pipelined multiprocessor system- on-a-chip (SoC) design methodology for streaming signal processing Journal of Vibration and Control 20 (2): 163-178. Epub ahead of print 16 October 2012. doi: 10.1177/1077546312458821 Lin M-L and Chen C-W (2014) Fuzzy neural modeling for n-degree ecosystems using the linear matrix inequality approach Journal of Vibration and Control 20 (1): 82-93. Epub ahead of print 8 October 2012. doi: 10.1177/1077546312458533 Chen C-H, Wu W-X and Chen C-Y (2013) Ant-inspired collective problem-solving systems Journal of Vibration and Control 19 (16): 2481-2490. Epub ahead of print 18 September 2012. doi: 10.1177/1077546312456231 Chen C-H, Yao T-K, Kuo C-M and Chen C-Y (2013) Evolutionary design of constructive multilayer feedforward neural network Journal of Vibration and Control 19 (16): 2413-2420. Epub ahead of print 12 September 2012. doi: 10.1177/1077546312456726 Chen C-W (2013) Applications of the fuzzy-neural Lyapunov criterion to multiple time-delay systems Journal of Vibration and Control 19 (13): 2054-2067. Epub ahead of print 16 August 2012. doi: 10.1177/1077546312451034 Chung P-Y, Chen Y-H, Walter L and Chen C-Y (2013) Influence and dynamics of a mobile robot control on mechanical components Journal of Vibration and Control 19 (13): 1923-1935. Epub ahead of print 20 July 2012. doi: 10.1177/1077546312452184 Chen C-W (2013) Neural network-based fuzzy logic parallel distributed compensation controller for structural system Journal of Vibration and Control 19 (11): 1709-1727. Epub ahead of print 22 June 2012. doi: 10.1177/1077546312442233 Chen C-W, Yeh K, Yang H-C, Liu KFR and Liu C-C (2013) A critical review of structural system control by the large-scaled neural network linear-deferential-inclusion-based criterion Journal of Vibration and Control 19 (11): 1658-1673. Epub ahead of print 18 June 2012. doi: 10.1177/1077546312443377 Chen C-H, Kuo C-M, Chen C-Y and Dai J-H (2013) The design and synthesis using hierarchical robotic discrete-event modeling Journal of Vibration and Control 19 (11): 1603-1613. Epub ahead of print 27 June 2012. doi: 10.1177/1077546312449645 Chang CJ, Chen CY and Chou I-T (2013) The design of information and communication technologies: telecom MOD strength machines Journal of Vibration and Control 19 (10): 1499-1513. Epub ahead of print 27 June 2012. doi: 10.1177/1077546312449644 Shih B-Y, Chen C-Y, Li K-H, Wu T-Y, Chen G-Y (2013) A novel NXT control method for implementing force sensing and recycling in a training robot Journal of Vibration and Control 19 (10): 1443-1459. Epub ahead of print 1 June 2012. doi: 10.1177/1077546312446361 Chen C-W, Chen P-C and Chiang W-L (2013) Modified intelligent genetic algorithm-based adaptive neural network control for uncertain structural systems Journal of Vibration and Control 19 (9): 1333-1347. Epub ahead of print 31 May 2012. doi: 10.1177/1077546312442232 Chen C-Y, Shih B-Y, Shih C-H and Wang L-H (2013) Enhancing robust and stability control of a humanoid biped robot: system identification approach. Journal of Vibration and Control 19 (8): 1199-1207. Epub ahead of print 26 April 2012. doi: 10.1177/1077546312442947 Chang C-J, Chen C-Y and Huang C-W (2013) Applications for medical recovery using wireless control of a bluetooth ball with a hybrid G-sensor and human-computer interface technology Journal of Vi

This paper examines the cryptographic security of fixed versus random elliptic curves over the field GF(p). Its basic assumption is that a large precomputation to aid in breaking the elliptic curve discrete logarithm problem (ECDLP) can be made for a fixed curve. We take this into account when examining curve security as well as considering a variation of Pollard's rho method where computations from solutions of previous ECDLPs can be used to solve subsequent ECDLPs on the same curve. We present a lower bound on the expected time to solve such ECDLPs using this method, as well as an approximation of the expected time remaining to solve an ECDLP when a given size of precomputation is available. We conclude that adding 5 bits to the size of a fixed curve to avoid general software attacks and an extra 6 bits to avoid attacks on special moduli and a parameters provides an equivalent level of security.

Retraction notice

Many bridges in Taiwan have been in use from the period that Taiwan was governed by the Japanese, over 50 years ago, which is the average ultimate usable lifetime of such structures. Three-quarters of the bridges on major highways have been in use for more than 20 years and numerous bridges on country roads have also been in use for more than 20 years. In other words, most of the bridges in Taiwan are aging and may require repair or replacement. Ambient vibration tests are utilized to measure the response of old bridges, which are difficult to equip with accelerometers. The Fourier transform method is traditionally used to gain important information about ambient vibration records. However, the development of information technology over the last 20 years has meant that there are more kinds of signal management technologies, including the wavelet and Hilbert—Huang transform (HHT) methods. In this study we investigate the characteristics of aging bridges by comparison with their structural properties. We analyze their ambient vibration, and discuss the possible influence of the frequency function. Long-term environmental impacts create many structural problems, but with traditional methods examination of bridge health is difficult. Therefore, in our HHT management system, we examine destroyed bridges. The characteristics and behavior of bridges subjected to random loading can be understood by analysis with the random decrement technique and the frequency response function method.

Retraction notice

This paper presents an approach to solving the elliptic curve discrete logarithm problem on alternative curve models over prime fields using a quantum annealing and index calculus method. Part of the algorithm, relation searching, is transformed into the Quadratic Unconstrained Boolean Optimization (QUBO) problem and then is efficiently solved using the D-Wave computer by quantum annealing. As Faugère et al. showed, twisted Edwards curves, because of their symmetric shape, allow us to obtain solutions of relations searching step using Groebner basis faster than in the case of Weierstrass curves. Because of symmetries, a system of equations of relations searching step for twisted Edwards curves has many symmetric solutions. Using the Groebner basis and having many system solutions makes it easier to find any of them. The same is true using quantum annealing - it is easier to find any solution to the QUBO problem if many are correct. In this paper, we used this observation to find out that a properly constructed QUBO problem for the relations searching step for twisted Edwards curves allows us to find a solution faster for the same size of the base field than in the case of Weierstrass curves. Using the presented approach, we solved the discrete logarithm problem using quantum annealing and index calculus method for elliptic curve discrete logarithm problem defined on twisted Edwards curve over a field 𝔽1021 with order equal to 4 · 241. It is now the biggest field and size of the group, where the elliptic curve discrete logarithm problem was solved using quantum methods.

Elliptic curve cryptography is a public key cryptosystem based on the elliptic curve discrete logarithm problem. The reason for the attractiveness of ECC is that there is no sub-exponential algorithm known to solve the elliptic curve discrete logarithm problem. This leads to lower memory requirements, lower computation requirements and higher security than other public key cryptosystems. This project describes an implementation of a micro coded elliptic curve processor using FPGA technology. This processor implements optimal normal basis field operations. The design is generated by a parameterized module generator which can accommodate arbitrary n and also produce field multipliers with different speed/area tradeoffs. The control part of the processor is micro coded, enabling curve operations to be incorporated into the processor hence reducing the chip's I/O requirements. The micro coded approach also facilitates rapid development and algorithmic optimization. for example, projective and affine coordinates were supported using different sets of micro codes. The design was successfully tested on a Xilinx Spartan -II kit device. Elliptic curve processor is particularly suitable for recourse limited devices because of its lower requirements of memory and computation. It is applicable to be implanted into smart cards, cellular phones and other hand-held devices so that secure communication can be provided. For based on implement the FPGA Using Verilog HDL.

Anonymous channel tickets have been proposed as a way to provide user anonymity and to reduce the overhead of re-authentication for authentication in wireless environments. Chen et al. proposed a secure and efficient protocol, based on a protocol proposed by Yang et al., which is resistant to guessing attacks on networks from which users’ secret keys are easy to obtain. However, their scheme is time-consuming in the phases of ticket issuing and authentication. Furthermore, a malicious attacker can utilize the expired time, Texp, to launch a denial of authentication (DoA) attack, which is a type of denial of service attack. Because Texp is exposed to any user, it would be easy to launch a DoA attack that could make the scheme impractical. To resist against DoAs that the scheme of Chen et al. might suffer, we propose an improved scheme based on elliptic curve cryptography in this paper. Our scheme not only reduces time cost but also enhances security. The basis of the proposed scheme is the elliptic curve discrete logarithm problem. The operations of points of an elliptic curve are faster and use fewer bits to achieve the same level of security. Therefore, our scheme is more suitable for mobile devices, which have limited computing power and storage. Copyright © 2012 John Wiley & Sons, Ltd.

With the rapid development of the Internet, many users start to take action putting personal or company information on it, and share with everyone. The Internet is public as it were, if we do not control its limit of authority to assure security, it's possible that those attackers do illegal access of important information and destroy them. Not only personal privacy is invaded, but the mass property damage. Therefore, effective access control system has been more and more emphasized these days. To fight against these network attacks, it is necessary to establish an effective and safe access control system; here we proposed a scheme, a key management which called Lagrange interpolation mainly takes access control model as framework, and use Elliptic Curve Cryptography system to enhance security. The fact we choose Lagrange interpolation is the key we use is randomized, no relationship between each key, so is relatively hard. As Elliptic Curve Cryptography system, we want attackers to encounter Elliptic Curve Discrete Logarithm Problem. Once the prime number is big enough, attackers will have trouble deciphering the key. Access control is so comprehensive, such as electronic documents, online television system sand wireless networks and so on, from previous literature; mobile agent technology applied in access control and key management would waste space and do exist some flaws in security, also we still have a lot of works to do on medical application. Hence, we propose these schemes in mobile agent in order to reach improvement, and then analyze of security and try to simulate what attackers will do. We conclude four common attacks: External Collective Attack, Internal Attack, Collusion Attacks and Equation Breaking Attack. As results, attackers are hard to decipher the key because of no relationship between each key and will face Elliptic Curve Discrete Logarithm Problem. We confirm that the proposed schemes can be more efficiently and safety to protect mobile agent.

Elliptic curve cryptography (ECC) has shorter key length than other asymmetric cryptography algorithms such as RSA with the same security level. Existing faults in cryptographic computations can cause faulty results. If a fault occurs during encryption, false information will be sent to the destination, in which case channel error detection codes are unable to detect the fault. In this paper, we consider the error detection in elliptic curve scalar multiplication point, which is the most important operation in ECC. Our technique is based on non-linear error detection codes. We consider an algorithm for scalar multiplication point proposed by Microsoft research group. The proposed technique in our methods has less overhead for additions (36.36%) and multiplications (34.84%) in total, compared to previous works. Also, the proposed method can detect almost 100% of injected faults.

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

Elliptic Curve Cryptography (ECC) is a promising public key cryptography, probably takes the place of RSA. Not only ECC uses less memory, key pair generation and signing are considerably faster, but also ECC's key size is less than that of RSA while it achieves the same level of security. However, the magic behind RSA and its friends can be easily explained, is also widely understood, the foundations of ECC are still a mystery to most of us. This paper's aims are to provide detailed mathematical foundations of ECC, especially, the subgroup and its generator (also called base point) formed by one elliptic curve are researched as highlights, because they are very important for practical ECC implementation. The related algorithms and their implementation details are demonstrated, which is useful for the computing devices with restricted resource, such as embedded systems, mobile devices and IoT devices.