NASA Scientific and Technical Aerospace Reports

was only able to identify DMMP down to 10 ppm. This research demonstrates it is feasible to use ATR-FTIR to detect vapor
phase chemicals when combined with SPME film concentration techniques.
DTIC
Fourier Transformation; Infrared Detectors; Infrared Spectra; Reflectance; Solid Phases; Vapors
20060002029 Texas Univ., Austin, TX, USA
Superconvergence in the Generalized Finite Element Method
Babuska, Ivo; Banerjee, Uday; Osborn, John E.; Jan. 1, 2005; 41 pp.; In English
Contract(s)/Grant(s): N00014-99-1-0724; NSF DMS-03-41982
Report No.(s): AD-A440610; No Copyright; Avail.: Defense Technical Information Center (DTIC)
In this paper, we address the problem of the existence of superconvergence points of approximate solutions, obtained from
the Generalized Finite Element Method (GFEM), of a Neumann elliptic boundary value problem. GFEM is a Galerkin method
that uses non-polynomial shape functions. In particular, we show that the superconvergence points for the gradient of the
approximate are zeros of certain systems of non-linear equations that do not depend on the solution of the boundary value
problem. For approximate solutions with second derivatives, we have also characterized the superconvergence points of the
second derivatives of the approximate solution as the roots of certain systems of non-linear equations. We note that it is easy
to construct smooth generalized finite element approximation.
DTIC
Convergence; Finite Element Method; Problem Solving
20060002079 National Inst. of Information and Communications Technology, Tokyo, Japan
Subgroup Membership Problem and Its Applications to Information Security
Yamamura, Akihiro; Saito, Taiichi; Journal of the National Institute of Information and Communications Technology. Special
Issue on Information Security, Volume 52, Nos. 1/2; March/June 2005, pp. 89-99; In English; See also 20060002073;
Copyright; Avail.: Other Sources
The widely used algorithmic problems, the quadratic residue problem and the decision Differ-Hellman problem, are
characterized as the subgroup membership problem. Several cryptographic schemes are realized assuming the hardness of the
subgroup membership problem. We apply the subgroup membership problem to several information security schemes: a
probabilistic encryption, a bit commitment and a private information retrieval.
Author
Algorithms; Information Retrieval; Security
20060002081 National Inst. of Information and Communications Technology, Tokyo, Japan
An Expansion Algorithm for Higher Order Differential Cryptanalysis of Secret Key Ciphers
Tanaka, Hidema; Kaneko, Toshinobu; Journal of the National Institute of Information and Communications Technology.
Special Issue on Information Security, Volume 52, Nos. 1/2; March/June 2005, pp. 119-128; In English; See also
20060002073; Copyright; Avail.: Other Sources
We show an expansion algorithm for a higher order differential cryptanalysis which is one of chosen plaintext attack
against symmetric block ciphers. Ordinary algorithm of higher order differential cryptanalysis derives an attack equation for
sub-keys in the last round. Our algorithm derives an attack equation for sub-keys in previous round using brute force search
to the subkeys in last round. As the result, comparing with original algorithm, our algorithm can attack one more round.
Though a five round modified MISTY1 which is a 64 bit block cipher can be attacked is well known, when our algorithm is
used, a six round modified MISTY1 can be broken.
Author
Algorithms; Cryptography; Differential Equations; Algebra
20060002082 National Inst. of Information and Communications Technology, Tokyo, Japan
On Multi Rounds Elimination Method for Higher Order Differential Cryptanalysis
Tanaka, Hidema; Tonomura, Yuji; Kaneko, Toshinobu; Journal of the National Institute of Information and Communications
Technology. Special Issue on Information Security, Volume 52, Nos. 1/2; March/June 2005, pp. 135-140; In English; See also
20060002073; Copyright; Avail.: Other Sources
A multi rounds elimination method for higher order differential cryptanalysis is consisted of two rounds elimination attack
and probabilistic higher order differential cryptanalysis. A probabilistic higher order differential cryptanalysis is a method
168