text:
|Publication number
|Publication type
|Application number
|Publication date
|Mar 2, 2006
|Filing date
|Oct 18, 2005
|Priority date
|Jun 3, 1998
|Also published as
|Publication number
|Paul Kocher, Joshua Jaffe, Benjamin Jun
|Original Assignee
|Kocher Paul C, Jaffe Joshua M, Jun Benjamin C
|Export Citation
|BiBTeX, EndNote, RefMan
|Referenced by (28), Classifications (17), Legal Events (2)
|External Links: USPTO, USPTO Assignment, Espacenet
This patent application is a continuation of U.S. patent application Ser. No. 09/930,836, filed Aug. 15, 2001, which patent application is hereby incorporated by reference in its entirety and is a continuation of and claims the priority benefit of U.S. patent application Ser. No. 09/324,798, filed Jun. 3, 1999 (now U.S. Pat. No. 6,278,783), which in turn claims the benefit of U.S. provisional patent application No. 60/087,826, filed Jun. 3, 1998. U.S. patent application Ser. No. 09/324,798 is related to co-pending U.S. patent application Ser. No. 09/224,682, filed Dec. 31, 1998.
The method and apparatus of the invention relate generally to securing cryptographic systems against external attacks and, more specifically, to preventing attacks that involve the external monitoring of cryptographic operations.
Cryptographic operations are used for a variety of processes such as data encryption and authentication. In a typical symmetric cryptographic process, a secret key is known to two or more participants, who use it to secure their communications. In systems using asymmetric (or public key) cryptography, one party typically performs operations using a secret key (e.g., the so-called private key), while the other performs complementary operations using only non-secret parameters (e.g., the so-called public key). In both symmetric and asymmetric cryptosystems, secret parameters must be kept confidential, since an attacker who compromises a key can decrypt communications, forge signatures, perform unauthorized transactions, impersonate users, or cause other problems.
Methods for managing keys securely using physically secure, well-shielded rooms are known in the background art and are widely used today. However, previously-known methods for protecting keys in low-cost cryptographic devices are often inadequate for many applications, such as those requiring a high degree of tamper resistance. Attacks such as reverse-engineering of ROM using microscopes, timing attack cryptanalysis (see, for example, P. Kocher, "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems," Advances in Cryptology—CRYPTO '96, Springer-Verlag, pages 104-113), and error analysis (see, for example, E. Biham and A. Shamir, "Differential Fault Analysis of Secret Key Cryptosystems," Advances in Cryptology—CRYPTO '97, Springer-Verlag, 1997, pages 513-525) have been described for analyzing cryptosystems.
Ciphers and algorithms believed to be cryptographically secure are known in the background art. For example, protocols using triple DES (a cipher constructed using three applications of the Data Encryption Standard using different keys) can resist all feasible cryptanalytic attacks, provided that attackers only have access to the standard inputs to and outputs from the protocol. However, even a product using an extremely strong cipher such as triple DES can be insecure if the keys are not managed securely.
This document assumes a detailed understanding of the Data Encryption Standard (DES), which is defined in Federal Information Processing Standards Publication 46 and need not be described in detail here. Information on DES and other cryptographic algorithms can also be found in Applied Cryptography by Bruce Schneier (Wiley and Sons, Inc., 1996), in the Handbook of Applied Cryptography by Menezes et al. (CRC Press, Inc., 1997), or in other standard references as will be appreciated by those skilled in the art.
This invention describes processes in which secrets (e.g., keys and/or messages) are divided into separate portions, which are then separately mutated, while maintaining mathematical relationships between or among the portions that are used for performing secure cryptographic operations. In the update ("mutation") operation, key management devices introduce randomness or other unpredictability into their internal state. By changing the secret portions, information collected by attackers about them can be made obsolete. If information is invalidated faster than it can be collected by attackers, a system can be made secure.
The invention provides for improved implementations of the Data Encryption Standard (DES), as well as other cryptographic operations, that resist external monitoring attacks. Unlike traditional DES implementations, which perform a set of processing operations that depend only on the input key and the message, the invention involves additional random (or otherwise unpredictable) state information in the cryptographic processing. The random state information is mixed with the keys, plaintext messages, and intermediate quantities used during processing. Information leaked to attackers during cryptographic processing is correlated to the random information, and any correlation to secret information is partially or completely hidden. As a result, it is difficult or impossible for attackers to determine secret parameters through analysis of leaked information.
A detailed description of how the invention may be applied to the Data Encryption Standard is provided. State parameters that are normally encoded as ordinary binary values are blinded and their order masked using randomized permutation tables. While a traditional DES implementation would encode the input message M as a 64-bit value, an exemplary embodiment of the invention blinds M to produce a two-part value (M1, M2) such that M1 XOR M2 corresponds to the "normal" message. Additionally, the parameters M1 and M2 are encoded in random order, where permutations M1P and M2P are stored in memory to keep track of the current order of the bits in M1 and M2. Keys may be similarly stored in blinded, order-randomized form. M1P and M2P contain bit ordering information and do not represent message content. The message blinding technique of the invention ensures that neither M1 by itself nor M2 by itself is correlated to the message in any way. Consequently, the implementation can remain secure even if the complete value of any parameter is leaked to an attacker.
The standard DES algorithm involves three primary types of operations: permutations, S lookups, and bitwise XORs. In the exemplary embodiment, permutations of the message (M1, M2, M1P, M2P) are performed by manipulating M1P and M2P. Only the permutation arrays are manipulated; the parameter data bits in M1 and M2 do not need to be accessed or modified. Permutations (such as IP, PC1, E, P, and FP, which are defined as part of the standard DES algorithm definition) can thus be made safe against leakage. For XOR operations, halves of the input parameters are processed separately. For example, using the message notation above, the operation of computing the XOR of two values A and B encoded as (A1, A2, A1P, A2P) and (B1, B2, B1P, B2P) is computed by first finding the XOR of (A1, A1P) and (B1, B1P), then finding the XOR of (A2, A2P) and (B2, B2P). Note that because of the blinding, A1 and B1 by themselves are not correlated to the complete value of A or B. Order randomization is used to prevent attackers from obtaining information about A and B from correlations within and between observations of the two XOR operations. Finally, for the S table lookup operations, the S tables themselves are stored in the device's memory in blinded form, such that the S table inputs and outputs are blinded with random values. To perform an S operation, the inputs (e.g., A1, A2, A1P, A2P), the S table input blinding factor, and the S input table permutation are combined and used to index the S table itself. (The S tables are blinded and randomly permuted, and are re-shuffled periodically.) The S results are obtained in halves, which are separately processed through the P permutation and XORed onto the destination. Sixteen rounds are performed, ultimately yielding the final ciphertext. The ciphertext is produced in permuted, blinded form, which may be easily converted to the standard DES ciphertext.
Although the invention has been described in the context of permuting both keys and messages, each into two sub-parts, those skilled in the art will appreciate that either or both (as well as other secret quantities) could be permuted, into a plurality of parts greater than two. In addition, although the invention has been described with respect to DES, the invention can be applied to and adapted to other cryptographic symmetric algorithms, including without limitation Blowfish, SEAL, IDEA, SHA, RC5, TEA, and other cryptographic algorithms involving operations suitable for application of the techniques of this invention. In all such cases, including DES, the term "plaintext" as used herein shall be understood to refer to the quantity that is in plaintext form relative to whatever cryptographic protocol is being used (e.g., DES). Thus, a "plaintext" quantity could actually be encrypted using some other algorithm and still be within the meaning of plaintext relative to the cryptographic protocol under consideration.
Reduction of Signal-to-Noise Ratios
To obtain a secret key from a cryptographic system (cryptosystem) that leaks information, an attacker can gather data by observing a series of operations, perform statistical analysis on the observations, and use the results to determine the key.
In a common situation, an attacker monitors a physical property, such as power consumption, of a secure token as it performs a cryptographic operation. The attacker collects a small amount of data related to the key each time the token is observed performing a cryptographic operation involving the key. The attacker increases the amount of information known about the key by collecting and statistically correlating (or combining) data from multiple observations of the token as it performs operations involving the key (or related key).
In the case of a cryptosystem which is leaking information, such observations may contain signal (i.e., information correlated usefully to the key). However, such observations also contain noise (i.e., information and error that hinder or are irrelevant to determination of the key). The quality of the information gained from these observations is characterized by a "signal to noise" (or S/N) ratio, which is a measure of the magnitude of the signal compared to the amount of noise.
The number of operations that the attacker must analyze to recover the key depends on the measurement and analysis techniques, but is generally inversely proportional to the square of the S/N ratio. The constant of proportionality also depends upon the amount of confidence the attacker requires. For example, a relatively low confidence level may be acceptable to an attacker willing to do an optimized brute force search using statistical information about key bit values. Decreasing the signal by a factor of 15 and increasing the amount of measurement noise by a factor of 20 will reduce the signal-to-noise ratio by a factor of 300. This will generally mean that an attacker will require roughly 90,000 times as many observations to extract the same amount of information about the key. An attack requiring 1,000 observations to recover a key before the S/N reduction would now require on the order of 90 million observations to gain the same level of confidence in the recovered key.
A principal objective of the invention is to make cryptosystems that are difficult to attack successfully, for example by increasing the number of observations required by an attacker to compromise a key. By reducing the available signal size and/or increasing the amount of error, noise, and uncertainty in attackers' measurements, a system designer can make the so-called work function (effort required) to break a system larger. Ideally, the number of samples required to gain any significant amount of useful key information should exceed the maximum number of transactions that can be performed using the key, exceed the number of transactions that can be performed by the device (e.g., before the key expires), or else be so large that monitoring attacks are of comparable or greater difficulty than brute force and other known attacks. For example, consider a system programmed to self-destruct after one million operations (well beyond the expected operational life of most smartcards). If attackers are limited to measurements with a signal-to-noise ratio (across an entire transaction) well below 1/1000, the attacker would be unable to collect enough measurements to compromise the device.
For physically large systems, effective physical shielding, physical isolation, and careful filtering of inputs and outputs are known in the background art (e.g., U.S. government Tempest specifications). Such shielding techniques can protect cryptographic devices from external monitoring attacks that involve analyzing power consumption, electromagnetic radiation (both in air and coupled to the device's inputs and outputs), electrical activity within the device, etc. as well as protecting against physical attacks. Unfortunately, these techniques are difficult to apply in constrained engineering environments. For example, physical constraints (such as size and weight), cost requirements, and the need to conserve power can often prevent the use of previously-known shielding techniques.
Leak-Minimizing DES: Introduction
The Data Encryption Standard (DES) is widely used as a cryptographic primitive for data encryption, pseudorandom number generation, MACs, and other cryptographic operations. The basic DES encryption algorithm uses a 56-bit key to transform a 64-bit plaintext block into a 64-bit ciphertext block. The corresponding decryption operation uses the same key to transform ciphertext blocks into their corresponding plaintexts. This discussion will assume the reader has a detailed understanding of the well-known DES algorithm, which need not be discussed in detail here. For more information about DES (and other cryptographic algorithms), see Applied Cryptography by Bruce Schneier or the Handbook of Applied Cryptography by Menezes et al.
The DES implementation of the invention incorporates one or more novel features (as will be described below in an exemplary embodiment of the invention) to provide resistance to external monitoring attacks. The invention may be used to address various sources of information leakage such as, without limitation:
Note that multiple observations are often required to determine keys or otherwise break the system. (It is not always necessary to find the key to break a system. For example, determining a message's plaintext can be as useful as finding the key, and the attacks may be used to do this.) As mentioned previously, statistical analysis may be used to extract useful signals from measurements. For example, a computer can digitally filter a signal to average out noise, identify frequency components of interest, etc. Analog filtering techniques may also be used (such as using a high-pass and/or low-pass filters, tuners, etc. to isolate signals of interest).
The exemplary leak-minimized DES implementation of the invention addresses these and other weaknesses via a number of security-enhancing techniques that, although used together in the exemplary embodiment, may be deployed individually or in various combinations, as will be appreciated by those skilled in the art. The implementation will be fully described below with regard to encryption only. However, those skilled in the art will readily appreciate how to apply the principles demonstrated here to decryption operations because encryption and decryption are extremely similar and use the same Feistel "F" function. For the convenience of the reader, certain differences between the two implementations will be noted where they are significant. Finally, those skilled in the art will also appreciate that the techniques demonstrated here can also be applied to combined encryption/decryption DES functions.
In one embodiment of the invention, the inputs to the DES function (the plaintext and the key, when encrypting) are encoded in a different form than usual. Standard DES implementations use a 56-bit key K (commonly stored as 8 bytes with an ignored parity bit in each byte) and a 64-bit plaintext message M. However, the process of loading a key or message into a standard DES implementation can leak information about the key or plaintext.
Thus, a preferred improved DES implementation of the invention instead uses two 56-bit keys (K1 and K2) and two 64-bit plaintext messages (M1 and M2), each associated with a permutation (i.e., K1P, K2P, M1P, M2P) such that K1P{K1} XOR K2P{K2} equals the "standard" DES key K, and the M1P{M1} XOR M2P{M2} equals the "standard" plaintext. In the notation used above and throughout this document, "X{Y}" denotes the result of applying permutation X to Y; "X[Y]" denotes element Y of array X; and "X[Y][Z]" denotes element Y,Z of the two-dimensional array X.
In this embodiment, the permutations and blinded values can be produced as follows. To produce K1 and K2 from a 56-bit key K, a random value K1 is produced, then K2 is computed as K2=K XOR K1. (As used herein, the term "random" shall include truly random values, as well as pseudorandom and other values that are unpredictable by an attacker. Methods for producing random values are well known in the background art and need not be described in detail here.) Next, random permutations K1P and K2P are produced, and K1P-inverse is applied to K1 and K2P-inverse is applied to K2. Similarly, to divide a message M into M1 and M2, M1 is set to equal a 64-bit random value, then M2 is set to M2=M XOR M1. Next, random permutations M1P and M2P are created and their inverses are applied to M1 and M2, respectively. The permuted keys and messages are then used, rather than the standard key and message, during the course of cryptographic operations. Although not necessary to the present invention, the exemplary embodiment has the properties that: (a) for any key, H(K1) and H(K2) average to 64/2=32, where H(X) is the Hamming Weight of X, (b) the probability that any specific bit in either K1 or K2 is a 1 is 0.5, and (c) correlations between register locations and key bits are weak (or equal to exactly 0.5). These properties can reduce the amount of useful information leaked by the system to an attacker.
At the end of such operations, the two parts of the ciphertext may be recombined to form the same encrypted/decrypted quantity that would have been produced by a standard DES protocol.
For ephemeral keys and messages (i.e., those only used for a small, limited number of operations), the splitting may be simply performed when the key or message is used. However, for long-term keys used for a large number of operations, it is preferable to store keys in split form to ensure that splitting operations will not reveal information about the keys. (The exemplary embodiments described may be used in either case.)
The leak-minimizing DES implementation must be initialized before it can be used. Such initialization can occur at any time before the leak minimizing cryptographic operations are used, including, without limitation, when the device is manufactured, personalized, installed, activated, downloaded, first used, keyed, etc.
Leak-Minimizing DES: Initialization and S Updates
Initialization provides starting values for the permutations, S tables, and associated parameters. The following parameters are initialized, in no particular order (i.e., one order is shown for convenience, but the actual order of initialization does not matter):
While it is preferable that each device be initialized with unique random parameters (S_TABLE, etc.), cost constraints or other considerations may sometimes make it necessary to initialize multiple devices identically. Similarly, if multiple devices share a key, it is preferable (but not required) that the key be initialized in each with a unique set of key parameters (K1, K2, K1P, K2P).
For greater security, during operation of the device the tables are preferably periodically updated so that attackers will not be able to obtain the table contents by analysis of measurements. The updating process should preferably introduce fresh entropy into the tables faster than information leaks out. Such an update process can require a significant amount of time, particularly if the S tables are stored in memory such as some EEPROM that is slow to update. To prevent the update process from introducing unpredictable processing delays, the update can occur gradually, so that a portion of the S table is updated at a time. Idle time, if available, can also be used for table updates.
One way to implement the update process is to have each of the main arrays (S_INPUT_MASK, S_INPUT_PERM, S_OUTPUT_ORDER, and S_TABLE) contain 9 elements (one more than the required eight), such that an extra element is always available for preparing new (updated) tables. The table update process transforms any one of the 8 active parameter sets, places the result into free array entries, then updates S_ORDER_TABLE and S_OUTPUT_MASK when the updated tables are ready to use. To update an S table block, an input index (m) and an output index (n) are selected, where m is an index to the existing entry to be updated in each of the arrays and n is an index to the free array entries where the updated values will be placed. The device creates and stores new values for the parameters at S_INPUT_MASK[n], S_INPUT_PERM[n][0.5], S_OUTPUT_ORDER[n][0 . . . 7], and S_OUTPUT_MASK. (The new S_OUTPUT_MASK has new random bits in the position corresponding to S_ORDER_TABLE[m], but the other bits are not changed.) Next, the device translates the S_TABLE[m][0 . . . 63] into S_TABLE[n][0 . . . 63], compensating for the old parameter set (S_INPUT_MASK[m], S_INPUT_PERM[m][0 . . . 5], S_OUTPUT_ORDER[m][0 . . . 7], and S_OUTPUT_MASK) and incorporating the changes appropriate for the new parameter set (S_INPUT_MASK[n], S_INPUT_PERM[n][0 . . . 5], S_OUTPUT_ORDER[n][0 . . . 7], and the new S_OUTPUT_MASK). Alternatively, if a copy of the standard (non-blinded, etc.) S table is available, its values may be used to perform the update, in which case the old parameter set is not required for the update. Once the new S_TABLE is complete, S_ORDER_TABLE is updated by replacing the value m with the value n. Also, S_OUTPUT_MASK is replaced with its new value. Although not strictly required, the update to S_ORDER_TABLE and to S_OUTPUT_MASK is preferably done as a single reliable memory update, since update of only one could cause incorrect operation. If unreliable memory updates are used during other memory updates, the new table should be checked against the old one for correctness. Additionally, a test operation can be performed using a test key to verify correct operation before important keys are used with the implementation. Alternatively or additionally, complete and error-free write operations may be used for table update operations, although these memory updates are typically much slower than standard unverified memory updates.
Leak-Minimizing DES: Encryption (and Decryption)
A traditional DES encryption process uses a key K to transform a 64-bit input message M into a result.
At step 110, key and message update processes are performed. At the beginning of the update process, a failure counter C is incremented and checked against a threshold value. If the threshold is reached, the operation fails and terminates. Otherwise, the input parameters for the key (K1, K2, K1P, K2P) and message (M1, M2, M1P, M2P) are updated. The update process consists of two basic operations: reordering and randomizing. Reordering updates the positions of data bit and permutation entries. Exchanging pairs of elements in K1P (or K2P) and the complementary pair of bits in K1 (or K2) does not change the effective value of the message but does reorder its encoding. Randomizing blinds the data bit values, in this embodiment through an XOR operation. XORing the same random Boolean value onto a bit of K1 and the corresponding bit of K2 also does not have any effect on the value of K1P{K1} XOR K2P{K2}. To avoid correlation attacks, an XOR table is constructed with the value to XOR, permuted with K1P and K2P, and finally separately applied to K1 and K2. If the key is to be used in future transactions, the input parameters for the key are overwritten in the long-term memory with the updated values (using a complete and error-free write operation). As noted, the input parameters for the message (M1, M2, M1P, M2P) may be reordered and randomized in a similar fashion as for the key. Finally, the failure counter C is set to zero. At this point, the key and message have been successfully randomized, so attackers cannot force the device to process the same key repeatedly by introducing power failures or other processing interruptions.
At step 120, the initial permutation (IP), which is a part of the standard DES algorithm, is applied to the input message. Because M1 and M2 are stored in permuted form, the initial permutation needs to affect the value of M1P{M1} and M2P{M2}. Although it is possible for an implementation to modify the data (i.e., M1 and M2), it is not necessary. The permutation operation can be applied by manipulating only the permutation tables themselves, by applying the IP to the permutations M1P and M2P, e.g. by computing a new M1P=IP{M1P} and a new M2P=IP{M2P}. Optionally, additional reordering or randomizing of the data (as was performed at step 110) may be performed as well.
Also at step 120, the PC1 permutation, which is a part of the standard DES algorithm, is applied to the input key. As with the IP, the permutation operation can be applied by manipulating only the permutation tables themselves (K1P and K2P) and do not necessarily need to involve the data. Note that as a performance optimization, keys that will be used often may be stored with this permutation already applied. To improve performance, PC2 can also be applied at this step to simplify the permutation operation required in each round by enabling the combining of PC2 with the shift operations. (The remaining 8 unused key bits are stored to the right of the 48 output bits of PC2 to maintain the 56 bit key length.) Optionally, additional reordering or randomizing of the key (as was performed at step 110) can be performed.
At step 130, the round counter is initialized to zero. At step 135, the key and message parameters are updated, as in step 110.
At step 140, the round key is prepared by permuting the key (K1, K2, K1P, K2P) to separate the 6 key bits required for each of the 8 S operations. If the PC1 step above is optimized, this step combines the round key left rotates (or right key rotates when decrypting) and PC2 operation in a single 56-to-56 permutation. The complete permutation performed is equivalent to performing PC2 inverse, followed by the round rotate operation, followed by a PC2 forward permutation. As noted previously, the encoding for the round subkey places the 48 key bits used in the round operation at the left of the key register, and places the remaining 8 (unused) key bits at the right. The number of shifts is a function of the round: rounds 0, 1, 8, and 15—or 1, 2, 9, and 16 if numbering with round 1 as the first round—have one shift; the others have two. Thus, a different permutation operation or an extra permutation operation is used in rounds with two shifts. Optionally, additional reordering or randomizing of the key may be performed at this step. (If decrypting, this step can be performed after the S table lookups, or the PC1 permutation step will need to be adjusted to compensate for applying this permutation before the S lookups. Also, as noted, the PC2/rotate key permutation needs to incorporate a rotate to the right.).
At step 145, the round operations are performed, as detailed in
At step 220, a random 6-bit mask V is obtained. Also at step 220, index register q is computed as the current S_INPUT_MASK value blinded by V (e.g., by computing q=V XOR S_INPUT_MASK[j]).
At step 230, using the permutation M1P for bit selection, the six input bits from M1 corresponding to the current S operation are extracted and XORed onto q. The six bit extraction and XOR operations are performed in random order. The selected bits correspond to the group of six bits selected by the E expansion operation for the current S index. Bits are placed in q in the order specified by S_INPUT_PERM[j]. Step 235 is similar to step 230, except that the appropriate six bits of M2 are selected using M2P.
At step 240, using the permutation K1P for bit selection, the six key bits input into the S operation are selected from K1. The six bit extraction and XOR operations are performed in random order. The selected bits correspond to the six key bits used in the current S operation of the current round. (If the key permutations performed previously at steps 120 and 140 of
At step 250, the S table lookup is performed by retrieving S_TABLE[j][q XOR V]. At step 260, for each of the 4 bits in the left half of the S table result, the device identifies the target location in M1 corresponding to the result of performing the S result permutation, the P permutation, and the M1P permutation. Each of the left 4 S result bits is permuted according to the first half of the elements in S_OUTPUT_ORDER[j] and XORed onto the corresponding M1 bit. (These permutations ultimately target the bit in M1 that corresponds to the appropriate destination bit in L.) The same is done to XOR the 4 bits in the right half of the S result onto M2 using M2P and the second half of S_OUTPUT_ORDER[j]. Optionally, the S table entry may be updated by XORing the left and right halves of the S table entry with a random 4-bit constant, permuted according to the inverse of the S_OUTPUT_ORDER permutations for the left and right half of the S result.
At step 270, the loop counter i is incremented. At step 275, i is checked to determine whether more of the round's 8 S table lookups need to be performed. If so, processing continues at step 210.
After the S table lookups have completed, at step 280 the value of S_OUTPUT_MASK is XORed onto M2 (of course, adjusted according to M2P). Also at step 280, the right and left halves of the data are exchanged in M1, M1P. Note that the exchange may be implemented as a bit permutation which, as described previously, can be accomplished by only changing M1P. Similarly, the left and right halves of M2, M2P are exchanged. Additional reordering or randomizing of the message, for example as described at step 110 of
Referring back to
After all rounds are complete, the final permutation is performed on the message at step 160. As described previously, the permutation operation can be applied by only manipulating the permutation tables themselves (M1P and M2P) and do not necessarily need to involve the data. Optionally, additional reordering or randomizing of the data may be performed. Finally, at step 170, the result contained in (M1, M2, M1P, M2P) is returned. If the result is non-secret (e.g., ciphertext), the standard DES ciphertext is produced by computing M1P{M1} XOR M2P{M2}.
During or between encryption (and decryption) operations, the S tables and associated parameters are updated. The rate and frequency at which updates are performed is a design parameter that depends on several factors. For example, table updates take time, particularly if the device's memory updates are slow, so less frequent table updates may be desirable for some high-performance implementations. The lifetime of the device's memory may also require that the update rate be limited. For example, EEPROM memories may fail if they are updated too many times. Also, devices with higher leakage rates may need to have their tables updated more often. For example, by using multiple redundant tables or splitting operands into more than two parts, effective leakage rates are reduced, and the table update rates can decrease. Finally, the device's security requirements can dictate the update frequency (e.g., more frequent updates can make attacks more difficult).
Because the DES key length is quite short (only 56 bits), DES is often strengthened using the triple DES construction, whereby three DES operations are performed on each data block. Leak minimizing triple DES may be implemented using three iterations of leak-minimizing single DES. Note that the two components comprising the first DES output may be used directly as the input to the second DES operation, and the second DES output components may be used directly as the input to the third DES operation. Also, the final permutation on the first and second DES operations is unnecessary if the initial permutation is omitted on the second and third DES operations.
Another alternate construction, DES-X, is known in the background art and is occasionally used as a way to strengthen DES against brute force attacks. DES-X involves XORing the plaintext with a 64-bit secret value (KX), using the normal DES algorithm with a secret DES key (KY) to encrypt the XOR result, and XORing the DES result with a third secret value (KZ). In an exemplary embodiment of DES-X according to the present invention, the XOR secrets (KX and KZ) can, for example, be stored as two components each (KX1, KX2 and KZ1, KZ2). Before the DES operation, KX1 is XORed onto one of the message halves (e.g., M1 with permutation through MP1) and KX2 onto the other. The DES operation is performed using a leak-minimizing implementation. After the DES operation, the message result halves are XORed with KZ1 and Kz2. To update a pair of XOR secret components (KX1 and KX2, or KZ1 and KZ2), a random number is produced and XORed onto both. Like other keys and messages, XOR key components can optionally have associated permutations.
Other Considerations
Cryptographic operations should normally be checked to ensure that incorrect computations do not compromise keys or enable other attacks. Cryptographic implementations of the present invention can be, and in a preferred embodiment of the invention are, combined with error-detection and/or error-correction logic to ensure that cryptographic operations are performed correctly. For example, a simple and effective technique is to perform cryptographic operations twice, ideally using two independent hardware processors and implementations, with a comparator to verify that both produce identical results. If the results produced by the two units do not match, the comparator will prevent the defective processing result from being used. In situations where security is more important than reliability, the comparator may make the device self-destruct if serious errors occur. For example, the comparator can cause a self-destruct if the two defective DES operations occur sequentially or once five defective DES results occur during the lifetime of the device. In some cryptosystems, redundancy is not necessary. For example, with RSA, self-checking functions can be incorporated into the cryptosystem implementation itself or verification can be performed after the operations.
Self-diagnostic functions such as a POST (power-on-self-test) should also be incorporated to verify that cryptographic functions have not been damaged. In some smartcards and other devices, the ATR (answer-to-reset) must be provided before a comprehensive self-test can be completed. In such cases, the self-test can be deferred until after completion of the first transaction or until a sufficient idle period. For example, a flag indicating successful POST completion can be cleared upon initialization. While the card is waiting for a command from the host system, it can attempt the POST. Any I/O received during the POST will cause an interrupt, which will cancel the POST (leaving the POST-completed flag at zero). If any cryptographic function is called, the device will check the POST flag and (if it is not set) perform the POST first.
Many variations and adaptations of the invention are possible. For example, the message bits can be stored in 128-bit arrays where the bits are intermingled (as opposed to having separated halves), keys can be manipulated in 64-bit form instead of 56-bit form, orderings can be reversed or permuted (including in ways that do not change the final result of the computation). Rather than blinding operations with XOR halves, other bit operations can be applied. Where basic operations other than XOR bit operations are used, other splitting and/or blinding functions can be used. To save memory, permutation tables can be eliminated while maintaining randomness in table orders by encoding tables such that XORing with a mask (or applying another index unmasking function) yields the final pointer to the data. Rather than splitting data into only two halves, three or more subvalues can be used. Additional tables (whose inputs serve as pointers to further tables, or whose outputs are combined, or both) can be used for additional security. In optimized hardware implementations, it might be necessary to limit the amount of system state information, so simplified versions of the algorithm can be implemented. For example, rather than maintaining full permutation tables, it is possible to permute the order by applying a parameter-based function to the input. For example, in an exemplary permutation operation, the output bit location is found by XORing the input location register by a first constant, then adding the value of a second constant. (For a 6-bit index, only 12 register bits are required to encode the permutation, as opposed to (2ˆ6)(64)=4096 for a regular permutation.) In hardware implementations where individual operations in an integrated circuit or other module are considered to be secure, the invention may still be applied for securing secret messages and keys communicated between the circuit (or module) and other parts of the system.
Further, although the invention has been described in the context of permuting both keys and messages, each into two sub-parts, those skilled in the art will appreciate that either or both (as well as other secret quantities) could be permuted, into a plurality of parts greater than two. Finally, although the invention has been described with respect to DES, the invention can be applied to and adapted to other cryptographic symmetric algorithms, including without limitation Blowfish, SEAL, IDEA, SHA, RC5, TEA, and other cryptographic algorithms involving operations suitable for application of the techniques of this invention. In all such cases, including DES, the term "plaintext" as used herein shall be understood to refer to the quantity that is in plaintext form relative to whatever cryptographic protocol is being used (e.g., DES). Thus, a "plaintext" quantity could actually be encrypted using some other algorithm and still be within the meaning of plaintext relative to the cryptographic protocol under consideration.
The invention therefore encompasses a wide variety of related techniques that enable the construction of devices that are significantly more resistant to attack than devices of similar cost and complexity that do not use the invention. In addition, multiple security techniques may be required to make a system secure; and leak minimization may be used in conjunction with other security methods or countermeasures.
As those skilled in the art will appreciate, the techniques described above are not limited to particular host environments or form factors. Rather, they may be used in a wide variety of applications, including without limitation: cryptographic smartcards of all kinds including without limitation smartcards substantially compliant with ISO 7816-1, ISO 7816-2, and ISO 7816-3 ("ISO 7816-compliant smartcards"); contactless and proximity-based smartcards and cryptographic tokens; stored value cards and systems; cryptographically secured credit and debit cards; customer loyalty cards and systems; cryptographically authenticated credit cards; cryptographic accelerators; gambling and wagering systems; secure cryptographic chips; tamper-resistant microprocessors; software programs (including without limitation programs for use on personal computers, servers, etc. and programs that can be loaded onto or embedded within cryptographic devices); key management devices; banking key management systems; secure web servers; electronic payment systems; micropayment systems and meters; prepaid telephone cards; cryptographic identification cards and other identity verification systems; systems for electronic funds transfer; automatic teller machines; point of sale terminals; certificate issuance systems; electronic badges; door entry systems; physical locks of all kinds using cryptographic keys; systems for decrypting television signals (including without limitation, broadcast television, satellite television, and cable television); systems for decrypting enciphered music and other audio content (including music distributed over computer networks); systems for protecting video signals of all kinds; intellectual property protection and copy protection systems (such as those used to prevent unauthorized copying or use of movies, audio content, computer programs, video games, images, text, databases, etc.); cellular telephone scrambling and authentication systems (including telephone authentication smartcards); secure telephones (including key storage devices for such telephones); cryptographic PCMCIA cards; portable cryptographic tokens; and cryptographic data auditing systems.
All of the foregoing illustrates exemplary embodiments and applications of the invention, from which related variations, enhancements and modifications will be apparent without departing from the spirit and scope of the invention. Therefore, the invention should not be limited to the foregoing disclosure, but rather construed by the claims appended hereto.
|Citing Patent
|Filing date
|Publication date
|Sep 21, 2006
|Jun 30, 2009
|Atmel Corporation
|Randomizing current consumption in memory devices
|Oct 29, 2007
|Oct 6, 2009
|Cryptography Research, Inc.
|Differential power analysis
|Nov 9, 2006
|Nov 3, 2009
|Atmel Corporation
|Embedded software camouflage against code reverse engineering
|Jan 20, 2006
|Jan 26, 2010
|Xilinx, Inc.
|Memory arrangement for message processing by a plurality of threads
|Aug 15, 2001
|Feb 23, 2010
|Cryptography Research, Inc.
|Cryptographic computation using masking to prevent differential power analysis and other attacks
|Apr 3, 2003
|Jun 22, 2010
|Gemalto Sa
|Cryptographic method protected against covert channel type attacks
|Oct 30, 2007
|Sep 7, 2010
|Cryptography Research, Inc.
|Leak-resistant cryptographic payment smartcard
|Mar 24, 2003
|May 10, 2011
|Cryptography Research, Inc.
|Payment smart cards with hierarchical session key derivation providing security against differential power analysis and other attacks
|Nov 9, 2006
|Jul 19, 2011
|Inside Contactless S.A.
|Bi-processor architecture for secure systems
|Jun 25, 2009
|Oct 4, 2011
|Atmel Corporation
|Randomizing current consumption in memory devices
|Jan 20, 2006
|Oct 4, 2011
|Xilinx, Inc.
|Generation of executable threads having source code specifications that describe network packets
|Aug 10, 2006
|Oct 30, 2012
|Inside Secure
|Software execution randomization
|Mar 10, 2011
|Jul 16, 2013
|Stmicroelectronics (Rousset) Sas
|Method and circuitry for detecting a fault attack
|Dec 30, 2009
|Sep 3, 2013
|Microsoft Corporation
|Reducing leakage of information from cryptographic systems
|Sep 20, 2010
|Dec 24, 2013
|Zamtec Ltd
|Encrypted communication system with limited number of stored encryption key retrievals
|Sep 20, 2010
|Jan 21, 2014
|Zamtec Ltd
|Encrypted communication device with restricted rate of encryption key retrievals from memory
|Nov 10, 2010
|Apr 1, 2014
|Stmicroelectronics (Rousset) Sas
|Method and apparatus for detection of a fault attack
|Nov 10, 2010
|May 13, 2014
|Stmicroelectronics (Rousset) Sas
|Method of detecting a fault attack
|Feb 4, 2009
|Sep 30, 2014
|Nec Corporation
|Device for evaluating side-channel attack resistance, method for evaluating side-channel attack resistance, and program for evaluating side-channel attack
|Dec 24, 2003
|Jul 7, 2005
|Intel Corporation
|Method and apparatus for establishing trust in smart card readers
|Apr 3, 2003
|Jul 28, 2005
|Cryptographic method protected against covert channel type attacks
|Dec 4, 2008
|Sep 30, 2010
|Nec Corporation
|Side channel attack tolerance evaluation apparatus, method and program
|Feb 4, 2009
|Dec 23, 2010
|Nec Corporation
|Device for evaluating side-channel attack resistance, method for evaluating side-channel attack resistance, and program for evaluating side-channel attack
|May 19, 2011
|Stmicroelectronics (Rousset) Sas
|Method of detecting a fault attack
|Nov 10, 2010
|May 19, 2011
|Stmicroelectronics (Rousset) Sas
|Method and apparatus for detection of a fault attack
|Nov 10, 2010
|May 26, 2011
|Stmicroelectronics (Rousset) Sas
|Method of signature verification
|Sep 15, 2011
|Stmicroelectronics (Rousset) Sas
|Method and circuitry for detecting a fault attack
|Sep 20, 2010
|Apr 7, 2011
|Silverbrook Research Pty Ltd
|Communication system, method and device with limited encryption key retrieval
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Apr 29, 2011
Owner name: CRYPTOGRAPHY RESEARCH, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KOCHER, PAUL C.;JAFFE, JOSHUA M.;JUN, BENJAMIN C.;REEL/FRAME:026204/0705
Effective date: 19990602
|Feb 28, 2014
|Fee payment
Year of fee payment: 4


text:
|Volleyball » News » Schedule » Roster » Coaches » Statistics
Volleyball Wraps Up Play at Weekend Tournament
Saturday, August 31, 2002Charlotte, N.C. (August 31, 2002) -- East Tennessee State finished its opening weekend of volleyball at the Spring Hill Suites Invitational in Charlotte, N.C. Unfortunately, the Buccaneers dropped both of their Saturday matches to fall to 0-3 on the season. Northwestern (2-0) and Southern Methodist (1-2) each handed the Lady Bucs a pair of 3-0 losses at Halton Arena. ETSU still showed signs of growing pains as the relatively young Bucs fell to the Wildcats in three games, 30-19, 30-18 and 30-19. The matched marked the first time that the Buccaneers faced a Big Ten opponent since 1984 and it was only the second time ETSU did battle with the conference in school history. East Tennessee State, overmatched by the sheer size of Northwestern, didn't have an individual player record double figure numbers in kills nor digs, but junior Lissa Allen (Palm Bay, Fla.) caught the eye of head coach Deane Webb, providing the team with some much-needed motivation. "Lissa did an excellent job of being aggressive," Webb said of the 6'0" middle hitter. "I was pleased with the production from our entire middle, and it was a great opportunity to play against a team from the Big Ten. I'm sure our players learned a lot from playing Northwestern." SMU provided quite a different challenge for the Bucs. Although the Mustangs were not as physical as Northwestern, Webb noted the overall athleticism of Southern Methodist posed some problems in the 30-16, 30-20 and 30-23 losses. "We were overmatched by SMU at many positions," said Webb. "We also didn't pass well enough to put us in position to win." Overall, Webb said he was pleased with the energy from his freshmen. Katie Ralph (Port Orchard, Wash.) and Nicole Ryan (Etiwanda, Calif.) completed their first weekend of collegiate volleyball as the team's statistical leaders in numerous categories. Ralph earned 21 kills in 10 games behind Ryan's team leading 26 kills. Ralph leads the Lady Bucs in blocks (6) and digs (26), while freshmen setter Renee Vesey (Paw Paw, Mich.) tallied 64 assists in the team's three matches. East Tennessee State returns to action on Tuesday, Sept. 3, when the Bucs host Lincoln Memorial in the home opener at Brooks Gym. The match is set to begin at 6 p.m. To reserve tickets for the event contact the athletics ticket office at (423) 439-5371.
Volleyball Archives
2002-03 Volleyball

subset: commoncrawl


text:
Office Professional 2013 was designed to help you create and communicate faster, with time-saving features and a clean, modern look across all your programs. Plus, save your documents online in OneDrive to access virtually anywhere.
Be even more responsive to clients or customers. Get to what you need faster in Outlook, use new sharing tools, and share docs on OneDrive.
Respond quickly. Preview Outlook messages, reply from the Reading Pane, or sneak a peek at contacts.
Communicate the way you want, faster. Now you can find all your sharing options in one place in Office programs, File > Share.
Create winning docs fast using templates from the Start screen. Work with .pdf content, images, and data in new ways and share your work online.
Draw conclusions from data in less time. Convert data into a chart or table in two steps or less.
Easily build a database app and share it on the web. Access creates the structure, so you can start using and sharing your app right away.
Sign in to Office on your PC or on the move—your personal settings and recent files are with you.
Your custom settings roam with you. Re-open a document from any PC or device and keep working right where you left off.
Store files in the cloud. Office saves your documents to OneDrive so your notes, documents, and group files are always accessible.
Need help with your Microsoft products? No matter what help you may need with downloading or installing Windows or Office, connect with one of our experts to get the support you need.
Use our Freephone or Live Chat support and we will get your software working just the way you want it.
For help getting Up & Running, call Microsoft Store support. Click here for the number and opening hours.
For 1 computer
For 1 computer
1 PC or Mac plus 1 iPad, Android or Windows tablets.1 Ongoing access to updates
5 PCs or Macs plus 5 iPad, Android or Windows tablets.1 Ongoing access to updates
1TB OneDrive storage each for up to 5 users4 – Save documents online to your OneDrive for easy access and sharing virtually anywhere
Skype world minutes – Find new ways to stay in touch with 60 minutes of Skype calls each month to phones in 60 countries3
Install Office on up to 5 PCs or Macs, plus five iPads or Windows tablets
Always have your applications, settings and documents accessible when you need them
Easily access and edit your docs with Office Mobile apps for iPhones, Android, and Windows phones
Includes ongoing access to version upgrades, multiple device installs, and access to multiple languages
Share your subscription benefits with up to four other members of your household. Additional members can:
1 gigahertz (Ghz) or faster x86- or x64-bit processor with SSE2 instruction set
Windows 8, Windows 7, Windows Server 2008 R2, or Windows Server 2012
1 GB RAM (32 bit); 2 GB RAM (64 bit)
3.0 GB available
Graphics hardware acceleration requires a DirectX 10 graphics card and 1024 x 576 resolution
3.5, 4.0, or 4.5
A touch-enabled device is required to use any multi-touch functionality. However, all features and functionality are always available by using a keyboard, mouse, or other standard or accessible input device. Note that new touch features are optimised for use with Windows 8.
Some functionality may vary, based on the system configuration. Some features may require additional or advanced hardware or server connectivity.
Microsoft account required.
Note: System requirements are rounded up to the nearest 0.5 GB, to be conservative. For example, if we measure an application's required hard disk space to be 1.99 GB, we recommend 2.5 GB of disk space. Our hard disk system requirements are intentionally larger than the actual disk space usage of the software.
A graphics processor helps increase the performance of certain features, such as drawing tables in Excel 2013 or transitions, animations, and video integration in PowerPoint 2013. Use of a graphics processor with Office 2013 requires a Microsoft DirectX 10-compliant graphics processor that has 64 MB of video memory. These processors were widely available in 2007. Most computers that are available today include a graphics processor that meets or exceeds this standard. However, if you or your users do not have a graphics processor, you can still run Office 2013.


text:
The windows of heaven opened over the Mississippi River basin in early April 1965, and rain was upon the land for half a month. It fell on soil hardened by an unusually deep winter frost and streams swollen with the melt from a heavy, late snow. On April 5, the Mississippi began rising rapidly in Minnesota, Wisconsin, and Iowa. Governors deployed the National Guard to build and patch dikes.
The river swept away houses or beat them to sticks, according to witness reports compiled by the National Weather Service. On April 16, Good Friday, surging waters broke through railroad tracks in Bluff Siding, Wis., and raced over thousands of acres of farmland, flinging dazed livestock across the countryside.
From north of Minneapolis down to Hannibal, Mo., the waters climbed to heights that still stand as records. The raging Mississippi inflicted what would be $1.5 billion in damages in today's dollars, a tab largely picked up by the federal government, because most of the farmers lacked flood insurance. It was a level of destruction that few townsfolk along the river had thought possible.
As Charlie Hale, a photographer who snapped hundreds of rolls of flood photos for the Post-Bulletin in Rochester, Minn., later recalled to the Weather Service, "Old-timers couldn't remember any floods big enough to flood a city—why should 1965 be different?" His camera told Hale it was different. Flying over the Mississippi in early April, he likened the river to "a time bomb," and said he wondered "if it was going to get the right elements and explode someplace."
People build houses on floodplains because they expect that someone will rescue them if things go bad. That's the classic economic parable of "moral hazard," the tendency of individuals and institutions to take on too much risk whenever they don't have to pay for it. It's also one of the simplest ways to explain how the U.S. economy tanked three years ago and why it remains in danger of collapsing again, even more catastrophically.
The river-dwellers in the 1960s, who undervalued risk, presaged the investment bankers and subprime-mortgage borrowers in the run-up to the financial crisis. After all, what kind of society turns its back on families left homeless by a flood, or lets its system of borrowing and lending disintegrate overnight?
When a monster flood strikes, the government typically passes laws designed to prevent a repeat of the destruction. Fairly quickly, though, houses start popping up on the floodplain again. That was true along the Mississippi River basin. After the 1965 floods, President Johnson pushed through a set of reforms that included the first federal flood-insurance program. In 1993, the river spilled over its banks again. Damages topped $22 billion in today's dollars, about 15 times the real-dollar amount from 1965. Once again, the government bore much of the cost. Few locals had bought what was supposed to be mandatory insurance.
The U.S. economy is in danger of a much more devastating déjà vu event today—unless regulators, lawmakers, businesses, and consumers adjust their actions to account for new risks and the nation's increased vulnerability to them. Protecting ourselves starts with admitting that the next big storm could hit soon and that, if it does, rescue could be a long time coming.
(Watch Jim Tankersley talk about the five vulnerabilities that the U.S. economy faces.)
The waters are just now receding from the financial flood of 2008. But the river remains, as photographer Hale said, filled with time bombs. The increasingly connected international economy, the rapidly changing global ecology, and the world's dizzyingly complex and distressed financial system all carry risks that could explode and wipe out the U.S. recovery. Meanwhile, the lingering effects of the last crisis have weakened wealthy nations' ability to respond to the next one if it comes soon.
It's difficult to pin down the total burden of risk that the economy is bearing, or to say with any certainty whether Americans are taking more inadvisable risks today than in the past. But what's indisputable is that the American economy is highly vulnerable, perhaps more so than at any point in recent history, to the threat of risky behavior blowing a hole in its fragile recovery. It's also true that the underpriced risks taken today by an overconfident few—highly leveraged foreign banks, say, or fossil-fuel gluttons in industrial countries—could rain economic misery on the masses in the United States and around the world.
In other words, whether we choose to or not, we all live on a floodplain now.
Economic risk isn't inherently bad—nations couldn't grow and prosper if people never took chances with their money. In a free and functioning market, problems start when risk is priced too low, forcing everyone unwittingly to share in the resulting vulnerability.
If Jane wants to buy a house with money borrowed from her bank, the bank estimates Jane's risk of default and charges her appropriately to cover that risk. But what if the lender gave Jane a discount, assuming that her neighbors would step in to help make payments if she faced losing the house? So, what if Jane got a loan she really shouldn't have qualified for? And what if Jane and all her neighbors, who also borrowed from the bank at discount rates, defaulted at the same time? What if the bank then fails, and no one in town can borrow money, and the local economy collapses? A lot of people with no connection to Jane or her loan suffer the consequences.
Clifford Marks contributed contributed to this article.
This article appears in the March 12, 2011 edition of National Journal Magazine.


text:
The Complete Guide to Basic Mat CuttingOur Price: $7.99
List Price: $9.95
Close Recently added item(s)
You have no items in your shopping cart.
Shop By Catalog, Order By Item Number (SKU)
List Price: $9.95
Featured brands
Tips, tricks, thoughts and inspiration from across the art spectrum.
"Here at Cheap Joe's, we love using products in unconventional ways–like spray painting area rugs or making stamps made out of erasers–so it's no wonder that I looked…Friday, August 21, 2015
"You know what really bums me out? When you can't find an area rug you like that's also within your price range. Sure, you can get a 5′x7′ rug for $40, but I'll bet it's either…Friday, August 7, 2015
"This week, I have a fun craft for all you scrapbookers and stationary lovers out there–stamps! Though, this isn't solely for those crafters because the best and easiest way to…Friday, July 31, 2015
Please wait...


text:
Team 2012-13: Fenerbahce (Turkey-TBL)
Career: Besiktas (Turkey-TBL, 2003-04); Efes Pilsen Istanbul (Turkey-TBL, 2004-07); Pinar Karsiyaka (Turkey-TBL, 2007-08); Turk Telekom Ankara (Turkey-TBL, 2008-09); Banvit Bandirma (Turkey-TBL, 2009-12); Fenerbahce (Turkey-TBL, 2012-13)
Ermis once again is on the fringes of making the Turkish senior national team. The point guard played a minor role at the 2010 FIBA World Championship and nearly made the cut for the last EuroBasket two summers ago. Ermis has really come on in the past three seasons. He led the Turkish League in assists in 2010-11 with Banvit (6.1 per-game) and was second-best the next season (5.8 per-game). He then moved onto a bigger club in Fenerbahce and averaged an impressive 2.7 assists and 1.3 turnovers in under 16 minutes-a-night in the Turkish League. The 1.93m guard also shot over 45% from long range while playing excellent defence. Ermis may not be expected to play a lot of minutes in Slovenia - if he even makes the final squad - but he can be expected to be productive in the time he does receive.


text:
Hang tight!
Recipe by LitleLisa1
"This creamy main dish gets a splash of color with the addition of zucchini, sun-dried tomatoes, and basil. With much less butter than in a typical risotto recipe and no wine, there's no running around for ingredients you don't have on hand! The result is a lovely, light flavor in a very filling meal."
Hmm. None of these ingredients are on sale today.
Show ingredients on sale
Sort stores by
Save money at local stores when ingredients are on sale!
Watch video tips and tricks
7 cups
vegetable or chicken stock
1 tablespoon
1 medium
onion, chopped
2 cups
Arborio rice, uncooked
medium zucchini, thinly sliced with a vegetable peeler
sun-dried tomatoes, softened and chopped
1 teaspoon
dried thyme, crushed
6 tablespoons
freshly grated Parmesan (or mozzarella) cheese
1 tablespoon
chopped fresh basil leaves, or to taste
freshly ground black pepper to taste
i love risotto, and this was a very good flavor combination! but 1/2 of a zucchini is definitely not enough!! i used a whole zucchini plus some yellow squash. i added the sun dried tomatoes about half way through cooking so that they would flavor the rice more. i also doubled the cheese (i used freshly shaved asiago) because I love cheese :) but it tasted pretty flavorful before i added the cheese, so you can definitely leave out the cheese or use less if you are trying to reduce fat. i made this today for my mom's birthday and she loved it!
This was quite labor-intensive to make and the flavor was lacking. As a full-time working mother and wife, I need recipes that are healthy, delicious and quick - this is not one of them. I love risotto and was hoping this would turn out well, but it's in desperate need of garlic salt and something else. Not a big fan of the addition of the thyme, and I usually like thyme. Definitely will not make this again. Only reason hubby and I ate it was because we can't stand to waste food.
284 Ratings
risotto is intimidating because of all of the stirring. As much as I cook, I still cannot get rice to work, so how was I going to make something as complicated as risotto? Thanks to this recipe (my inaugural attempt), my risotto was wonderful. Being a WeightWatcher girl, I did not add the parmesan cheese to the top (didn't miss it) and added lots of veggies. I too rough chopped my zucchini, and added chopped fresh broccoli and sweet peas (at the very end). I'd recommend carrots too.
One happy note: I did not "stir continuously". Instead I used a very good pot and stirred "quite often", until the end. When the mixture thickened, I "stirred continuously" and voila! No blob.
Thanks for the great recipe.
This was my first risotto attempt and it worked out pretty well. I was cooking for 2 so I scaled back the ingredients as follows(which made enough for 3):
4 cups chicken broth
1 tablespoon butter
1 cup rice
1/2 sweet onion chopped
2 small carrots chopped
5 sun dried tomatoes (used the kind packed in oil)
1 zucchini chopped
1 tablespoon dried thyme
3 tablespoons fresh grated parmesan
~ 12 small basil leaves sliced width-wise
I sauteed the carrots and onions together first, then added the rice and followed the rest of the recipe as instructed. Carrots sweeted it up a bit and the basil should not be skipped - it added a really nice flavor. With constant stirring over medium heat, the risotto probably took about 30 minutes total to cook. My fiance liked it and I enjoyed the leftovers for lunch the next day. I will make this again!
Loved this recipe!! I followed directions exactly; but used 1/2 teaspoon dried basil since I did not have fresh. Is definitely a keeper !! Thanks for the recipe.
This was an excellent recipe. The flavor was perfect. The only changes I made were to add 5 or 6 leaves of fresh basil, I used an entire zucchini instead of half, marinated sun dried tomatoes and I used more parm. Oh and freshly ground pepper. Yum!
This was the best side dish I've made in a long time! I substitued 1 cup of low sodium broth with 1 cup of a dry white wine, which added a lot of flavor. I used dried thyme and basil and didn't miss the fresh herb taste. This recipe is a keeper!
We really enjoyed this! A veggie dish that doesn't taste like it's missing meat at all. I doubled the onion, zucchini and sundried tomatoes and added a little garlic. It was nowhere near bland despite the fact that I forgot to add the thyme completely. My sundried tomatoes were marinated with herbs and that more than a made up for the lack of thyme. I like my veggies chunky and crunchy so I cut the zucchini into bigger bits, but I may slice them thinner next time, as the recipe suggest, as my boyfriend said the chunks reminded him of his childhood when he didn't like zucchini as a side dish. Fair enough. Will definitely make this healthy feeling and delicious risotto again.
* Percent Daily Values are based on a 2,000 calorie diet.
Zucchini Risotto
Serving Size: 1/6 of a recipe
Servings Per Recipe: 6
Amount Per Serving
Calories: 363
Calories from Fat: 37
We have so many top-rated chicken recipes, you'll never run out of dinner ideas again.
Imagine dinner making itself in the slow cooker while you relax or do other things.
Delicious recipes, party ideas, and cooking tips! Get a year of Allrecipes magazine for $7.99!
This creamy Italian rice dish makes an elegant main course.
A re-imagined version of fried green tomatoes using zucchini.
Make a creamy risotto with naturally sweet butternut squash.


text:
Seeing a dentist regularly is an essential part of a healthy lifestyle. And having great dental insurance can go a long way toward encouraging regular visits. Let us help you get started with an affordable dental insurance plan today.Individual & Family Plans Group Plans
Start enjoying all the perks of your Western Dental Benefit coverage—and take a positive step toward better oral health today.Group Plan Members Individual Members
Don't let cash-flow hold you back from good oral health. Partner with Western Dental for affordable dental care—and convenient payment options.


text:
In order to comply better with Google's guidelines, we've gone to a lot of effort to remove links to our website. However, sites that no longer link to us still show up in our Google Webmaster Tools. These links were removed over a month ago.
Take the 2-minute tour ×
Webmasters Stack Exchange is a question and answer site for pro webmasters. It's 100% free, no registration required.
The links will be there until the crawler will not reach those pages where links were.


text:
"Customer service is priority #1 at Rocky Mountain ATV/MC. We value our customers and strive to be the best shopping experience- when you buy from us, you are buying lifetime service."
-Dan Thomas, CEO and Founder
We take pride in offering no hassle returns. In the event of a return, please call, email or chat with us to receive a solution to the problem. For apparel that doesn't fit quite right, Click here to see our Fit Guaranteed Program.
We will stand behind all products we sell with regards to manufacturing defects in workmanship and material. Most products are limited to the manufacturer's warranty. However, we will do everything in our power to take care of the problem.
Live chat: Click here
(Leave email if after hours)
Call us: 1 800 336-5437
7am-7pm Mon-Fri 8am-4pm Sat (Mountain Standard Time)
Each review submitted enters you into a $100 gift card monthly drawing, and a $500 gift card quarterly drawing!
Comments On Jun 24, 2015:Extremely handy tool while working on your bike
Was this review helpful?
Comments On Mar 21, 2015:i love this little dish... perfect for normal jobs... i have a bigger one if need be, but his one is my usual dish... and for the price, it helps you get free shipping. that's why i bought mine and am glad i did...
Was this review helpful?
Comments On Jul 22, 2014:I feel silky saying this because it says very clearly 3 inches but thats the lip of the bowl. The base is like 1.5 inches. But i t really doesnt matter because i bought this just to keep track of a few bolts
Was this review helpful?
Comments On Jul 21, 2013:awesome dish magnetically will stay on your bike stand making it easy for small jobs to not loose bolts and screws
Was this review helpful?
Comments On Jul 19, 2013:Great quality with a nice grippy rubber bottom (not in the description). Magnet works good to hold bolts to the bottom. However it is quite small and only holds about 10 or so bolts reasonably. After 10 or so bolts it really fills up and loses the magnetic qualities when bolts are stacked on each other.
Great item if you have small screws, but for bolts off a dirt bike I would recommend getting the larger versions of these magnetic parts bowls.
Was this review helpful?
Comments On Jun 27, 2013:This little dish is perfect for nuts, bolts, and washers, and is the perfect size for your trackside toolbox. Definitely recommend.
Was this review helpful?
Comments On Jan 01, 2013:So far, these trays have not given any issues.or problems.
They function exactly as they should.
Was this review helpful?
Comments On Aug 21, 2012:everyone needs one.
Was this review helpful?
Comments On Jul 23, 2012:great for small jobs, and it holds on a steel frame so the bolts are always right there. Its a little small, but it is great for trail use.
Was this review helpful?


text:
Marineland LED Light Hood for Aquariums
|Marineland LED Light Hoods create natural shimmering daylight with a built-in night light effect. The light hood is hinged for easy access to the tank. Designed for "fish only" marine tanks or for freshwater low-light planted tanks. May also be used as an excellent light for refugium systems. LEDs are energy efficient and provide the most crisp, clean light available. Hinged top for easy access and feeding Energy efficient - saves money on your electric bill Adaptable for use with heaters, filters and accessories No mercury in LEDs are long lasting & better for the environment Note: these hoods are not intended for reef tanks. Daylight LEDs create a shimmering light that mimics the natural underwater effect of sunlight. Nightlight LEDs allow for nighttime enjoyment of the aquarium. 3-position switch: On, Blue, Off. The LED Aquarium Hoods fit most aquarium manufacturer's tanks on the market.Note: Use two 24 x 12 LED Hoods for 48 x 13 aquariums such as 40, 55 and 60 Gallon.


text:
Combining NASCAR's greatest heroes with the ever-popular motivational design concept...it's the amazing MotorVationals collection from The Time Factory! This spectacular 2009 entry in the series features the long-time superstar Jeff Gordon in his updated #24 Hendrick Motorsports DuPont Chevrolet Impala SS. With incredible race-day photography, a slick and modern graphic design, a great quote from the driver himself, and his official signature script, this is a must-have for any true fan. A spectacular piece for your wall, and a true inspiration for any fan of racing!
Product Specifications:


text:
Wednesday, June 06, 2001Johnson City, Tenn. -- East Tennessee State University's Andy Baxter (Erwin, Tenn.) was selected by the Cleveland Indians in the 32nd round of the 2001 Major League Baseball draft on June 6. He was the 967th overall pick. After playing his first three seasons at North Carolina State, Baxter transferred to ETSU for a stellar senior campaign. The All-Southern Conference honoree led the team and ranked second in the Southern Conference with a .394 batting average. He was one of only three Buccaneers to start all 55 games. A 6-4, 210 first baseman, Baxter set ETSU's all-time single season record in hits (87) and doubles (25) during the 2001 season. He compiled a 15-game hit streak and hit .538 (7-13) in his final three collegiate games. "I am very excited and proud of Andy," head coach Tony Skole said. "This is a great testament to his hard work and dedication to baseball. We wish him the best of luck and the entire ETSU baseball family will now be Cleveland Indian fans." Baxter will join two former Buccaneers in the minor league ranks. Right-hander Matt Baber is 1-0 after pitching six scoreless innings and striking out five in his only outing for the Canton Crocodiles. Outfielder Rusty Swackhamer is batting .308 (4-13) with a double and three runs scored after playing four games for the Chillicothe Paints. Both Canton and Chillicothe are teams in the independent Frontier League.
|Copyright ©2015 East Tennessee State Athletics. All Rights Reserved.


text:
Now we're email buddies!
You have chosen to receive our #NAMED_LISTS# newsletters at #EMAIL_ADDRESS#. You will receive an e-mail shortly confirming your subscription. So excited to have you!
Refinery 29
Please upgrade your browser for the best Refinery29 experience. Read more.
Be still, our beating hearts—we may have found the perfect men. Killer smile? Check. Good with their hands? Check. Culinary wiz? Double check! From fresh faces with international acclaim to chefs/owners/managers who do it all, this crop of cool and talented dudes span Miami's cooking crème de la crème.
And, while we don't think genius sautéing skills and a great smile need to go hand in hand, it certainly doesn't hurt. One thing is for sure: There's nothing sexier than a guy succeeding at something he loves. Click through to see 10 kitchen maestros who are whetting our appetites.
Get to know 10 rising-star chefs who are sizzling on the Miami foodie scene.


text:
South Kent classical trios
A Classical Trio can add more than a touch of sophistication to your event, it can set the entire ambiance! Weddings, corporate functions, charitable events, and more. You can easily search from those in the South Kent, CT area and book them right here on GigMasters.


text:
2013 memberships now sold out
Parents: Thank you for your interest in the Phanatic MVP Club. Information regarding 2014 memberships will be available soon. So please check back often.
Parents: Thank you for your interest in the Phanatic MVP Club. Information regarding 2014 memberships will be available soon. So please check back often.
For $12*, members receive:
Membership for the 2013 Phanatic MVP Club is from January through December 2013.
As a member, you'll also receive special information and opportunities for autographed items, Phanatic birthday boxes, a spot in a Phanatic Meet & Greet during the 2013 season, and more.
* Convenience fees apply.
Parent: If you would like to send a Phanatic MVP Club membership as a gift, that member will receive a Certificate in the mail, letting them know that they have been signed up and will receive their membership package in January (for a limited time only).
During the month of September, 25 of our lucky Phanatic MVP members were randomly selected to meet your favorite mascot - the Phillie Phanatic!
The Phanatic invited them to his home, Citizens Bank Park, and provided them with a nice breakfast and entertainment by none other than HIMSELF! That's right, the Phanatic performed his book, "Phillie Phanatic's Phantastic Journey" for the lucky club members and their guests! These lucky MVPs also took part in an exclusive behind-the-scenes ballpark tour, and got to check out the Phillies batting cages and clubhouse.
Congratulations to all the members that attended and an even bigger THANK YOU to the Phanatic for making it happen!


text:
Take Action
While it is necessary that the public become educated about the moral and legal basis for the right to freedom of expression and about current threats to its existence, it is also important that the public act to promote and defend free expression. On this page you will find a collection of different ways in which you can take action—from writing to political leaders to helping raise social awareness. In all of your communications, please remember to mention the Center for Inquiry and the Campaign for Free Expression!
Write Foreign Leaders
Sign our petition and urge the leaders of eight foreign countries where people are being imprisoned or sought for charges on free speech grounds to demand they respect the right to freedom of expression and immediately grant their freedom and protection.
You can also write to each country's Ambassador to the United States to ask that he or she convey your concerns to government officials in their home country. Below is the contact information for all of the Ambassadors who represent countries which are featured on the Cases page.
Embassy of Bangladesh
H.E. Akramul Qader
3510 International Drive, NW
Washington, D.C. 20008
Embassy of the Arab Republic of Egypt
H.E. Sameh Hassan Shoukry
3521 International Court, NW
Washington, D.C. 20008
Embassy of the Republic of Indonesian
H.E. Dr. Dino Patti Djalal
2020 Massachusetts Avenue, NW
Washington, D.C. 20036
Embassy of India
H.E. Nirupama Rao
2107 Massachusetts Avenue, NW
Washington, D.C. 20008
Embassy of Pakistan
H.E. Sherry Rehman
3517 International Court, NW
Washington, D.C. 20008
Embassy of the Russian Federation
H.E. Sergey Ivanovich Kislyak
2650 Wisconsin Avenue, NW
Washington, D.C. 20007
Saudi Arabia
Royal Embassy of Saudi Arabia
H.E. Adel A. M. Al-Jubeir
601 New Hampshire Avenue, NW
Washington, D.C. 20037
Embassy of Thailand
H.E. Vijiavat Isarabhakdi
1024 Wisconsin Avenue, NW
Washington, D.C. 20007
Press the U.S. Government
Write your elected officials and President Barack Obama's administration to let them know that many Americans care deeply about protecting the right to freedom of expression and want the U.S. government to take a strong stand for this right in the global arena.
Contact UN Officials
Contact Heiner Bielefeldt, the United Nations Special Rapporteur on Freedom of Religion or Belief—an independent expert appointed by the UN Human Rights Council who identifies existing and emerging challenges to the rights to freedom of conscience and presents ways to overcome such challenges. Write Bielefeldt and make sure he is fully aware of the troubling number of cases in which humans have been punished simply for expressing their thoughts.
Contact Bielefeldt online at email@example.com (subject line: "For Heiner Bielefeldt") or by mail at:
Office of the United Nations High Commissioner for Human Rights (OHCHR)
Palais des Nations
CH-1211 Geneva 10, Switzerland
Help Raise Awareness
Many of the stories mentioned on this website or elsewhere have not garnered local, national, or international media attention. We need to change that. How? Here are a couple of ideas:
- Post about the Campaign on Twitter with the hashtag #CFICFE.
- Share news articles, videos, and other materials regarding the Campaign on Facebook.
- Write posts about the Campaign on your blog or website.
- Pen a letter to the editor in your local newspaper.
- Organize an event in your community.
Need assistance? Email firstname.lastname@example.com.


text:
- Independent
- The Enterprise
- The Recorder
Some women in St. Mary's are feeling a little more vigilant and a little more vulnerable.
In the days following the murder last week of Moneta Jo Strickland, a 32-year-old registered nurse, whose body police found on Three Notch Trail in Laurel Grove where she frequently exercised, some women say they're watching their backs, locking their doors and thinking of ways to defend themselves.
"Everywhere I've gone in the last three days, that's been a point of conversation," said Sandy Holtzem, coordinator for the women's ministry at Lexington Park Baptist Church. They're saying, "What would I do? What would my daughter do?"
The church has offered free women's self-defense classes for years, and one is scheduled today, Friday, Aug. 16, from 6 to 8 p.m., and tomorrow from 10 a.m. to 3:30 p.m. More are lined up for 2014.
"There's scripture that talks about our bodies being a temple of the Lord," Holtzem said. "Not only the things you eat and drink and do. But also in being able to protect yourself, defend yourself and make wise decisions about what kind of situations you put yourself in."
The self-defense classes aren't religious, Holtzem explained. But, she said, "it gives you kind of a confidence. "They're real-world examples you might find yourself in," she said, thinking more about Strickland's murder. "It could happen anywhere to anybody," she said.
"Nobody ever expected that here," said Sandie Greene, registrar at the St. Mary's County Department of Recreation and Parks, which also offers several self-defense classes. The department also is willing to offer sessions specifically for women if the interest is there, Greene said. "Maybe that will make people more aware.
"We as mothers do everything for our kids," Greene said. "When there's time left, we try to do something for ourselves." That something, she said, should be a self-defense class. "Learn how to protect yourself. It's not a luxury. It's something that we need to make time for."
Greene said her daughter knew Strickland and was too emotional to go to a candlelight vigil held for her Wednesday. Violent crime can make people feel violated. And, Greene indicated, it sends her motherly instincts into high gear, making her want to protect her family, and her community.
"It's our park. It's our trail. It's our county. And she was our person," Greene said of Strickland. "How could someone do something like this?"
"I'd be interested in a self-defense class, but I don't know where they are," said a woman who at first gave her full name, and later decided that she only wanted to be identified by her first name, Brenda. She was walking with a friend, Ava, in a busy park Thursday morning.
Brenda said women should be watchful, not just in parks and on trails, but wherever they go. She said she's seen women leaving stores and checking their text messages instead of paying attention to their surroundings, or get out of their cars at gas stations and forgetting to lock their car doors.
When she exercises, Brenda said, "I never wear earplugs. It's never at night, and it's usually with a friend. There's safety in numbers."
Another woman, Rosetta, walked the same trail as Ava and Brenda, but she didn't have a friend with her.
When asked, she said she'd also be interested in a self-defense class. "I think that would help me a lot," Rosetta said.
Her exercise time is when she takes a few moments to meditate, to be to herself. "Sometimes, I pray," she said. But, she's been a bit more on edge since Strickland's murder, saying she was startled when she heard someone behind her in the same park one morning this week. She jumped, turned around and realized it was a man on a bike.
"It just gives you the chills," she said. She knew Strickland and her family and played softball with them.
"She was a very likeable person, a people's person," Rosetta said. "If you asked her to do something, she would do it."
Rosetta said, she's been thinking about it this week as she walked. "I got teary-eyed," she said.
"She was a very smart young lady, a very educated young lady," Rosetta said. "And, it makes you think: What if that was me?"
Self-defense training offered
Lexington Park Baptist Church has several women's self-defense classes planned. One is scheduled this week, Friday, Aug. 16, from 6 p.m. to 8 p.m., and on Saturday, Aug. 17, from 10 a.m. to 3:30 p.m. Registration is required, but may be done the day of the class. Call 301-862-2552, email firstname.lastname@example.com, or visit the church at 46855 South Shangri-La Drive. Classes are in the fellowship hall. Courses, offered by a certified female instructor, include ways to increase awareness, reduce and avoid risks, and basic physical defense training. More classes are scheduled for 2014.
The St. Mary's County Department of Recreation and Parks also offers self-defense training for women, men and for children. Registration opens Aug. 26.
A Shotokan karate class is planned for Tuesdays and Thursdays from 6 to 7 p.m., at Lexington Park Elementary School. Fees are $60 for the 10-week course, Sept. 17 to Dec. 5.
Recreation and park also has scheduled a Shorin Ryu self-defense class Thursdays from 6 to 7 p.m., at the Leonardtown Middle School recreation center annex, Sept. 26 to Dec. 5. Fee $45.
Call the parks department at 301-475-4200, ext. 1800, or visit www.stmarysmd.com/recreate.


text:
One Direction Tickets
Zac Brown Brand
Justin Bieber
Kevin Hart Tickets
Pink Tickets
Carrie Underwood
The Book of Mormon
Billy Elliot
Mamma Mia
Jersey Boys
The Lion King
New York Knicks
Miami Heat
Boston Celtics
Brooklyn Nets
Houston Rockets
Sorry! There do not appear to be any upcoming New York Islanders events at present. If New York Islanders tickets have recently gone onto general sale, then it may take a few days for tickets to appear here. Please either try again tomorrow or use the search box in the menu bar above to find other great events near you!
Even though Canada is the Hockey capital of the world, within the United States there is a National Hockey League team that begs to differ! The New York Islanders hockey team has been scoring goals and winning conference titles ever since they initially debuted back in 1972, and the legend is still growing. This incredible team has already won a total of four consecutive Stanley Cup championships, not to mention all of the times the New York Islanders hockey team has shown up in the post season finals. As one of the prized positions of the Atlantic Division, Eastern Conference, the New York Islanders team is going to prove, once again, who the real masters of the ice are during the upcoming season!
The New York Islanders always put on an exciting show! Hockey is an enjoyable live sport for all sports fans! You'll love the scoring, the hard hits, the precision passes and maybe even a few fights on the ice! Get your New York Islander Tickets now! This team awaits your support and will do their best to make your ticket worthwhile! Order now!
Concerts | Artists A-C | Artists D-G | Artists H-K | Artists L-O | Artists P-S | Artists T-Z
Sports | NBA | MLB | NFL | NHL | NCAA Football | NCAA Basketball | NASCAR | Motorsports | Golf | MLS Soccer | Arena Football | WNBA
Theater | Broadway | Cirque Du Soleil | Classical Music | Family Shows
Tickets | Affiliates | Contests | Applications | Terms & Conditions | Privacy Policy | About | Contact Us


text:
We offer one of the largest selections of high quality Stand Up Paddle Boards to accommodate riders of all sizes and skill levels. All our SUP's are built with Epoxy Construction so no matter what model you choose you will be getting a light, strong and performance oriented board with all the latest features built in at an incredible value.
Paddle boarding is one of the fastest growing sports in the world for good reason; it's fun, great exercise and any one can do it in any body of water. So whether you are a seasoned paddler, surfer or a beginner looking to get into the sport, we have the model for you.
Knowing the volume of your sup is important in that it relates to your weight and what amount of volume is required to support your weight.
The metric system tells us: 1 liter of volume will float 1kg of weight.
However the amount of volume needed is relative to weight & skills. Thus we multiply a Skill Level Factor x our Weight in kilograms to get a recommended Volume in liters.
Skill Level Factor for Beginner = 2.0
Skill Level Factor for Intermediate = 1.7
Skill Level Factor for advanced = 1.3
Use this simple formula to find your target volume
(your weight in lbs x .44) x Skill Level Factor = Target Volume (Liters)
Example: You are a beginner looking at boards and you weight 195lbs. What volume is right for you?
(195lbs x .44) x 2 = 175
Board Volume (Liters) = 175
If you are a beginner rider and you weigh 195lbs. Your board should have a volume of at least 175 Liters to support your weight.
Suggested Weight
We use the boards volume to compute how much weight each board can support for a given skill level.
These are general suggestions and other factors such a width and thickness determine how the board
will support your weight.
As an example:
The 9'6 Classic has 127 liters of volume.
The suggested weight chart shows:
As a beginner your weight should not exceed 141 lbs
As an intermediate rider your weight should not exceed 166 lbs
As an advanced rider your weight should not exceed 217 lbs


text:
Wanted to share some pics from our nominal Sunday cooking experience, I cooked three briskets and a venison ham while SIL Brent cooked up 50# sack of mud bugs. I included a pic or two of some of the folks suckin da haids.
You piping hands will notice the cooker is made from SS RTJ rings, is a no regulator sys. flow is controlled via a needle valve. This honey was a creation of one of his "oil field trash friends", LMAO
Results 1 to 1 of 1
Thread: Mud Bug Cooker
03-28-2006, 07:17 AM #1Senior Member
- Join Date
- Sep 2005
- Location
- Texas
- Posts
- 279
Mud Bug Cooker


text:
Get a Breezy, Island-Inspired Bath
Create your own little bathroom paradise with decorator touches inspired by the islands.
Stories We're Following
Get Social With Us
We love to DIY. You love to DIY. Let's get together.More DIY Social
Discover Made + Remade
See the latest DIY projects, catch up on trends and meet more cool people who love to create.Make It. Fix It. Learn It. Find It.
Most Popular for Summer
- Seasonal Gardening Planner
- Tips for Summer Yard Maintenance
- Tips for Watering Lawn in Summer
- Plants That Bloom in Summer
- Foolproof Color for the Summer Garden


text:
ZAND Glucosamine contains all the essential building blocks that make up joint cartilage including Glucosamine, Chondroitin and MSM, all naturally occurring substances found in joint cartilage. This full strength formula delivers 1500mg of Glucosamine - perfect for daily joint support. Zand liquid Glucosamine is available in a great tasting berry flavor and makes taking oversize pills a thing of the past.*
Directions for Use: Shake Well. For adults and children ages 12 and older. As a dietary supplement, take 2 tablespoons (30 ml) daily. May be taken directly or mixed in water or juice.
Other Directions: This product is made with natural ingredients that can darken over time; product quality, potency and purity is not affected. Product may be stored at room temperature or refrigerated after opening for added freshness. Contains shellfish derived materials individuals allergic to shellfish use with caution.
* Daily value not establishedThese statements have not been evaluated by the FDA. These products are not intended to diagnose, treat, cure, or prevent any disease.
Other IngredientsPurified Water, Fructose, Glycerin, Natural Cherry Flavor, Natural Mixed Berry Flavor, Natural Raspberry Flavor, Natural Vanilla Extract, Citric Acid, Sodium Benzoate, Xanathan Gum, Caramel Color. Contains no yeast, wheat, soy, dairy or starch.
Pharmaca Integrative Pharmacy is your source for natural health products. Browse our online selection of products from all of the best natural brands, or visit one of our pharmacy locations and talk with one of our licensed practitioners. From natural beauty products and cosmetics to vitamins, herbs and supplements, we offer high-quality natural wellness products for the whole family! Start exploring—shop by brand or by condition to find the perfect natural health products for your body, skin, home and more.
The products and claims made about specific products on this site have not been evaluated by Pharmaca.com or the United States Food and Drug Administration and are not approved to diagnose, treat, cure or prevent disease. The information on this site is for educational purposes only and is not intended as a substitute for advice from your physician or other health care professional or any information contained on or in any product label or packaging. You should not use the information on this site for diagnosis or treatment of any health problem or for prescription of any medication or other treatment. You should consult with a healthcare professional before starting any diet, exercise or supplementation program, before taking any medication, or if you have or suspect you might have a health problem. Pharmaca Integrative Pharmacy will not assume liability for any cross-contamination of ingredients, misprints, or adverse reactions to any ingredients in the products we carry. The products sold here may contain lead and other substances that are known to the state of California to cause cancer and birth defects and other reproductive harm. Prices and promotions are subject to change without notice. All content on this web site is copyrighted by Pharmaca Integrative Pharmacy unless otherwise stated. All online offers and prices are valid for online purchases only, and may be different from those in our retail stores. Free shipping offer may not apply to all orders and all states; see shipping policy for full details. Copyright © 2009 – 2015 by Pharmaca Integrative Pharmacy. All rights reserved.


text:
Burberry Makeup
Refine Your Selection
- Your Selections:
Burberry (Designer)
Burberry (Brand)
by Burberry
Sheer Luminous Concealer - # No. 04 Sandy Beige --2.5ml/0.08oz
for women
1 type availableOn sale now
by Burberry
Sheer Foundation Luminous Compact Foundation - Trench No. 09 --8g/0.28oz
for women
1 type availableOn sale now
Reviews (185)
1 - 5 (of 185 Reviews)
I absolutely love this scent. I ordered it as a tester and it is original without the box and the heavy price tag. couldn't be happier.
Written by Agi D on October 24, 2014Read Review details ►
I absolutely love this scent. It is just about my most favorite scent because not only does it last but it's also very light so that it can be worn anywhere and at anytime. It's very pleasant and not at all overbearing. It's a mature scent but also has the feeling of making you feel airy!
Written by Jona on September 08, 2014Read Review details ►
I love Burberry. I ordered it from here . I had no idea what it smelled like until I got it. Its a fall/wintery smell. its very soft and u don't have to spray a lot for u or other ppl to smell it. I wore it today at work and I had a lot of women and men compliment me and ask what I was wearing. Not my favorite nor a signature smell but I still love it.
Written by Bri/19/Mississippi on July 24, 2014Read Review details ►
I love this fragrance, the other Burberry Scents were to overwhelming for me so the original will always be my "Signature Scent" so it will always get a 5
Written by Kischa on July 23, 2014Read Review details ►
Bought this for my daughter she loves it plus they sent her samples of other perfume we love this site !!
Written by Barb on May 01, 2014Read Review details ►
1 - 5 (of 185 Reviews)


text:
An amazing sweet and tangy restaurant-quality dish impressive enough for entertaining.
Buy this ingredient
1. Preheat oil in a nonstick skillet over medium-high heat.
2. Sauté onions 3-5 minutes. Season chicken with thyme, salt and pepper
3. Add chicken and cook 6-8 minutes on each side or until cooked through.
4. Reduce heat and stir in preserves and vinegar, stirring until preserves melt.
5. Serve raspberry sauce over chicken
Next Service Date is determined at checkout.
Earn 5% back from every online purchase. On this order you could earn
0 points / $0.00
FREE Sign Up
About Us
Customer Service
Connect with Us!
© 2015 Schwan's Home Service, Inc. | Copyright Policy | Privacy Policy | Security Practices
Script section containing code for Liveperson Chat Solution


text:
Apple Pumpkin Muffins Recipe
4.5 29
The combination of apples and pumpkin makes this recipe a perfect treat for cool autumn day. The muffins are great for breakfast or dessert. —Beth Knapp, Littleton, New Hampshire
- 2-1/2 cups all-purpose flour
- 2 cups sugar
- 1 teaspoon baking soda
- 1 teaspoon ground cinnamon
- 1/2 teaspoon ground ginger
- 1/2 teaspoon salt
- 1/4 teaspoon ground nutmeg
- 2 eggs
- 1 cup canned pumpkin
- 1/2 cup vegetable oil
- 2 cups finely chopped peeled tart apples
- In a large bowl, combine the first seven ingredients. In a small bowl, combine eggs, pumpkin and oil; stir into dry ingredients just until moistened. Fold in apples. Fill greased or paper-lined muffin cups two-thirds full. Bake at 350° for 30-35 minutes or until muffins test done. Cool for 10 minutes before removing from pan. Yield: 1-1/2 dozen.
Originally published as Apple Pumpkin Muffins in Country August/September 1998, p51
Reviews for Apple Pumpkin Muffins
Please Log In or Join to add a rating and review.
Click stars to rate
Any changes to your rating or review will appear where you originally posted your review
Sort By :
Reviewed Sep. 17, 2014
"its ok..."
Reviewed Sep. 11, 2014
"Delicious....and leaves the house smelling yummy too! Will make again FOR SURE"
Reviewed Sep. 8, 2014
"I am sure it was the elevation here in Colorado (I made as directed, w/o adding additional flour for altitude), but these muffins did not come out moist. In fact, sort of dry. :( Love the idea of pumpkin and apple though-fantastic combo for autumn, and the spices are just the right amount. Recipe made enough for 2 dozen regular size muffins too, which was fantastic."
Reviewed Jan. 4, 2014
"These are great!! I baked them in x-large muffin pans and a mini muffin pan."
Reviewed Sep. 21, 2013
"moist and delicious!"