A method is provided for modifying an image. The method comprises displaying an image, the image comprising a portion of an object; and determining if an edge of the object is in a location within the portion. The method further comprises detecting movement, in a member direction, of an operating member with respect to the edge. The method still further comprises moving, if the edge is not in the location, the object in an object direction corresponding to the detected movement; and modifying, if the edge is in the location, the image in response to the detected movement, the modified image comprising the edge in the location.

Information processing apparatus, information processing method and program

A decision method for elementary algebra and geometry

A data storage and retrieval device and method is disclosed. The device includes at least one magnetic storage medium configured to store target data and at least one re-configurable logic device comprising an FPGA coupled to the at least one magnetic storage medium and configured to read a continuous stream of target data therefrom, having been configured with a template or as otherwise desired to fit the type of search and data being searched. The re-configurable logic device is configured to receive at least one search inquiry in the form of a data key and to determine a match between the data key and the target data as it is being read from the at least one magnetic storage medium. This device and method can perform a variety of searches on the target data including without limitation exact and approximate match searches, sequence match searches, image match searches and data reduction searches. This device and method may be provided as part of a stand-alone computer system, embodied in a network attached storage device, or can otherwise be provided as part of a computer LAN or WAN. In addition to performing search and data reduction operations, this device may also be used to perform a variety of other processing operations including encryption, decryption, compression, decompression, and combinations thereof.

Intelligent data storage and processing using fpga devices

This paper presents new results that allow one to compute the set of states that can be robustly steered in a finite number of steps, via state feedback control, to a given target set. The assumptions that are made in this paper are that the system is discrete-time, nonlinear and time-invariant and subject to mixed constraints on the state and input. A persistent disturbance, dependent on the current state and input, acts on the system. Existing results are not able to address state- and input-dependent disturbances and the results in this paper are, therefore, a generalization of previously published results. One of the key aims of this paper is to present results such that one can perform the relevant set computations using polyhedral algebra and computational geometry software, provided the system is piecewise affine and the constraints are polygonal. Existing methods are only applicable to piecewise affine systems that either have no control inputs or no disturbances, whereas the results in this paper remove this limitation. Some simple examples are also given that show that, even if all the relevant sets are convex and the system is linear, convexity of the set of controllable states cannot be guaranteed.

/pdf/reachability-analysis-of-discrete-time-systems-with-4mpzsqbtkq.pdf

Reachability analysis of discrete-time systems with disturbances

Block ciphers encrypt blocks of plaintext, messages, into blocks of ciphertext under the action of a secret key, and the process of encryption is reversed by decryption which uses the same user-supplied key. Block ciphers are fundamental to modern cryptography, in fact they are the most widely used cryptographic primitive useful in their own right, and in the construction of other cryptographic mechanisms. In this book the authors provide a technically detailed, yet readable, account of the state of the art of block cipher analysis, design, and deployment. The authors first describe the most prominent block ciphers and give insights into their design. They then consider the role of the cryptanalyst, the adversary, and provide an overview of some of the most important cryptanalytic methods. The book will be of value to graduate and senior undergraduate students of cryptography and to professionals engaged in cryptographic design. An important feature of the presentation is the authors' exhaustive bibliography of the field, each chapter closing with comprehensive supporting notes.

The Block Cipher Companion

We have presented a new Matlab toolbox for robust control synthesis by symbolic computation. It is based on a parameter space approach accomplished by quantifier elimination and also equipped with a machinery for numerical simulation of the properties in a frequency domain. The toolbox is explained with several examples.

A Matlab toolbox for robust control synthesis by symbolic computation

We analyze the security of the SEED block cipher against differential attacks. SEED is a 16-round Feistel cipher developed by the Korea Information Security Agency. The SEED proposers estimated their cipher against differential cryptanalysis in a self-estimation document and found a six-round differential characteristic with probability 2-130. We present an improved method of examining the differential characteristics of SEED and show three six-round differential characteristics with probability 2-124. These characteristics allow us to attack seven-round SEED, which surpasses the proposers estimation. Our differential attack needs 2126 chosen-plaintext pairs and 2126 computations of the F function to deduce the subkey used in the last round of seven-round SEED.

Differential cryptanalysis of a reduced-round SEED

An embodiment relates to a multi-objective optimization design supporting technique to reduces the computational complexity of QE/CAD. When the input logical expression generated by a logical-expression-with-qualifier generation unit is satisfied in regard to the sample point included in a certain piece of cell information for each value of the same design parameter, a first cell processing unit does not evaluate the input logical expression on the cell information including other sample points having a value equal to or smaller than the value of a predetermined design variable (for example, a design variable indicating a yield) corresponding to the sample point above, but selects it as the cell information for an output of a logical expression without a qualifier.

Multi-objective optimization design support apparatus and method

We analyze the security of the SC2000 block cipher against both differential and linear attacks. SC2000 is a six-and-a-half-round block cipher, which has a unique structure that includes both the Feistel and Substitution-Permutation Network (SPN) structures. Taking the structure of SC2000 into account, we investigate one- and two-round iterative differential and linear characteristics. We present two-round iterative differential characteristics with probability 2-58 and two-round iterative linear characteristics with probability 2-56. These characteristics, which we obtained through a search, allowed us to attack four-and-a-half-round SC2000 in the 128-bit user-key case. Our differential attack needs 2103 pairs of chosen plaintexts and 220 memory accesses and our linear attack needs 2115.17 known plaintexts and 242.32 memory accesses, or 2104.32 known plaintexts and 283.32 memory accesses.

/pdf/differential-and-linear-cryptanalysis-of-a-reduced-round-1kvhjezwvo.pdf

Differential and Linear Cryptanalysis of a Reduced-Round SC2000

With many applications in engineering and in scientific fields, quantifier elimination (QE) has been attracting more attention these days. Cylindrical algebraic decomposition (CAD) is used as a basis for a general QE algorithm. We propose an effective symbolic-numeric cylindrical algebraic decomposition (SNCAD) algorithm for solving polynomial optimization problems. The main ideas are a bounded CAD construction approach and utilization of sign information. The bounded CAD constructs CAD only in restricted admissible regions to remove redundant projection factors and avoid lifting cells where truth values are constant over the region. By utilization of sign information we can avoid symbolic computation in the lifting phase. Techniques for implementation are also presented. These techniques help reduce the computing time. We have examined our implementation by solving many example problems. Experimental results show that our implementation significantly improves efficiency compared to our previous work.

Hitoshi Yanami

Papers

A Matlab toolbox for robust control synthesis by symbolic computation

Differential cryptanalysis of a reduced-round SEED

Multi-objective optimization design support apparatus and method

Differential and Linear Cryptanalysis of a Reduced-Round SC2000

An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for optimization problems