A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2

International audienceSince the first use of a p-adic method for counting points of elliptic curves, by Satoh in 1999, several variants of his algorithm have been proposed. In the current state, the AGM algorithm, proposed by Mestre is thought to be the fastest in practice, and the algorithm by Satoh­-Skjernaa­-Taguchi has the best asymptotic complexity but requires precomputations. We present an amelioration of the SST algorithm, borrowing ideas from the AGM. We make a precise comparison between this modified SST algorithm and the AGM, thus demonstrating that the former is faster by a significant factor, even for small cryptographic sizes

Модифікований метод обчислення порядку еліптичних кривих

Наведений модифікований алгоритм обчислення порядку еліптичної кривої, визначеної над двійковим полем. Порівнюються теоретичні та експериментальні показники обчислювальної складності даного метода та його базової версії. Робляться висновки щодо можливості його використання для модифікації національних стандартів.There was presented modified algorithm for counting order of elliptic curves defined over a binary field. We compared theoretical and experimental performance of computational complexity of this method and its basic version. And we also make conclusions of the possibility of using for modifying national standards

Модифікований метод обчислення порядку еліптичних кривих

There was presented modified algorithm for counting order of elliptic curves defined over a binary field. We compared theoretical and experimental performance of computational complexity of this method and its basic version. And we also make conclusions of the possibility of using for modifying national standards.Наведений модифікований алгоритм обчислення порядку еліптичної кривої, визначеної над двійковим полем. Порівнюються теоретичні та експериментальні показники обчислювальної складності даного метода та його базової версії. Робляться висновки щодо можливості його використання для модифікації національних стандарті

Elliptic curve cryptography: Generation and validation of domain parameters in binary Galois Fields

Elliptic curve cryptography (ECC) is an increasingly popular method for securing many forms of data and communication via public key encryption. The algorithm utilizes key parameters, referred to as the domain parameters. These parameters must adhere to specific characteristics in order to be valid for use in the algorithm. The American National Standards Institute (ANSI), in ANSI X9.62, provides the process for generating and validating these parameters. The National Institute of Standards and Technology (NIST) has identified fifteen sets of parameters; five for prime fields, five for binary fields, and five for Koblitz curves. The parameter generation and validation processes have several key issues. The first is the fast reduction within the proper modulus. The modulus chosen is an irreducible polynomial having degree greater than 160. Choosing irreducible polynomials of a particular order is less critical since they have isomorphic properties, mathematically. However, since there are differences in performance, there are standards that determine the specific polynomials chosen. The NIST standards are also based on word lengths of 32 bits. Processor architecture, primality, and validation of irreducibility are other important characteristics. The area of ECC that is researched is the generation and validation processes, as they are specified for binary Galois Fields F (2m). The rationale for the parameters, as computed for 32 bit and 64 bit computer architectures, and the algorithms used for implementation, as specified by ANSI, NIST and others, are examined. The methods for fast reduction are also examined as a baseline for understanding these parameters. Another aspect of the research is to determine a set of parameters beyond the 571-bit length that meet the necessary criteria as determined by the standards

A p-adic quasi-quadratic point counting algorithm

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$ and space complexity $O(n^2)$, where $n=\log(q)$. In the latter complexity estimate the genus and the characteristic are assumed as fixed. Our algorithm forms a generalization of both, the AGM algorithm of J.-F. Mestre and the canonical lifting method of T. Satoh. We canonically lift a certain arithmetic invariant of the Jacobian of the hyperelliptic curve in terms of theta constants. The theta null values are computed with respect to a semi-canonical theta structure of level $2^\nu p$ where $\nu >0$ is an integer and p=\mathrm{char}(\F_q)>2. The results of this paper suggest a global positive answer to the question whether there exists a quasi-quadratic time algorithm for the computation of the number of rational points on a generic ordinary abelian variety defined over a finite field.Comment: 32 page

Higher dimensional 3-adic CM construction

We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves over small degree number fields whose Jacobian has complex multiplication and good ordinary reduction at the prime 3. We prove the existence of a quasi-quadratic time algorithm for computing a canonical lift in characteristic 3 based on these equations, with a detailed description of our method in genus 1 and 2.Comment: 23 pages; major revie

Automatic generation of high speed elliptic curve cryptography code

Apparently, trust is a rare commodity when power, money or life itself are at stake. History is full of examples. Julius Caesar did not trust his generals, so that: ``If he had anything confidential to say, he wrote it in cipher, that is, by so changing the order of the letters of the alphabet, that not a word could be made out. If anyone wishes to decipher these, and get at their meaning, he must substitute the fourth letter of the alphabet, namely D, for A, and so with the others.'' And so the history of cryptography began moving its first steps. Nowadays, encryption has decayed from being an emperor's prerogative and became a daily life operation. Cryptography is pervasive, ubiquitous and, the best of all, completely transparent to the unaware user. Each time we buy something on the Internet we use it. Each time we search something on Google we use it. Everything without (almost) realizing that it silently protects our privacy and our secrets. Encryption is a very interesting instrument in the "toolbox of security" because it has very few side effects, at least on the user side. A particularly important one is the intrinsic slow down that its use imposes in the communications. High speed cryptography is very important for the Internet, where busy servers proliferate. Being faster is a double advantage: more throughput and less server overhead. In this context, however, the public key algorithms starts with a big handicap. They have very bad performances if compared to their symmetric counterparts. Due to this reason their use is often reduced to the essential operations, most notably key exchanges and digital signatures. The high speed public key cryptography challenge is a very practical topic with serious repercussions in our technocentric world. Using weak algorithms with a reduced key length to increase the performances of a system can lead to catastrophic results. In 1985, Miller and Koblitz independently proposed to use the group of rational points of an elliptic curve over a finite field to create an asymmetric algorithm. Elliptic Curve Cryptography (ECC) is based on a problem known as the ECDLP (Elliptic Curve Discrete Logarithm Problem) and offers several advantages with respect to other more traditional encryption systems such as RSA and DSA. The main benefit is that it requires smaller keys to provide the same security level since breaking the ECDLP is much harder. In addition, a good ECC implementation can be very efficient both in time and memory consumption, thus being a good candidate for performing high speed public key cryptography. Moreover, some elliptic curve based techniques are known to be extremely resilient to quantum computing attacks, such as the SIDH (Supersingular Isogeny Diffie-Hellman). Traditional elliptic curve cryptography implementations are optimized by hand taking into account the mathematical properties of the underlying algebraic structures, the target machine architecture and the compiler facilities. This process is time consuming, requires a high degree of expertise and, ultimately, error prone. This dissertation' ultimate goal is to automatize the whole optimization process of cryptographic code, with a special focus on ECC. The framework presented in this thesis is able to produce high speed cryptographic code by automatically choosing the best algorithms and applying a number of code-improving techniques inspired by the compiler theory. Its central component is a flexible and powerful compiler able to translate an algorithm written in a high level language and produce a highly optimized C code for a particular algebraic structure and hardware platform. The system is generic enough to accommodate a wide array of number theory related algorithms, however this document focuses only on optimizing primitives based on elliptic curves defined over binary fields

Aeronautical Engineering: A special bibliography with indexes, supplement 46, July 1974

This special bibliography lists 374 reports, articles, and other documents introduced into the NASA scientific and technical information system in June 1974

Space Communications: Theory and Applications. Volume 3: Information Processing and Advanced Techniques. A Bibliography, 1958 - 1963

Annotated bibliography on information processing and advanced communication techniques - theory and applications of space communication

Computational Fluid Dynamics 2020

This book presents a collection of works published in a recent Special Issue (SI) entitled “Computational Fluid Dynamics”. These works address the development and validation of existent numerical solvers for fluid flow problems and their related applications. They present complex nonlinear, non-Newtonian fluid flow problems that are (in some cases) coupled with heat transfer, phase change, nanofluidic, and magnetohydrodynamics (MHD) phenomena. The applications are wide and range from aerodynamic drag and pressure waves to geometrical blade modification on aerodynamics characteristics of high-pressure gas turbines, hydromagnetic flow arising in porous regions, optimal design of isothermal sloshing vessels to evaluation of (hybrid) nanofluid properties, their control using MHD, and their effect on different modes of heat transfer. Recent advances in numerical, theoretical, and experimental methodologies, as well as new physics, new methodological developments, and their limitations are presented within the current book. Among others, in the presented works, special attention is paid to validating and improving the accuracy of the presented methodologies. This book brings together a collection of inter/multidisciplinary works on many engineering applications in a coherent manner