Solving Inverse Kinematics – A New Approach to the Extended Jacobian Technique

This paper presents a brief summary of current numerical algorithms for solving the Inverse Kinematics problem. Then a new approach based on the Extended Jacobian technique is compared with the current Jacobian Inversion method. The presented method is intended for use in the field of computer graphics for animation of articulated structures.

FPU-Supported Running Error Analysis

A-posteriori forward rounding error analyses tend to give sharper error estimates than a-priori ones, as they use actual data quantities. One of such a-posteriori analysis – running error analysis – uses expressions consisting of two parts; one generates the error and the other propagates input errors to the output. This paper suggests replacing the error generating term with an FPU-extracted rounding error estimate, which produces a sharper error bound

Cost-Effective Architectures for RC5 Brute Force Cracking

In this paper, we discuss the options for brute-force cracking of the RC5 block cipher, that is, for revealing the unknown secret key, given a sample ciphertext and a portion of the corresponding plaintext. First, we summarize the methods employed by the current cracking efforts. Then, we present two hardware architectures for finding the secret key using the “brute force” method. We implement the hardware in FPGA and ASIC and, based on the results, we discuss the cost and time needed to crack the cipher using today’s technology and suggest a minimum key length that can be considered secure.

Solving Inverse Kinematics – A New Approach to the Extended Jacobian Technique

This paper presents a brief summary of current numerical algorithms for solving the Inverse Kinematics problem. Then a new approach based on the Extended Jacobian technique is compared with the current Jacobian Inversion method. The presented method is intended for use in the field of computer graphics for animation of articulated structures.

A Theoretic-framework for Quantum Steganography

Quantum information processing has proved to be a fruitful tool in several advanced cryptographic tasks. For example quantum key distribution establishes a string of random bits shared by two spatially separated parties in an information-theoretically secure manner. Classical solutions for this problem offer only computational security. Beyond quantum key distribution there are other promising directions of research such as quantum secret sharing, quantum data hiding, authentication of quantum messages and quantum steganography, to name a few of them. It is important to note that while in classical theory the terms 'data hiding ' and 'steganography ' are interchangeable, in quantum theory they have different meaning. Quantum data hiding is rather closer to secret sharing. Our research during the last year focused on quantum steganography. By this term we refer to methods of hidden communication within framework of quantum mechanics. Similar to classical steganography, hidden communication is done via embedding a message into a redundant part of a cover medium. Embedding methods differ significantly in the medium access level. The main levels are 1) quantum noise, 2) error correcting codes and 3) data formats, protocols, etc. Quantum nois