Let n be a nonzero integer. A set of m positive integers {a1, a2, . . . , am} is said to have the property D(n) if aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. Such a set is called a Diophantine m-tuple (with the property D(n)), or Pn-set of size m. Diophantus found the quadruple {1, 33, 68, 105} with the property D(256). The first Diophantine quadruple with the property D(1), the set {1...

In this note, we present a 2nd-preimage attack on AURORA512, which is one of the candidates for SHA-3. Our attack can generate 2nd-preimages of any given message, in particular, the attack complexity becomes optimal when the message length is 9 blocks or more. In such a case, the attack complexity is approximately 2 AURORA-512 operations, which is less than the brute force attack on AURORA-512,...

RhoGEFs play an important role in various signaling cascades and are implicated in human conditions like cancer and mental retardation. A database search combined with screening of a human neuronal teratocarcinoma library identified two novel RhoGEFs, ARHGEF3 and ARHGEF4 (HGMW-approved symbols). The widely expressed ARHGEF3 transcript of 3561 nucleotides encodes a polypeptide of 526 amino acids...

A 256 X 256 CMOS photo-gate active pixel image sensor is presented. The image sensor uses four MOS transistors within each pixel to buffer the photo-signal, enhance sensitivity, and suppress noise. The pixel size is 20 im X 20 jm and was implemented in a standard digital 0.9 pm single-polysilicon, double-metal, n-well CMOS process; leading to 25% fill-factor. Row and column decoders and counter...

In this paper, we introduce a new dedicated 256-bit hash function: NESHA-256. The recently contest for hash functions held by NIST, motivates us to design the new hash function which has a parallel structure. Advantages of parallel structures and also using some ideas from the designing procedure of block-cipher-based hash functions strengthen our proposed hash function both in security and in ...

We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field Fq of large characteristic from Õ(log q) to Õ(log q). Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applica...