Sweet’s syndrome and erythema nodosum are rarely seen together. Herein, we report a case of concurrent Sweet’s syndrome and erythema nodosum and review previous cases.

This paper describes a proposal of a language called Link which has been designed to formalize and operationalize problem solving strategies. This language is used within a software environment called KSM (Knowledge Structure Manager) which helps developers in formulating and operationalizing structured knowledge models. The paper presents both its syntax and dynamics, and gives examples of wel...

A melody's identity is determined by relations between consecutive tones in terms of pitch and duration, whereas surface features (i.e., pitch level or key, tempo, and timbre) are irrelevant. Although surface features of highly familiar recordings are encoded into memory, little is known about listeners' mental representations of melodies heard once or twice. It is also unknown whether musical ...

The verification of an ECDSA signature requires a doublebase scalar multiplication, an operation of the form k ·G+ l ·Q where G is a generator of a large elliptic curve group of prime order n, Q is an arbitrary element of said group, and k, l are two integers in the range of [1, n− 1]. We introduce in this paper an area-optimized VLSI design of a Prime-Field Arithmetic Unit (PFAU) that can serv...

We prove that Zpn and Zp[t]/(t) are polynomially equivalent if and only if n ≤ 2 or p = 8. For the proof, employing Bernoulli numbers, we provide the polynomials which compute the carry-on part for the addition and multiplication in base p. As a corollary, we characterize finite rings of p elements up to polynomial equivalence.

In this paper we present a new method for fast scalar multiplication on el-liptic curves over GF (p) in FPGA using Edwards and twisted Edwards curves over GF (p 3). The presented solution works for curves with prime group order (for example for all NIST curves over GF (p)). It is possible because of using 2-isogenous twisted Edwards curves over GF (p 3) instead of using short Weierstrass curves...

Let be a real number > 1. Addition and multiplication by a xed positive integer of real numbers represented in base are shown to be computable by an on-line algorithm, and thus are continuous functions. When is a Pisot number, these functions are computable by an on-line nite automaton.

Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over the NIST recommended binary fields. In this paper we present new software algorithms for efficient multiplication over the binary field F2m that use a Gaussian normal basis representation. Two approaches are presented, direct norm...

In paper a rationalized approaches to Discrete Wavelet Transform (DWT) coefficients computing, based on modified algorithm of DWT base operation execution, with less multiplication operations are presented. Those several intuitive ways allow to decrease computational complexity of hardware operational units for DWT basic operation computation and provide convenient conditions for wavelet data t...