New Complexity Estimation on the Rainbow-Band-Separation Attack

Multivariate public key cryptography is a candidate for post-quantum cryptography, and it allows generating particularly short signatures and fast verification. The Rainbow signature scheme proposed by J. Ding and D. Schmidt is such a multivariate cryptosystem and is considered secure against all known attacks. The Rainbow-Band-Separation attack recovers a secret key of Rainbow by solving certain systems of quadratic equations, and its complexity is estimated by the well-known indicator called the degree of regularity. However, the degree of regularity generally is larger than the solving degree in experiments, and an accurate estimation cannot be obtained. In this paper, we propose a new indicator for the complexity of the Rainbow-Band-Separation attack using the $F_4$ algorithm, which gives a more precise estimation compared to one using the degree of regularity. This indicator is deduced by the two-variable power series $$\frac{\prod _{i=1}^m(1-t_1^{d_{i1}}t_2^{d_{i2}})}{(1-t_1)^{n_1}(1-t_2)^{n_2}},$$ which coincides with the one-variable power series at $t_1=t_2$ deriving the degree of regularity. Moreover, we show a relation between the Rainbow-Band-Separation attack using the hybrid approach and the HighRank attack. By considering this relation and our indicator, we obtain a new complexity estimation for the Rainbow-Band-Separation attack. Consequently, we are able to understand the precise security of Rainbow against the Rainbow-Band-Separation attack using the $F_4$ algorithm

Analytical study to define a helicopter stability derivative extraction method, volume 1

A method is developed for extracting six degree-of-freedom stability and control derivatives from helicopter flight data. Different combinations of filtering and derivative estimate are investigated and used with a Bayesian approach for derivative identification. The combination of filtering and estimate found to yield the most accurate time response match to flight test data is determined and applied to CH-53A and CH-54B flight data. The method found to be most accurate consists of (1) filtering flight test data with a digital filter, followed by an extended Kalman filter (2) identifying a derivative estimate with a least square estimator, and (3) obtaining derivatives with the Bayesian derivative extraction method

A combined Eulerian-volume of fraction-Lagrangian method for atomization simulation

The tracking of free surfaces between liquid and gas phases and analysis of the interfacial phenomena between the two during the atomization and breakup process of a liquid fuel jet is modeled. Numerical modeling of liquid-jet atomization requires the resolution of different conservation equations. Detailed formulation and validation are presented for the confined dam broken problem, the water surface problem, the single droplet problem, a jet breakup problem, and the liquid column instability problem

An assessment of space shuttle flight software development processes

In early 1991, the National Aeronautics and Space Administration's (NASA's) Office of Space Flight commissioned the Aeronautics and Space Engineering Board (ASEB) of the National Research Council (NRC) to investigate the adequacy of the current process by which NASA develops and verifies changes and updates to the Space Shuttle flight software. The Committee for Review of Oversight Mechanisms for Space Shuttle Flight Software Processes was convened in Jan. 1992 to accomplish the following tasks: (1) review the entire flight software development process from the initial requirements definition phase to final implementation, including object code build and final machine loading; (2) review and critique NASA's independent verification and validation process and mechanisms, including NASA's established software development and testing standards; (3) determine the acceptability and adequacy of the complete flight software development process, including the embedded validation and verification processes through comparison with (1) generally accepted industry practices, and (2) generally accepted Department of Defense and/or other government practices (comparing NASA's program with organizations and projects having similar volumes of software development, software maturity, complexity, criticality, lines of code, and national standards); (4) consider whether independent verification and validation should continue. An overview of the study, independent verification and validation of critical software, and the Space Shuttle flight software development process are addressed. Findings and recommendations are presented

Optimization methods and silicon solar cell numerical models

An optimization algorithm for use with numerical silicon solar cell models was developed. By coupling an optimization algorithm with a solar cell model, it is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junction depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm was developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAP1D). SCAP1D uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the performance of a solar cell. A major obstacle is that the numerical methods used in SCAP1D require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the values associated with the maximum efficiency. This problem was alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution

Implicitization of rational maps

Motivated by the interest in computing explicit formulas for resultants and discriminants initiated by B\'ezout, Cayley and Sylvester in the eighteenth and nineteenth centuries, and emphasized in the latest years due to the increase of computing power, we focus on the implicitization of hypersurfaces in several contexts. Our approach is based on the use of linear syzygies by means of approximation complexes, following [Bus\'e Jouanolou 03], where they develop the theory for a rational map $f:P^{n-1}\dashrightarrow P^n$. Approximation complexes were first introduced by Herzog, Simis and Vasconcelos in [Herzog Simis Vasconcelos 82] almost 30 years ago. The main obstruction for this approximation complex-based method comes from the bad behavior of the base locus of $f$. Thus, it is natural to try different compatifications of $A^{n-1}$, that are better suited to the map $f$, in order to avoid unwanted base points. With this purpose, in this thesis we study toric compactifications $T$ for $A^{n-1}$. We provide resolutions $Z.$ for $Sym_I(A)$, such that $\det((Z.)_\nu)$ gives a multiple of the implicit equation, for a graded strand $\nu\gg 0$. Precisely, we give specific bounds $\nu$ on all these settings which depend on the regularity of \SIA. Starting from the homogeneous structure of the Cox ring of a toric variety, graded by the divisor class group of $T$, we give a general definition of Castelnuovo-Mumford regularity for a polynomial ring $R$ over a commutative ring $k$, graded by a finitely generated abelian group $G$, in terms of the support of some local cohomology modules. As in the standard case, for a $G$-graded $R$-module $M$ and an homogeneous ideal $B$ of $R$, we relate the support of $H_B^i(M)$ with the support of $Tor_j^R(M,k)$.Comment: PhD. Thesis of the author, from Universit\'e de Paris VI and Univesidad de Buenos Aires. Advisors: Marc Chardin and Alicia Dickenstein. Defended the 29th september 2010. 163 pages 15 figure

Effect of Features Generated from Adjacent and Overlapped Segments in Protein Sequence Classification

13301甲第4828号博士（工学）金沢大学博士論文本文Ful