text:
US7725715B2 - System and method for three-phase data encryption - Google Patents
System and method for three-phase data encryption Download PDF
US7725715B2 US11/064,912 US6491205A US7725715B2 US 7725715 B2 US7725715 B2 US 7725715B2 US 6491205 A US6491205 A US 6491205A US 7725715 B2 US7725715 B2 US 7725715B2
Nima Veiseh
David W. Baarman
Thomas Jay Leppien
2005-02-24 Application filed by Access Business Group International LLC filed Critical Access Business Group International LLC
2005-05-09 Assigned to ACCESS BUSINESS GROUP INTERNATIONAL LLC reassignment ACCESS BUSINESS GROUP INTERNATIONAL LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BAARMAN, DAVID W., LEPPEIN, THOMAS J., VEISEH, NIMA
2006-01-19 Assigned to ACCESS BUSINESS GROUP INTERNATIONAL LLC reassignment ACCESS BUSINESS GROUP INTERNATIONAL LLC CORRECTIVE ASSIGNMENT TO CORRECT ASSIGNOR'S NAME ON A DOCUMENT PREVIOUSLY RECORDED AT REEL 016518 FRAME 0225 Assignors: BAARMAN, DAVID W., LEPPIEN, THOMAS JAY, VEISEH, NIMA
238000006243 chemical reaction Methods 0 claims description 18
238000004891 communication Methods 0 claims description 7
239000000047 products Substances 0 claims description 5
230000001010 compromised Effects 0 description 2
230000004224 protection Effects 0 description 1
G06Q20/00—Payment architectures, schemes or protocols
G06Q20/08—Payment architectures
G06Q20/20—Point-of-sale [POS] network systems
H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
H04L9/302—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
The present invention is directed to a three-phase encryption method and a three-phase decryption method, and an apparatus implementing the three-phase encryption method and/or the three-phase decryption method. To encrypt a message according to the three-phase encryption method, a content of a message is converted from a first form M to a second form M′; the content of the message is separated according to a spacing pattern; and the content of the message is scrambled according to a scrambling pattern. To decrypt the message encrypted using the three-phase encryption method, the scrambling and spacing patterns are reversed, and the content of the message is converted from the second form M′ to the first form M.
With the proliferation of communications networks, and in particular, communications networks implemented in whole or in part over wireless media, data security has become increasingly important. Wireless networking technologies are relatively new compared to wired networking technologies. As such, current techniques for securing wireless networks have been derived from the techniques developed for and used in wired networks. For example, one technique for securing a network, whether wired or wireless, is to encrypt the communications. This inhibits comprehension of the communications by an unauthorized party should the network be compromised. Current encryption techniques are satisfactory for direct wired network paths, which include no intermediate wireless portions. To compromise encrypted transmission, an attacker typically needs to listen to multiple transactions in order to break the encryption algorithm. For example, in order for an outside party to gain access to a transaction over direct cable connections, the outside party may gain access to the wire or to a server coupled therewith and closely monitor data streams until the outside party can determine when one transaction has been received or transmitted by the server. Alternatively, the outside party may try to access the data contained on the server, such as any secure databases stored thereon. Once accessed, and enough data is gathered, the attacker may be able decrypt the data. Techniques are known for protecting data stored on a server and the relative inaccessibility of the wired media makes accessing and intercepting wired communication inherently difficult. However, when transmitting communications wirelessly, the wireless signals carrying the communications are often broadcast omni-directionally, thereby making them accessible to anyone within range who cares to listen. Accordingly, techniques implemented to protect a transaction at the server, or over the communications media, from attacks, do little to protect transactions traveling at least partially over wireless networks, where the data cannot be protected by the server and the wireless signal cannot be securely constrained. When a transaction travels at least partially over wireless networks, anyone may attempt to intercept the data stream. This increases the probability that a given encryption algorithm will be compromised by an attacker.
In any transaction using wireless networks, one of the main concerns is the ability of an outside party to intercept a transaction and decrypt the transaction, where it has been encrypted for protection, to obtain personal and/or secure information such as credit card numbers, bank account numbers, and social security numbers. Therefore, it is desirable to protect wireless transactions to prohibit an outside party from intercepting and decrypting transactions.
FIG. 1 is a flow chart of a three-phase encryption and decryption technique in accordance with one embodiment of the invention;
FIG. 2 is a flow chart of one embodiment of a conversion phase of the three-phase encryption technique;
FIG. 3 a is a flow chart of one embodiment of a separating phase of the three-phase encryption technique;
FIG. 3 b is a flow chart of a scrambilization phase of the embodiment of the three-phase encryption technique of FIG. 3 a;
FIG. 4 a is a flow chart of another embodiment of a separating phase of the three-phase encryption technique;
FIG. 5 is a flow chart of a three-phase decryption technique of the embodiment of the three-phase encryption technique of FIGS. 3 a and 3 b;
FIG. 7 is a block diagram of one embodiment of an encryption module and one embodiment of a decryption module;
FIG. 8 a is a flowchart of an example of an embodiment of a three-phase encryption technique;
FIG. 8 b is a flowchart of an example of a three-phase decryption technique of the embodiment of FIG. 8 a; and
FIG. 9 is a flowchart of an example of an embodiment of a three-phase encryption technique with an additional fourth phase.
DETAILED DESCRIPTION OF THE DRAWINGS
FIG. 1 is a flow chart 100 depicting one embodiment of a three-phase encryption technique and one embodiment of a three-phase decryption technique. It will be appreciated that any single device may implement either the three-phase encryption technique, the three-phase decryption technique, or combinations thereof.
Generally, the disclosed three-phase encryption and decryption techniques may be used to protect communications taking part at least partially over a wireless network. However, one of skill in the art would appreciate that the disclosed three-phase encryption and decryption techniques may be used for communications over a hardwired medium or any other type of communications medium.
The three-phase encryption technique is generally used by a transmitting device to encrypt a message before the transmitting device transmits the message to a receiving device. The transmitting device encrypts the message to prevent an outside party from easily intercepting a message traveling over a communications medium to the receiving device and gaining access to personal and/or secure information such as credit card numbers, bank account numbers, and social security number.
The three-phase decryption technique is generally used by the receiving device to decrypt the message after the receiving device receives the message from the transmitting device. The receiving device decrypts the message to gain access to the personal and/or secure information such as credit card numbers, bank account numbers, and social security number that the three-phase encryption technique protects.
In one embodiment, a sending/transmitting device, having an encryption capability encrypts a message using the disclosed three-phase encryption technique 102 and sends the message to a receiving device 110. It will be appreciated that such communications may be bi-directional and that various devices may be capable of both sending and receiving. Accordingly, the designation of sending device or receiving device used herein are contextually applied, and a sending device for one communication may be a receiving device for another communications, etc. The sending device may include a personal computer; a personal digital assistant; a server; a workstation; an appliance, e.g. smart appliance, such as a washer/dryer, refrigerator, water treatment system, or stove operative to send or receive data over a network; or any other type of network enabled device known in the art, or combinations thereof, including non-network enabled devices retrofitted or otherwise adapted to be network enabled. The receiving device receives the message 111 and decrypts the encrypted message using the disclosed three-phase decryption technique 112. Like the encrypting device, the receiving device may include a personal computer; a personal digital assistant; a server; a workstation; an appliance, e.g. smart appliance, such as a washer/dryer, refrigerator, water treatment system or stove operative to send or receive data over a network; or any other type of network enabled device known in the art, or combinations thereof, including non-network enabled devices retrofitted or otherwise adapted to be network enabled.
The wireless protocol used to send the encrypted message 110 from the encrypting device to the receiving device may include wireless fidelity ("Wi-Fi") compatible with the IEEE 802.11 standard set, such as 802.11(a), 802.11(b) or 802.11(g); general packet radio service ("GPRS"); Bluetooth, satellite or cellular transmissions; ultra wideband; WiMax; or any other type of wireless protocol using RF, light or other transmission medium, and may further include combinations of different wireless technologies over various portions of the network.
In operation of the three-phase encryption technique 102 on a message to be transmitted over the network, the content of the message is converted from a first form M to a second form M′ 104, typically using prime-factorization, to hide the original content of the message during transmission.
The content of the message is then separated 106, typically into a plurality of distinct packets or a plurality of groupings, as described in detail below, to de-homogenize the intervals at which the content of the message is transmitted, thereby increasing the difficulty for a third party to listen to a transmission and decipher the message content.
In one embodiment, to separate the content of the message, the content of the message may be broken up so that a portion of the content of the message is spread throughout a plurality of distinct packets that are separated by a given amount of time when transmitted. In another embodiment, to separate the content of the message, excess characters, such as spaces, are inserted throughout the content of the message to distribute the content of the message into a plurality of groupings.
Finally, the plurality of distinct packets, or the plurality of groupings, containing the content of the message are scrambled according to a user-defined pattern 108, examples of which are described in detail below.
To decrypt a message that has been encrypted using the above described three-phase encryption technique 102, the three-phase encryption technique 102 is simply reversed 112. Typically, for increased security, the receiving device will know the necessary algorithms and variables for decrypting a message that has been encrypted using the disclosed three-phase encryption technique 102. However, in other embodiments the necessary algorithms and variables for decrypting a message may be passed to the receiving device at the cost of decreased security.
Initially, the content of the message within the plurality of distinct pulses or the plurality of groupings is descrambled 114 by reversing the user-defined pattern. Next, the plurality of packets that comprise the content of the message are reformed back into a single message, or the excess characters between the plurality of groupings are removed 116, depending upon the method that was used to break up the original message. Typically, the method used to break up the original message is indicated at the head of a message in the form of a one or two digit number. Finally, the content of the message is converted from the second form M′ into the first form M 118.
FIG. 2 is a flow chart depicting one embodiment of the conversion phase 200 of the three-phase encryption technique. Typically, before the content of the message is encrypted, the alphabetical syntax of the content of the message is converted to a numerical representation 202. For example, the letter "a" may be converted to be represented numerically as 01, the letter "b" may be converted to be represented numerically as 02, and so on. The alphabetic conversions may comply with the American Standard Code for Information Interchange ("ASCII") or the Extended Binary Code Decimal Interchange Code ("EBCDIC") standards, or may be an arbitrary conversion. A function for converting alphabetical syntax into numerical representation is well known and most programming languages include a standard function to perform this type of operation.
To convert the content of the message from a first form M to a second form M′, the encryption component and the decryption component of the sending device and/or receiving device are programmed with a first secret prime number P, a second secret prime number Q, a known encryption key E, and a secret encryption key D. Additionally, the product of the first and second secret prime numbers is defined to be N.
For added security, the known encryption key should be relatively prime 206 to the first and second secret prime numbers P, Q such that:
GCD (E,(P−1)*(Q−1))=1
wherein GCD is the greatest common divisor or factor. As is well known, two or more integers are defined to be relatively prime if they share no common positive factors (divisors) except the number 1.
The secret decryption key D is typically not openly known. The secret decryption key D is used to decode any message received by the receiving device. After choosing the first secret prime number P, the second secret prime number Q, and the known encryption key E, the secret encryption key D may be calculated using the formula:
D*E=1*mod((P−1)*(Q−1)).
Using the product N of the first secret prime number P and the second secret prime number Q, and the known encryption key E, the content of the message is converted 208 from a first form M to a second form M′ according to the formula:
M′=MEmod N.
Note that for the conversion 208 from the first form M to the second form M′ to work correctly, the numerical value of N must be greater than the numerical value of the content of the message in the first form M.
FIGS. 3 a and 4 a are flow charts for the separating phase of the three-phase encryption technique. Typically the content of the message is separated after the conversion phase, but in other embodiments, the content of the message could be separated before the conversion phase.
In one embodiment shown in FIG. 3 a, to separate the content of the message, the content of the message is broken up 300 so that the content of the message is spread throughout a plurality of distinct packets 304. Typically, to determine a spacing pattern for the plurality of distinct packets, a third secret prime number R and a second known encryption key K are chosen. The value of the openly known encryption key K may be any modulus such as 10, the value of the secret encryption key D, or any other recommended value.
In one embodiment, the spacing pattern may be a number of characters that the encrypting device waits between the plurality of distinct packets. However, in other embodiments, a user may choose to have the value of the spacing pattern correspond to other meanings with respect to the spacing between the plurality of distinct packets. The spacing pattern is typically calculated 302 according to the formula:
F(R)=R*mod(K).
In some embodiments, the spacing pattern may alternate between "R mod K" and "K−R mod K," or any other formula chosen by a user.
In another embodiment shown in FIG. 4 a, to separate the content of the message 400, the content of the message is spaced so that excess characters are inserted throughout the content of the message 404 to distribute the content of the message into a plurality of groupings. The excess characters may be spaces or any other type of characters desired by the user. The spacing pattern for the number of excess characters may be determined according to the same process described above for determining the spacing pattern in the embodiment of FIG. 3 a. Typically, a third secret prime number R and a second known encryption key K are chosen. The value of the second known encryption key K may be any modulus such as 10, the value of the secret encryption key D, or any other recommended value. The spacing pattern may be calculated 402 according to the formula:
Typically, after the spacing phase 300, 400, the sections of the content of the message remaining are scrambled 306, 406. However, in other embodiments, the order of the three-phase encryption technique may be changed such that the content of the message is scrambled 306, 406 before the spacing phase 300, 400 or the conversion phase 200.
FIG. 3 b is a flow chart for the scrambling phase 306 of the three-phase data encryption method of the embodiment of FIG. 3 a. Typically, a fourth prime number S and a secret modulus J are chosen. The value of the secret modulus J may be any integer such as 10, one of the secret encryption keys, or a set of secret whole numbers. The fourth prime number S and the secret modulus J are used to calculate 308 a scrambilization pattern according to the formula:
G(S)=S*mod(J).
In one embodiment, the scrambilization pattern may represent which of the plurality of distinct packets will be scrambled according to a predefined method. For example, if the scrambilization pattern were to equal the number 2, this may represent a scrambling action taking place on every other distinct packet. The scrambling action may include reversing two numerical characters, adding a constant to a numerical message value, or any other function desired by a user 310.
FIG. 4 b is a flow chart for the scrambling phase 406 of the embodiment of FIG. 4 a. As described above for the embodiment of FIGS. 3 a and 3 b, a fourth prime number S and a secret modulus J are chosen. The prime number S and secret modulus J are used to calculate 408 a scrambilization pattern according to the formula:
FIG. 5 is a flowchart of the decryption 500 of an encrypted message created according to the embodiment of FIGS. 3 a and 3 b. After the encrypting device has processed the message through the three-phase encryption technique, the encrypted message may be sent to a receiving device 502. Once received, the receiving device reverses the three-phase encryption technique to decrypt the encrypted message.
Typically, the content of the message within the plurality of distinct packets is descrambled 504 by simply reversing the process described in FIG. 3 b above. Typically, the receiving device will know the secret modulus J and the fourth prime number S to be able to calculate the scrambilization pattern and parse through the encrypted content of the message to reverse the scrambilization 504.
After the descrambling phase 504, the plurality of distinct packets that comprise the message are reformed backing into a single message 506. Typically, the receiving device will know the third secret prime number R and the second known encryption key K so that the receiving device may calculate the spacing pattern and parse through the message to reverse the process described in FIG. 3 a above 506.
After the plurality of distinct packets is reformed into a single message 506, the content of the message is converted from the second form M′ to the first form M 510. Typically, the receiving device will know the openly known encryption Key E and the first and second secret prime numbers P, Q. Using E, P, and Q, the receiving device calculates 508 the secret decryption key D using the formula:
The receiving device then converts 510 the content of the message from the second form M′ to the first form M according to the formula:
M=(M′)D*mod(P*Q).
FIG. 6 is a flowchart of the decryption 600 of an encrypted message received from an encrypting device 602 in accordance with the embodiment of FIGS. 4 a and 4 b. Typically, the content of the message distributed by excess characters is descrambled 604 by simply reversing the process described in FIG. 4 b above. Typically, the receiving device will know the secret modulus J and the fourth prime number S to be able to calculate the scrambling pattern and parse through the message to reverse the scrambling process.
After the descrambilization phase 604, the plurality of distinct packets that comprise the message are reformed 606 back into a single message. Typically, the receiving device will know the prime number R and the second known encryption key K to be able to calculate the spacing pattern and parse through the message to reverse the separating process described in FIG. 4 a above.
After the plurality of distinct packets is reformed 606 into a single message, the content of the message is converted 610 from the second form M′ to the first form M. Typically, the receiving device will know the known encryption key E, the first secret prime number P, and the second secret prime number Q. Using E, P, and Q, the receiving device calculates 608 the secret decryption key D using the formula:
The receiving device then converts 610 the content of the message from the second form M′ into the first form M according to the formula:
M=(M)D*mod(P*Q).
As with the order of the phases in the encryption process, the order of the phases in the decryption process may be reversed in other embodiments.
FIG. 7 is a block diagram showing one embodiment of an encryption module 702 for encrypting a message using the three-phase encryption technique and one embodiment of a decryption module 704 for decrypting a message using a three-phase decryption technique. The encryption and decryption modules 702, 704 may be any type of hardware or software capable of performing the three-phase encryption and decryption techniques. A single device may comprise both the encryption and decryption modules 702, 704 so that the single device is capable of bi-directional communication, or the single device may comprise either the encryption or decryption module 702, 704 so that the single device is capable of communication in only one direction.
The encryption module 702 typically includes an encryption processor 706, an encryption memory 708 coupled with the encryption processor 706, and an encryption network interface 710 coupled with the encryption processor 706, encryption memory 708, and a communications network 712. Herein, the phrase "coupled with" is defined to mean directly connected to or indirectly connected through one or more intermediate components. Such intermediate components may include both hardware and software based components.
The encryption processor 706 may be a standard Pentium processor, an Intel embedded processor, a custom processor; or any other type of processor hardwired, or capable of running software programs, to execute the functions described above of converting the content of a message from a first form M to a second form M′, separating the content of the message according to a spacing pattern, and scrambling the content of the message according to the scrambilization pattern. Typically, these functions will be implemented as logic in software programs, stored in the encryption memory 708, and executable by the encryption processor 706.
The encryption memory 708 may be any type of memory such as ROM or flash memory, or may be any type of permanent or removable disk or drive. The encryption network interface 710 may be any type of network interface capable of communications over a wireless network, a hardwired communication network, or any other type of communications medium.
Similarly, the decryption module 704 also typically includes a decryption processor 714, a decryption memory 716 coupled with the decryption processor 714, and a decryption network interface 718 coupled with the decryption processor 714, decryption memory 716, and the communications network 712.
The decryption processor 714 may be a standard Pentium processor, an Intel embedded processor, a custom processor; or any other type of processor hardwired, or capable of running software programs, to execute the functions described above of descrambling the content of a message according to the scrambling pattern, unifying the separated content of the message according to a spacing pattern, and converting the content of the message form the second form M′ to the first form M. Typically, these functions will be implemented as logic in software programs, stored in the decryption memory 716, and executable by the decryption processor 714. The decryption memory 716 may be any type of memory such as ROM or flash memory, or may be any type of permanent or removable disk or drive.
The decryption memory 716 may be any type of memory such as ROM or flash memory, or may be any type of permanent or removable disk or drive. The decryption network interface 718 may be any type of network interface capable of communications over a wireless network, a hardwired communication network, or any other type of communications medium.
FIGS. 8 a and 8 b are flowcharts showing an example of a message encrypted (FIG. 8 a) and then decrypted (FIG. 8 b) using one embodiment of a three-phase data encryption method. As seen in FIG. 8 a, the message in the first form M is defined to have a value of 23 802. Further, the first secret prime number is defined to have a value of 5, the second secret prime number is defined to have a value of 7, and the known encryption key E is defined to have a value of 29. As explained above, the value of the first and second secret prime numbers are prime and the known encryption key E is relatively prime to the first and second secret prime numbers. Furthermore, the product of the first and second prime number is calculated to be 35, meeting the requirement that the product of the first and second prime numbers be greater than the value of the message in the first form M.
The message is converted 804 from the first form M to the second form M′ as described above, according to the formula:
M′=M E*mod(P*Q)
M′=(23)29*mod(35).
When the conversion phase 804 is performed, the message value in the first form M of 23 is calculated to have a value of 18 in the second form M′.
After the conversion phase 804, the spacing phase 806 is performed. In the example, the third secret prime is defined as 31 and the second known encryption key is defined as 10. A spacing pattern is calculated 806 as described above according to the formula:
F(R)=R*mod(K)
F(31)=31*mod(10),
resulting in a value of 1. In the example, the value of 1 is defined to be a single space, "00".
In the embodiment where the message is separated into distinct packets 808, a value of 1 results in the message separated from "18" to a value of "1——8" with a single space between the distinct packets. Alternatively, in the embodiment where excess spaces are placed between the plurality of groups to distribute the message 810, the message is separated from "18" to a value of "1008" with two excess characters, defined to be a space, between the plurality of groupings.
After the spacing phase 806, the scrambilization pattern is calculated 812. In the example, the fourth prime number is defined to be 17 and the secret modulus is defined to be 15. A scrambilization pattern is calculated according to the formula:
G(S)=S*mod(J)
G(17)=17*mod(15),
resulting in a value of 2. In the example, the value of 2 is defined to mean that every other packet or grouping is scrambled.
In the example, when a grouping or packet is scrambled, it has been defined to mean a constant of 10 is added to the numerical value and the two numerical characters are reversed. In the embodiment where the message is separated into distinct packets 808, the message of "1——8" is first changed to "1——18" and then to "1——81". Therefore, the message value of 23 has an encrypted value of "1——81".
In the embodiment where excess spaces are placed between the groups to distribute the message 810, the message of "1008" is first changed to "10018" and then to "10081". Therefore, the message value of 23 has an encrypted value of 10081.
The encrypting device may then send the encrypted value of 10081 to the receiving device 814. Referring to FIG. 8 b, the receiving device receives this encrypted message 818 and may first descramble the content of the message 820. The receiving device must know that each grouping or packet that is scrambled must have the two numerical characters reversed and an added value of 10 to the original message. Additionally, the receiving device must know the fourth prime number is defined to be 17 and the secret modulus is defined to be 15 so that the receiving device can correctly calculate that the value of the scrambling pattern is 2 as described above.
In the embodiment where the message is separated into distinct packets 822, the message of "1——81" is first changed to "1——18" and then to "1——8" 820. In the embodiment where excess spaces are placed between the plurality of groups to distribute the message 824, the message of "10081" is first changed to "10018" and then to "1008" 820.
After the descrambling phase 820, the receiving device places the message back into a unified message 826. The receiving device must know that the third secret prime is defined as 31 and the openly known modulus is defined as 10 so that the receiving device may correctly calculate a spacing pattern of 1 and know than one space, or "00," has been inserted between the groupings or packets of the content of the message.
In the embodiment where the message is separated into distinct packets 822, the message of "1——8" is changed to "18". Further, in the embodiment where excess spaces are placed between the plurality of groups to distribute the message 824, the message of "1008" is changed to "18".
Finally, the receiving device performs the conversion phase 830 to convert the content of the message form the second form M′ back into the first form M. The receiving device must know that the first secret prime number is defined to have a value of 5, the second secret prime number is defined to have a value of 7, and the known encryption key E is defined to have a value of 29. Using these values, the receiving device calculates 828 the secret decryption key D as described above according to the formula:
D*E=1*mod((P−1)*(Q−1))
D*29=1*mod(4*6),
resulting in a value of 5. Using the secret decryption key D, the receiving device converts 830 the message in the second form M′ to the first form M according to the formula:
M=(M′)D*mod(P*Q)
M=(18)5*mod(7*5).
The above formula results 830 in a value of the message in the first form M of 23, the same as the value of the message in the first form before the three-phase encryption process is performed.
Devices implementing the three-phase encryption technique or the three-phase decryption technique may also integrate additional phases into the three-phase encryption technique or the three-phase decryption technique. For example as seen in FIG. 9, in one embodiment, a device implementing the three-phase decryption technique of FIG. 8 a may perform a fourth phase 916 of scrambling the order of the plurality of packets or the plurality of groupings. Thus, any additional phase may be added to the three-phase encryption technique or the three-phase decryption technique so long as the new phase does not distort the data to an extent that the new phase cannot be accurately reversed.
It is therefore intended that the foregoing detailed description be regarded as illustrative rather than limiting, and that it be understood that it is the following claims, including all equivalents, that are intended to define the spirit and scope of this invention.
1. A computer-implemented method for encrypting a message comprising:
converting, with a processor, a content of the message from a first form M to a second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q;
after converting the content of the message to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q, separating, with a processor, the converted content of the message to further encrypt the content of the message according to a spacing pattern; and
after converting the content of the message to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q, scrambling, with a processor, the converted content of the message to further encrypt the content of the message according to a scrambling pattern.
converting the content of the message from alphabetical syntax into numerical representation.
3. The computer-implemented method of claim 2, wherein the content of the message is converted from alphabetical syntax into numerical representation using a hash function.
4. The computer-implemented method of claim 1, wherein the known encryption key is relatively prime to the first secret prime number and the second secret prime number.
5. The computer-implemented method of claim 4, wherein the content of the message is converted from the first form M to a second form M′ according to the formula:
M′=M E mod(P*Q).
6. The computer-implemented method of claim 1, wherein the spacing pattern for separating the content of the message is a function of a third secret prime number R and a modulus K, according to the formula:
7. The computer-implemented method of claim 6, wherein the phase of separating the content of the message according to a spacing pattern comprises: pulsing the content of the message into a plurality of distinct packets.
8. The computer-implemented method of claim 6, wherein the phase of separating the content of the message according to a spacing pattern comprises: inserting excess characters into the content of the message to distribute the content of the message into a plurality of groupings.
9. The computer-implemented method of claim 8 wherein the excess characters are spaces.
10. The computer-implemented method of claim 1 wherein the scrambling pattern is a function of a secrete modulus J and a fourth secret prime number S, according to the formula:
11. The computer-implemented method of claim 1, further comprising:
after converting the content of the message, separating the content of the message, and scrambling the content of the message, sending an encrypted message to a receiving device.
12. The computer-implemented method of claim 11, further comprising: receiving the encrypted message at the receiving device;
descrambling the content of the message;
placing the separated content of the message into a unified message;
and converting the content of the message from the second form M′ back into the first form M.
13. The computer-implemented method of claim 12, wherein the phase of descrambling the content of the message comprises:
calculating the scrambling pattern for the content of the message using a fourth secret prime number and a secret modulus; and
parsing through the encrypted message and reversing the scrambling pattern.
14. The computer-implemented method of claim 12, wherein the phase of placing the separated content of the message into a unified message comprises:
calculating a spacing pattern for the content of the message using a third secret prime number R and a second known encryption key K; and
parsing through the separated message to reverse the spacing pattern.
15. The computer-implemented method of claim 12, wherein the phase of converting the content of the message from the second form M′ back into the first form M comprises:
calculating a secret decryption key D as a function of the known encryption key E, first secret prime number P, and second secret prime number Q according to the formula:
D*E=I*mod((P−I)*(Q−I));
and using the secret calculated decryption key D to convert the content of the message in the second form M′ back into the first form M′ according to the formula:
16. A computer implemented encryption and decryption method comprising:
converting, with a processor, a content of a message from a first form M to a second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q;
after converting the content of the message to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q, separating, with a processor, the converted content of the message to further encrypt the content of the message according to a spacing pattern, the spacing pattern a function of a third secret prime number R and a second known encryption key K;
after converting the content of the message to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q, scrambling, with a processor, the converted content of the message according to a scrambling pattern, the scrambling pattern a function of a fourth secret prime number S and a secret modulus J;
sending, with a processor, an encrypted message from an encrypting device to a receiving device
calculating, with a processor, the scrambling pattern and parsing through the encrypted message to reverse the scrambling pattern;
calculating, with a Processor, the spacing pattern and parsing through the encrypted message to place the content of the message in a unified message; and
converting, with a processor, the content of the message from the second form M′ to the first form M as a function of a decryption key D, the first secret prime number P, and the second secret prime number Q.
17. The computer implemented encryption and decryption method of claim 16, wherein the product of the first secret prime number P and the second secret prime number Q is greater than the numerical value of the content of the message in the first form M.
18. The computer implemented encryption and decryption method of claim 17, wherein the known encryption key E is relatively prime to the first secret prime number P and the second secret prime number Q.
19. The computer implemented encryption and decryption method of claim 18, wherein the content of the message is converted from the first form M to the second form M′ according to the formula:
M′=M E*mod(P*Q).
20. The computer implemented encryption and decryption method of claim 16, wherein the spacing pattern is calculated according to the formula:
21. The computer implemented encryption and decryption method of claim 16, wherein the scrambling pattern is calculated according to the formula:
22. The computer implemented encryption and decryption method of claim 16, wherein the decryption key is calculated according to the formula:
D*E=I*mod((P−I)*(Q−I)).
23. The computer implemented encryption and decryption method of claim 22, wherein the content of the message is converted from the second form M′ to the first form M according to the formula:
24. A system for encrypting a message, comprising:
an encryption module comprising a first processor, a first memory coupled with the first processor, and a first network interface coupled with a communications network, the first processor, and the first memory;
conversion logic stored in the first memory and executable by the first processor to convert a content of the message from a first form M to a second form M′ as a function of a known encryption key E, a first secret prime number P, nd a secret prime number Q;
separating logic stored in the first memory and executable by the first processor to separate the content of the message according to a spacing pattern to further encrypt the content of the message after the content of the message is converted to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a secret prime number Q;
scrambling logic stored in the first memory and executable by the first processor to scramble the content of the message according to a scrambling pattern to further encrypt the content of the message after the content of the message is converted to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a secret prime number Q; and
communication logic stored in the first memory and executable by the first processor to send an encrypted message over the communications network.
25. The system of claim 24, wherein the content of the message is converted from the first form M to a second form M′ according to the formula:
M′=M Emod(P*e).
26. The system of claim 24, wherein the spacing pattern for separating the content of the message is a function of a third secret prime number R and a modulus K, according to the formula:
27. The system of claim 26, wherein the phase of separating the content of the message according to a spacing pattern comprises:
pulsing the content of the message into a plurality of distinct packets.
inserting excess characters into the content of the message to distribute the content of the message into a plurality of groupings.
29. The system of claim 24 wherein the scrambling pattern is a function of a secrete modulus J and a fourth secret prime number S, according to the formula:
30. The system of claim 24, further comprising:
a decryption module comprising a second processor, a second memory coupled with the second processor, and a second network interface coupled with the communications network, the second processor, and the second memory;
a second communications logic stored in the second memory and executable by the second processor to receive the encrypted message over the communications network;
descrambling logic stored in the second memory and executable by the second processor to descramble the content of the message;
unifying logic stored in the second memory and executable by the second processor to place the separated content of the message into a unified message; and second conversion logic stored in the second memory and executable by the second processor to convert the content of the message from the second form M′ back into the first form M.
31. The system of claim 30 wherein the second conversion logic calculates a secret decryption key D as a function of the known encryption key E, first secret prime number P, and second secret prime number Q according to the formula:
D*E=I*mod ((P−I)*(Q−I)); and
using the secret calculated decryption key D, converts the content of the message in the second form M′ back into the first form M according to the formula:
32. A system for encrypting and decrypting a message comprising:
conversion means for converting a content of the message from a first form M to a second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q;
separating means for separating the content of the message according to a spacing pattern to further encrypt the content of the message after the content of the message is converted to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q, the spacing pattern a function of a third secret prime number R and a second known encryption key K;
scrambling means for scrambling the content of the message according to a scrambling pattern to further encrypt the content of the message after the content of the message is converted to the second form M′ as a function of a known encryption key E, a first secret prime number P, and a second secret prime number Q, the scrambling pattern a function of a fourth secret prime number S and a secret modulus J;
descrambling means for calculating the scrambling pattern and parsing through the encrypted message to reverse the scrambling pattern;
unifying means for calculating the spacing pattern and parsing through the encrypted message to place the content of the message into a unified message; and
second conversion means for converting the content of the message from the second form M′ to the first form M as a function of a decryption key D, the first secret prime number P, and the second secret prime number Q.
33. A system for decrypting a message, comprising:
a decryption module comprising a processor, a memory coupled with the processor, and a network interface coupled with a communications network, the processor, and the memory;
communications logic stored in the memory and executable by the processor to receive an encrypted message over the communications network;
descrambling logic stored in the memory and executable by the processor to descramble a content of the message that has been encrypted based on a scrambling pattern using the scrambling pattern;
unifying logic stored in the memory and executable by the processor to place separated content of the message that has been encrypted based on a spacing pattern into a unified message using the spacing pattern; and
conversion logic stored in the memory and executable by the processor to convert the content of the message from a second form M′ back into a first form M based on a known encryption key E, a first secret prime number P, and a second secret prime number Q after the content of the message is descrambled nd the content of the message is placed into a unified message.
34. The system of claim 33, wherein the descrambling logic: calculates the scrambling pattern for the content of the message using a fourth secret prime number S and a secret modulus J; and
parses through the encrypted message and reverses the scrambling pattern;
wherein the descrambling logic calculates the scrambling pattern according to the formula:
35. The system of claim 33, wherein the unifying logic:
calculates the spacing pattern for the content of the message using a third secret prime number R and a second known encryption key K; and
parses through the separated message to reverse the spacing pattern;
wherein the unifying logic calculates the spacing pattern according to the formula:
36. The system of claim 33, wherein the conversion logic: calculates a secret decryption key D as a function of the known encryption key E, first secret prime number P, and second secret prime number Q; and
uses the secret calculated decryption key D to convert the content of the message in the second form M′ back into the first form M according to the formula:
M=(M′)D*mod(P*Q);
wherein the conversion logic calculates the secret decryption key D according to the formula:
US11/064,912 2005-02-24 2005-02-24 System and method for three-phase data encryption Expired - Fee Related US7725715B2 (en)
US11/064,912 US7725715B2 (en) 2005-02-24 2005-02-24 System and method for three-phase data encryption
AU2006216855A AU2006216855B2 (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
AT06720902T AT433624T (en) 2005-02-24 2006-02-21 System and method for three phase encryption
PCT/US2006/005942 WO2006091528A2 (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
EP20060720902 EP1851897B1 (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
CA 2596665 CA2596665A1 (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
KR1020077018259A KR101126024B1 (en) 2005-02-24 2006-02-21 System and Method for Three-Phase Data Encryption
JP2007557086A JP5106124B2 (en) 2005-02-24 2006-02-21 Three-stage data encryption system and method
RU2007131731/02A RU2376712C2 (en) 2005-02-24 2006-02-21 System and method for three-phase information encryption
CN 200680006110 CN101129015B (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
NZ55674106A NZ556741A (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
DE200660007217 DE602006007217D1 (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
TW95105749A TWI379572B (en) 2005-02-24 2006-02-21 System and method for three-phase data encryption
MYPI20060779 MY142512A (en) 2005-02-24 2006-02-23 System and method for three-phase data encryption
HK08108849A HK1117975A1 (en) 2005-02-24 2008-08-11 System and method for three-phase data encryption
US11/064,912 Expired - Fee Related US7725715B2 (en) 2005-02-24 2005-02-24 System and method for three-phase data encryption
US20090296935A1 (en) * 2008-05-29 2009-12-03 Broadcom Corporation Decoding and encoding data
US9154471B2 (en) 2013-11-26 2015-10-06 At&T Intellectual Property I, L.P. Method and apparatus for unified encrypted messaging
US20090228554A1 (en) * 2008-03-04 2009-09-10 Access Business Group International Llc Method and system for assigning unique and dynamic information-carrying serial numbers
US20090228959A1 (en) 2008-03-04 2009-09-10 Access Business Group International Llc System and markup language for information extraction from stand-alone devices in webspace
US8069100B2 (en) 2009-01-06 2011-11-29 Access Business Group International Llc Metered delivery of wireless power
US20120297182A1 (en) * 2011-05-18 2012-11-22 Sherisse Hawkins Cipher and annotation technologies for digital content devices
US4218582A (en) * 1977-10-06 1980-08-19 The Board Of Trustees Of The Leland Stanford Junior University Public key cryptographic apparatus and method
US4870681A (en) 1986-03-05 1989-09-26 Holger Sedlak Cryptographic method and cryptographic processor for carrying out the method
US5136290A (en) * 1990-06-18 1992-08-04 Bond James W Message expansion decoder and decoding method for a communication channel
US5289542A (en) 1991-03-04 1994-02-22 At&T Bell Laboratories Caller identification system with encryption
US5295188A (en) 1991-04-04 1994-03-15 Wilson William J Public key encryption and decryption circuitry and method
WO1994015423A1 (en) 1992-12-22 1994-07-07 Telstra Corporation Limited A cryptographic method
GB2278518A (en) 1993-05-14 1994-11-30 Trafford Limited Encrypted data transfer
US5585598A (en) 1994-03-11 1996-12-17 Ricoh Company, Ltd. Rotary developing device for an image forming apparatus
US5604806A (en) 1995-01-20 1997-02-18 Ericsson Inc. Apparatus and method for secure radio communication
WO1998010559A1 (en) 1996-09-03 1998-03-12 Siemens Aktiengesellschaft Device and method for the cryptographic processing of a digital data stream presenting any number of data
US5737425A (en) 1996-05-21 1998-04-07 International Business Machines Corporation Cryptosystem employing worst-case difficult-to solve lattice problem
US6259790B1 (en) 1996-08-09 2001-07-10 Nippon Telegraph And Telephone Corporation Secret communication and authentication scheme based on public key cryptosystem using N-adic expansion
US20020087884A1 (en) 2000-06-12 2002-07-04 Hovav Shacham Method and apparatus for enhancing network security protection server performance
US6460137B1 (en) 1995-06-02 2002-10-01 Fujitsu Limited Encryption processing system
US20020141574A1 (en) 2001-02-02 2002-10-03 Henson Kevin M. Data encryption methodology
US20030076959A1 (en) 2001-10-22 2003-04-24 Chui Charles K. Method and system for secure key exchange
US6578150B2 (en) * 1997-09-17 2003-06-10 Frank C. Luyster Block cipher method
US6652380B1 (en) 1998-12-04 2003-11-25 Sierra Design Group Cashless gaming system and method
US6675152B1 (en) 2000-09-13 2004-01-06 Igt Transaction signature
US6685567B2 (en) 2001-08-08 2004-02-03 Igt Process verification
US6721421B1 (en) 1997-02-04 2004-04-13 Deutsche Telekom Ag Method for encrypting information represented as a numerical value
US6722985B2 (en) 2001-04-19 2004-04-20 Igt Universal player tracking system
US6739975B2 (en) 2001-06-28 2004-05-25 Igt Method for cashless gaming
US20040125949A1 (en) * 2000-12-12 2004-07-01 Jean-Pierre Seifert Method of and apparatus for determining a key pair and for generating RSA keys
US20040139313A1 (en) 2002-12-05 2004-07-15 Buer Mark L. Tagging mechanism for data path security processing
US20050002528A1 (en) * 2003-06-13 2005-01-06 Hewlett-Packard Development Company, L.P. RSA cryptographic method and system
US6996233B2 (en) * 2003-06-19 2006-02-07 International Business Machines Corporation System and method for encrypting and verifying messages using three-phase encryption
JPH01122227A (en) * 1987-11-06 1989-05-15 Konica Corp Transmission equipment
JPH0488736A (en) * 1990-07-31 1992-03-23 Matsushita Electric Ind Co Ltd Data transmission system
JP2864813B2 (en) * 1991-09-26 1999-03-08 日本電気株式会社 Encryption device and decryption device
US5295598A (en) * 1992-06-24 1994-03-22 Gerlach David D Drinking vessel and retainer therefor
JP3358954B2 (en) * 1996-09-17 2002-12-24 アイオニクス沖縄株式会社 Pseudorandom bit sequence generator and encryption communication method to use it
JPH1155247A (en) * 1997-07-31 1999-02-26 Nippon Telegr & Teleph Corp <Ntt> Method for transmitting secret information for ensuring transmitter anonymity and device therefor and program storage medium
JP2003157003A (en) * 2001-11-19 2003-05-30 Mitsubishi Electric Corp Digital signal recording and reproducing device, recorder and reproducing device therefor, and digital signal recording and reproducing method, recording method and reproducing method therefor
2006-02-21 AU AU2006216855A patent/AU2006216855B2/en not_active Ceased
2006-02-21 EP EP20060720902 patent/EP1851897B1/en not_active Expired - Fee Related
2006-02-21 NZ NZ55674106A patent/NZ556741A/en not_active IP Right Cessation
2006-02-21 CA CA 2596665 patent/CA2596665A1/en not_active Abandoned
2006-02-21 TW TW95105749A patent/TWI379572B/en not_active IP Right Cessation
2006-02-21 RU RU2007131731/02A patent/RU2376712C2/en not_active IP Right Cessation
2006-02-23 MY MYPI20060779 patent/MY142512A/en unknown
2008-08-11 HK HK08108849A patent/HK1117975A1/en not_active IP Right Cessation
Jakob Jonsson., "An OAEP Variant With a Tight Security Proof"-Draft 1.0, RSA Laboratories, Mar. 18, 2002, pp. 1-25.
Jakob Jonsson., "An OAEP Variant With a Tight Security Proof"—Draft 1.0, RSA Laboratories, Mar. 18, 2002, pp. 1-25.
PCT International Search Report dated Jun. 27, 2007-International Application No. PCT/US2006/005942, Filing date Feb. 21, 2006, 8 pgs.
PCT International Search Report dated Jun. 27, 2007—International Application No. PCT/US2006/005942, Filing date Feb. 21, 2006, 8 pgs.
US8666079B2 (en) * 2008-05-29 2014-03-04 Broadcom Corporation Decoding and encoding data
RU2007131731A (en) 2009-03-27
EP0658054B1 (en) 1998-09-16 Apparatus and method for securing communication systems
US8259934B2 (en) 2012-09-04 Methods and devices for a chained encryption mode
US5850443A (en) 1998-12-15 Key management system for mixed-trust environments
CN1140974C (en) 2004-03-03 Method for encryption of information
US7260215B2 (en) 2007-08-21 Method for encryption in an un-trusted environment
CN100379194C (en) 2008-04-02 Memory encryption
JP3816337B2 (en) 2006-08-30 Security methods for transmission in telecommunications networks
DE69727641T2 (en) 2004-12-23 Method for sending a secure message in a telecommunication system
US5345508A (en) 1994-09-06 Method and apparatus for variable-overhead cached encryption
JP4086782B2 (en) 2008-05-14 Access to broadcast content
US7599496B2 (en) 2009-10-06 Secure encryption key distribution
US9608804B2 (en) 2017-03-28 Secure key authentication and ladder system
US5179591A (en) 1993-01-12 Method for algorithm independent cryptographic key management
US8050405B2 (en) 2011-11-01 Shared key encryption using long keypads
US9094191B2 (en) 2015-07-28 Master key encryption functions for transmitter-receiver pairing as a countermeasure to thwart key recovery attacks
EP0624013B1 (en) 1998-12-02 Device and method for data encryption
KR100372495B1 (en) 2003-02-15 Method and system for securely transferring a data set in a data communications system
US6885747B1 (en) 2005-04-26 Cryptographic key split combiner
JP2942913B2 (en) 1999-08-30 Partner authentication / encryption key distribution scheme
DE602004007116T2 (en) 2008-02-28 Protected retro channel diggently managed by digital rights dongle
US7634659B2 (en) 2009-12-15 Roaming hardware paired encryption key generation
KR100888472B1 (en) 2009-03-12 Cryptographic method using dual encryption keys and wireless local area network system therefor
KR100402811B1 (en) 2003-10-30 Extended key generator, encryption/decryption unit, extended key generation method, and storage medium
US20060291660A1 (en) 2006-12-28 SIM UICC based broadcast protection
US5438622A (en) 1995-08-01 Method and apparatus for improving the security of an electronic codebook encryption scheme utilizing an offset in the pseudorandom sequence
Owner name: ACCESS BUSINESS GROUP INTERNATIONAL LLC, MICHIGAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VEISEH, NIMA;BAARMAN, DAVID W.;LEPPEIN, THOMAS J.;REEL/FRAME:016518/0225;SIGNING DATES FROM 20050418 TO 20050503
Owner name: ACCESS BUSINESS GROUP INTERNATIONAL LLC,MICHIGAN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VEISEH, NIMA;BAARMAN, DAVID W.;LEPPEIN, THOMAS J.;SIGNING DATES FROM 20050418 TO 20050503;REEL/FRAME:016518/0225
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT ASSIGNOR'S NAME ON A DOCUMENT PREVIOUSLY RECORDED AT REEL 016518 FRAME 0225;ASSIGNORS:VEISEH, NIMA;BAARMAN, DAVID W.;LEPPIEN, THOMAS JAY;REEL/FRAME:017204/0112;SIGNING DATES FROM 20050418 TO 20050503
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT ASSIGNOR'S NAME ON A DOCUMENT PREVIOUSLY RECORDED AT REEL 016518 FRAME 0225;ASSIGNORS:VEISEH, NIMA;BAARMAN, DAVID W.;LEPPIEN, THOMAS JAY;SIGNING DATES FROM 20050418 TO 20050503;REEL/FRAME:017204/0112
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.)


text:
Who is Bill Milling?
Bill Milling
Bill Milling, owner of Tricaster Rentals.
Bill Milling is an Emmy-winning producer and the owner and head producer/director of the American Movie Company located in New York City's Tribeca district. Milling worked in the film industry for decades and has experience with everything from feature films to commercials.
He has produced, directed, written, and done everything in between. He is also the former Head of Worldwide Production for International Dynamic Pictures, Inc. and former President of Sigmax Entertainment, Inc.
Milling received a BA in Classical Studies and English at Seton Hall University and MA English from Montclair State University. He also attended New York University's Tisch School of the Arts to receive his MA Cinema Studies and completed ABD for Ph.D. Cinema Studies.
After working as director of special effects for the hit horror film "Squirm", Milling won the Emmy Award for producing the children's series Unicorn Tales for NBC. The show won a total of 17 Emmys, and Milling wrote the Emmy-winning episode. The series also won the prestigious Action for Children's Television award. Milling also wrote and directed a couple of documentaries for PBS including Antarctica: "Krill Quest" and directed the PBS series Great Finds.
In 1996, Milling opened the American Movie Company, a New York City-based green screen studio and sound stage with state-of-the-art equipment. The company is also a teleprompter rental house that has the newest cameras and film equipment. They are authorized TriCaster resellers and certified Newtek TriCaster operators.
As business at the American Movie Company grew, Milling and his crew began to work on television, film, and other kinds of productions. Milling served as the New York Production Executive on such films as "Lucky Number Slevin" , "54", The Late Shift", "Senseless", "Resident Evil: Extinction" and "The Mortal Instruments: City of Bones".
Milling worked on countless episodes of "Friends", "Will & Grace," Mad About You" and "How I Met Your Mother".
In addition to his work in filmed media, Milling has directed a number of theater productions including Flowers for Algernon through Tempest Productions, New Jersey. He also taught Film History and Esthetics at Pratt Institute and Film Production and Screenwriting for a number of years at New York University's Tisch School of the Arts.
Milling has since retired from teaching and focuses all of his energy on the American Movie Company, which now has facilities in New York City, Hollywood, Washington, D.C., and Miami and continues to grow. It is one of the most well-respected and frequently used green screen studios in New York. Its New York studio is in the exciting Tribeca area of southern Manhattan. Milling currently resides in New York City with his wife.

redpajama_set_name: RedPajamaCommonCrawl


text:
Paige's return has UNC in 'comfort zone,' looking like title favorite
With the return of its senior leader Marcus Paige, UNC instantly looks like a national championship contender
Luke Winn
CHAPEL HILL, N.C. — The wait. That, in the end, was the hardest thing for Marcus Paige. Two hundred and fifty days since he'd last played in a game that counted: North Carolina's loss to Wisconsin in the Sweet 16 of the NCAA tournament. Twenty-nine days since the Tar Heels were voted No. 1 in the 2015–16 preseason Associated Press poll, in large part because Paige was still on the roster. Twenty-eight days since the senior guard fractured the third metacarpal in his right hand during practice, just his latest injury after suffering through foot ailments most of last season. Eighteen days since Paige's teammates opened the season without him. Six games on the bench, including the visit to Northern Iowa that had been scheduled specifically as his homecoming tribute (he's from nearby Marion, Iowa), and instead, resulted in an upset that dropped the Heels from No. 1 to No. 9. And then in a cruel twist, once he was finally cleared to play, for Tuesday night's 89–81 win over No. 2 Maryland, the game's ESPN broadcast slot wasn't until 9:30 p.m. ET.
The wait was excruciating. It felt, Paige said, "like the longest day ever."
Hoop Thoughts: Lessons learned from the Battle 4 Atlantis, more
November's Most Noticeably Absent Guard spent an early portion of Tuesday working on a paper due Wednesday for a globalization class. Paige's topic: the decline of the nation-state and its impact on the global economy. He had to put the paper aside to make the early shootaround at the Dean E. Smith Center. Paige took his shots and started feeling the good kind of nervous. He finished up, looked at the clock and … damn: "It was still, like, five hours until the game."
North Carolina's JV team still had to play on the Dean Dome court. The JV Tar Heels lost to Davidson County Community College, and the handshake line didn't take place until after 8 p.m. UNC students, at that point, were just trickling in to the building. At 8:18 p.m., there were a few scattered cheers as Paige emerged from a tunnel near the Tar Heels locker room, while Ed Sheeran's "Don't" played on the PA system. Paige grabbed a ball and took a few casual dribbles to the left elbow of the far basket. His mending right hand—his non-shooting hand—was taped, with padding affixed to its backside. He swished a shot from the elbow and then started testing his limits. He swished his first five three-point attempts, from the left wing. He only missed when he pushed it too far, taking a shot from out of bounds along the baseline, while standing on UNC's twitter handle.
At 9:33 p.m., when Paige was officially introduced as the final Tar Heel starter, 21 hours and 33 minutes into the 250th day since he'd last played a game, the roar was loud enough that the announcer could not get past: "6'2" senior from Mar—" before being drowned out.
Mid-major report: Monmouth Hawks already have plenty to celebrate
And the first thing we learned from the return of Marcus Paige came right after the tip-off: Coach Roy Williams was not using the lefty he tends to call "No. 5" or "little rascal" as a point guard. Sophomore Joel Berry II brought up the ball, and Berry and (much less so) junior Nate Britt shared that duty for the rest of the evening. Paige's role was as a play-making shooting guard, one for whom they ran a play on the first possession of the game. Paige came off two screens on the right wing, received a pass, drove left down the lane, fumbled the ball—shaking off the rust—but recovered in time to dish to Kennedy Meeks for a 2–0 lead.
Thirty-two seconds later, Paige stood deep on the right wing, with 6'9" Maryland forward Jake Layman playing a step off of him. Paige casually sized up the distance, looked at Layman's outstretched (but not bothersome) arm and drilled a three in his face. Paige's path back on defense took him near UNC's bench, towards which he turned and smiled. The lid was off, the nerves were gone and he felt no pain.
"Once that went in," Paige said, "I was like, All right. You're fine. Just play your game."
Williams had wondered about Paige, how he'd act on Tuesday, given the wait and the stage. UNC wasn't just playing the nation's No. 2 team; it was also facing a point guard, Melo Trimble, who's among the few backcourt players anywhere that can match Paige's offensive output. Williams said he "had a feeling the little rascal would be pretty good." But, the coach said, "You don't ever know because sometimes kids like Marcus, who are so conscientious and care, they put too much pressure on themselves."
Evaluating budding star Ben Simmons through first five collegiate games
If there was anyone affected by pressure early on, it was Trimble, who committed three turnovers in Maryland's first 10 possessions. When the Terrapins entered the 11:49 media timeout trailing 17–11, their offensive play-by-play log was a wreck, with nine turnovers in their first 17 possessions. Trimble is typically a foul-drawing machine, and it took him until the 3:52 mark of the first half to make his first trip to the free-throw line.
As for Paige, if Williams was looking for a sign that his senior star felt loose and confident, it came on a fast break with 8:08 left. Paige was running the floor ahead of ball-handler Brice Johnson, and the senior guard, who has never been considered a high-flyer, and is a highly infrequent dunker, called for an alley-oop. It was, Paige admitted, possibly the first time he'd called for an 'oop' pass since he was "on the playground, back in high school."
Johnson overcame his surprise and obliged. What happened next was a subject of debate that included some grammatical self-correction from Paige, a double-major in journalism and history.
"If he would've threw it higher—if he would've thrown it higher, pardon [me]—I would have probably dunked it," Paige said of Johnson's pass. "But y'all don't believe me, so that doesn't matter."
What we all saw was Paige rise to catch the ball—and yes, the pass was a tad low, but it wasn't hip-low—then abort mission mid-air and dish the ball back to Johnson. He finished it off with a slam for a 30–19 lead, and was O.K. with the outcome. "Someone ended up dunking it," he said.
With elite recruiting classes, Duke and UK already look like 2017's top teams
The second thing we learned from the return of Marcus Paige was that he didn't acquire elite leaping abilities in the off-season. But the third thing we learned, when the game got hairy in the second half, with the resilient Trimble and Rasheed Sulaimon leading the Terps back into multiple ties and even one short-lived lead, is that Paige did not lose his penchant for clutch shot-making. He delivered multiple Marcus Paige Moments after Maryland took its first lead, at 59–58, on a Trimble four-point play with 13:40 left. Paige immediately answered with a right-wing three, and added a short leaner on the subsequent possession to put UNC back up 63–59. He hit the 20-point mark with two free throws at 5:35 and finished with five assists and one turnover—a stat line Williams read off in his postgame press conference and later said, "I like my team. I like it a lot better when No. 5 is out there."
That brings us to the last thing we learned from the return of Marcus Paige: That North Carolina, regardless of what the polls say, looks like the best team in the nation now that its leader is back. The Tar Heels' offense opened up with Paige on the floor, and their previously mediocre jump-shooting became a bright spot, as they made 9-of-13 three-point attempts. Their defense was surprisingly stout, holding Maryland's powerful scoring attack to its lowest output (1.04 points per possession) of the season. Paige claimed that his presence doesn't make a "night and day difference," arguing that all his return did was create a "comfort zone" for the team where everyone was shifted to their proper spot in the rotation. Paige was being too humble—in truth, North Carolina goes from a Sweet 16 team to the national-title favorite with him healthy—but the comfort-zone part was spot-on. The Heels, finally, seemed to be in all the right places.
Hoop Thoughts: Rule changes are increasing score, benefiting game
That is, except for one instance: When Paige walked into the Tar Heels' team lounge for his postgame interviews, he found Berry—who finished with 14 points and five assists, a breakout performance of sorts—sitting in a corner chair, near the computers, that has long been reserved, unofficially, for Paige.
"Six games!" Paige said, feigning anger that he hadn't been gone long enough to be supplanted from his chair. "Hey man, come on, now."
Paige resigned himself to taking another spot. He took questions about the wait, his hand, its tape-job, the win, the alley-oop, the globalization paper he still had to finish by 10 a.m. Wednesday (it would keep him up past 3 a.m.), and finally, his favorite hip-hop artist, North Carolina-raised J. Cole, who'd been in the crowd and paid a visit to UNC's locker room afterwards.
It only took a matter of seconds once Paige sat down for the flock of reporters around Berry to swarm around his elder backcourt mate. Paige had not been the first man in the room, but he immediately became the focal point. And the last thing he did, on his way out of the room at midnight, was recommend that a reporter familiarize himself with J. Cole.
"You gotta check that stuff out," Paige said. "It's explicit lyrics, but it's got some good metaphors in there."
UNI exposes UNC's vulnerability without Paige
Northern Iowa stunned No. 1 North Carolina on Saturday, spoiling senior guard Marcus Paige's return to Iowa
By Ryan Krasnoo
Marcus Paige's role in UNC's Final Four run
Once UNC's driving force, Marcus Paige helped fuel a Final Four run by embracing a new role on the Tar Heels
By Brian Hamilton
Paige's injury a blessing in disguise for UNC
North Carolina losing star guard Marcus Paige could actually benefit the Tar Heels later in the season as Joel Berry II and the rest of the team has a chance to shine.
By Molly Geary
UNC guard Marcus Paige is returning for his senior season
North Carolina guard Marcus Paige will return next season, his father told Bret Strelow of The Fayetteville Observer.
By SI Wire
UNC G Paige out 3 to 4 weeks with broken hand
North Carolina guard Marcus Paige is out three to four weeks with a broken hand.
Marcus Paige's heroics aren't enough to lift UNC
Marcus Paige pulled North Carolina back into the national championship game against Villanova, but ultimately, his efforts weren't enough to bring his Tar Heels a title.
Is Marcus Paige 'back' from his foot injury? It looked that way in UNC's win
Marcus Paige had perhaps his best game of the season in North Carolina's win over NC State on Wednesday. That's a great sign for the Tar Heels, who need him at full strength in order to reach their goals.
By Martin Rickman
Watch: UNC's Marcus Paige dunks through-the-legs
Did you know Marcus Paige could get up like this?


From the time the Lenape first discovered the waters of Lake Hopatcong some 12,000 years ago, it was a special place. A deep spring-fed lake formed by glaciers, it was the perfect setting for a Native American community. Its forested shores supported ample game while the water furnished abundant fish.
The body of water the Lenape knew was twelve feet below the level of the Lake we know today. In ensuing years, dams and dredging have increased the Lake to its current size. Even at its original size, Lake Hopatcong would be the largest lake in the State of New Jersey.
Following the War of 1812, the United States entered a great era of canal building. It can perhaps be considered America's first attempt at interstate highways. It was in this era that the idea of the Morris Canal was conceived. Like any canal, the Morris Canal required massive amounts of water. Lake Hopatcong was ultimately raised to its current level and was the Canal's single largest source of water. Along the way, other sources of water were linked - such as the Musconetcong and Passaic Rivers and Greenwood Lake. When more water was eventually needed, the Stanhope Reservoir (now known as Lake Musconetcong) was created.
While never realizing the economic success its founders had hoped, the Morris Canal had a tremendous effect on Lake Hopatcong and it set in motion the events which would lead to the Lake's rise as a great resort. It spurred the building of a railroad to connect several mines in the area to the Lake so that they would have access to the Canal. The ten mile long railroad ran from Ogdensburg to the Nolan's Point section of Lake Hopatcong and was completed in 1866.
As railroads emerged as the modern transportation alternative, it became clear that a railroad to support a canal contained an unnecessary step - the canal. In 1882, the Central Railroad of New Jersey completed a connection from its main tracks to the Ogden Mine Railroad terminus at Nolan's Point. It did not take long for the Central Railroad of New Jersey management to realize that there was great passenger potential for this newly formed line. Here was a direct rail link to a large lake just over one hour from numerous large cities, as well as New York City itself. In September 1882, the first passenger excursion train arrived at Nolan's Point and the tourist boom at Lake Hopatcong was on! The Lackawanna Railroad, whose tracks passed by the southern end of Lake Hopatcong, quickly added a station to share in the business and two major rail lines were now serving the new resort.
Arriving passengers needed activities to busy themselves. This led to the building of pavilions at Nolan's Point to entertain the tourists. One day excursions soon led to a desire for longer stays at this pleasant locale causing quite a construction boom. Prior to the Central Railroad reaching the Lake, only four small hotels existed at the Lake. By 1900, over 40 hotels and rooming houses were operating at the Lake. Many of these early hotels and rooming houses were concentrated around the railroad at Nolan's Point, but building soon spread to other areas of the Lake.
Since early roads at the Lake were poor or nonexistent, the main source of transportation was water. As soon as tourism developed so did boat service. Competing steamboat companies met arriving passengers and took them to all parts of the Lake. Most goods and services were also delivered by boat.
The single most important factor in Lake Hopatcong's growth as a resort was the construction of the Hotel Breslin completed in 1887. This hotel's construction by a group of wealthy and influential individuals (including Garrett Hobart, who later served as Vice President of the United States under President McKinley) gave Lake Hopatcong instant credibility as a resort. As Gustave Kobbe noted in his New Jersey guidebook of 1890, "The Hotel Breslin gave to Hopatcong its first decided 'boom,' for it brought to the Lake the element of wealth and fashion, in the wake of which everything else follows."
At the same time that the Lake was becoming a large hotel resort, other development was also occurring. Many early visitors camped at the Lake or built crude cottages. Wealthy individuals also were learning of the Lake and building Victorian "cottages," including an entire millionaire's community around the grand Breslin Hotel in Mount Arlington.
As with any "hot" resort, Lake Hopatcong was a magnet for many of the "rich and famous" of the day. The most famous female actress of her era, Lotta Crabtree, had a home built here in the 1880's. Hudson Maxim, noted scientist and inventor, came here at the turn of the century and built a large estate in the Borough of Hopatcong. During the heyday of Vaudeville and Burlesque, the Lake became a favorite rest stop for performers during the summer when most theaters closed. Bud Abbot, Bert Lahr, and Milton Berle were among the many show business people to spend considerable time at the Lake. The center for much of this activity was Joe Cook's Sleepless Hollow in Hopatcong's Davis Cove. Cook was a popular Vaudevillian, comedian and musical theater star who lived at the Lake from 1924 to 1941. Among other amenities, his home boasted a nine hole golf course, two bars, and tennis courts at which celebrities could often be found.
Lake Hopatcong's run as a major northeast hotel resort lasted from the 1880's through the Depression. Ultimately, the dreadful economy of the 1930's, the development of the automobile, which led people to seek more "exotic" destinations, and the onset of World War II led most of the Lake's hotels to close. The few that survived slowly closed in the ensuing decades, with the final operating hotel burning to the ground in 1972.
As with any resort, recreation played an important role in the Lake's development. Numerous clubs and organizations have operated on the Lake since the 1880's. The Lake Hopatcong Yacht Club opened its clubhouse, which still stands, on Bertrand Island in 1910. The Maxim Park Yacht Club is long gone but its club house still stands as a private home on Cow Tongue Point. The Garden State Yacht Club started in an old lakeside mansion and one-time hotel. Unfortunately, fire stole that building but the club rebuilt and occupies the same site on Point Pleasant.
The trolley also came through Lake Hopatcong and linked the Lake with many communities to the east. As with many trolley companies, the Morris County Traction Company sought to develop an attraction at the end of its line in order to encourage business on weekends. For that reason, it extended its line to a beach at Lake Hopatcong in 1910. This led to amusements being opened and Bertrand Island Park was born. In 1924 Bertrand Island Park constructed the first roller coaster in the area and evolved into a full-scale amusement park. It soon had competition from an amusement park at Nolan's Point which also built a roller coaster. Ultimately, Bertrand Island won out and was a much loved institution at the Lake for the next six decades.
In the years following World War II, the Lake continued to be a popular summer spot, as it evolved into a middle class bungalow and second home community. Featuring such popular night spots as The Mad House, Sheppies, and the bar lounge at the Bon Air Lodge, the Lake remained a popular summer jaunt. With the 1960's and the gradual completion of a major interstate from New York City, the Lake's evolution accelerated. By the mid 1970's, almost all vestiges of its days as a summer resort had disappeared, as more and more homes became year round residences. When Bertrand Island Amusement Park closed in 1983, the evolution was complete, and for all intent and purpose the Lake had become a residential community. Today the Lake consists predominantly of year-round residents living in four towns and two counties. While much has changed since that day in 1882 when the first excursion train pulled into Nolan's Point, Lake Hopatcong remains today a unique and special recreational and environmental resource.
Narrative and Book Cover Photos courtesy of Lake Hopatcong Historical Museum. To learn more about the history of Lake Hopatcong visit www.hopatcong.org/museum.


It's Not Supposed to be This Way, in which the president of Proverbs 31 Ministries Lysa TerKeurst reflects on her husband's infidelity, remains at #2 on PW's Religion Nonfiction chart for December. Interest in the book increased after TerKeurst announced to her over 500,000 followers on Instagram that she and her husband had renewed their vows on December 11. Additionally, the book was available at Walmart with a free accompanying six-session video Bible study. It's Not Supposed to be This Way is also Proverbs 31's online Bible study pick for January.
Brian Houston returned to PW's Religion Nonfiction bestsellers list at #4 with There is More, which initially debuted on the list at #6 in April. The first chapter was available for free through Houston's website, while several chapters were also available via his podcast during the month of December.
Karen Kingsbury held the top perch as well as #2 in Religion Fiction with two books in the Baxter Family series, which saw holiday promotions and discounts on Christianbook.com, Amazon, and more. Last-minute holiday shopping also boosted sales of three books by veteran romance writer Francine Rivers, whose 2017 novel The Masterpiece landed at #3.


text:
Home / Shop / Books / Science and Technology / Life Sciences / Biology / Special Topics / Trabecular and Cortical Bone: Morphology, Biomechanics and Clinical Implications
Trabecular and Cortical Bone: Morphology, Biomechanics and Clinical Implications
Varsha Subramanium (Editor)
Manish Bhatnagar (Editor)
Series: Human Anatomy and Physiology
BISAC: SCI036000
In this book, the authors present topical research in the study of the morphology, biomechanics and clinical implications of trabecular and cortical bone. Topics discussed include trabecular bone biomechanics and morphology; cortical bone as an enduring depot of bone-seeking contaminants and the evaluation of cortical bone resportion rate on the basis of a contaminant (90SR) measurement in humans; evaluation of apparent stress and strain at fracture of human trabecular bone under quasi-static compression load using micro-CT finite elements simulation; application of computational modeling to predict the effect of exercise on whole bone strength; advancements in cortical bone imaging; morphology of the pelvis (acetabulum) and femur; the release kinetics of bone morphogenetic proteins from demineralized cortical bone grafts; and preservation of cortical bone in oral and maxillofacial surgery procedures. (Imprint: Nova Biomedical )
Trabecular and Cortical Bone: Morphology, Biomechanics and Clinical Implications quantity
ISBN: N/A Categories: Biology, Human Anatomy and Physiology, Life Sciences, Special Topics Tags: 9781628087666, 9781628087673, biology
Trabecular Bone: Morphology, Biomechanics and Clinical Implications
(Ebrahim Bani Hassan, Ali Ghasem-Zadeh, Faculty of Veterinary Science, The University of Melbourne, Australia, and others)
Cortical Bone as an Enduring Depot of Bone-Seeking Contaminants – Evaluation of Cortical Bone Resorption Rate on the Basis of a Contaminant (90SR): Measurement in Humans
(E.I. Tolstykh, N.B. Shagina, M.O. Degteva, L.R. Anspaugh, B.A. Napier, Urals Research Center for Radiation Medicine, Medgorodok, Chelyabinsk, Russian Federation, and others)
Evaluation of Apparent Stress and Strain at the Fracture of the Human Trabecular Bone under Quasi-Static Compression Load Using Micro-CT Finite Element Simulation
(Ridha Hambli, Prisme Institute/MMH, Orléans Cedex, France)
Application of Computational Modeling to Predict the Effect of Exercise on Whole Bone Strength
(C.S. Florio, New Jersey Institute of Technology, Newark, NJ, USA)
Advancements in Cortical Bone Imaging
(Alexis Donneys, Noah Nelson, Salman Ahsan, Jonathan Peterson, Michael Morris, Francis Esmonde-White, Steven R. Buchman, Stewart Wang, Benjamin Levi, Departments of Surgery and Chemistry, University of Michigan, Ann Arbor, MI, USA)
Morphology of the Pelvis (Acetabulum) and Femur
(Masaaki Maruyama, Judy R. Feinberg, William N. Capello, James A. D'Antonio, Department of Orthopaedic Surgery, Shinonoi General Hospital, Shinonoi, Nagano City, Nagano Prefecture, Japan, and others)
Free Download Available
The Release Kinetics of Bone Morphogenetic Proteins from Demineralized Cortical Bone Grafts
(William S. Pietrzak, Saba N. Ali, Biomet, Inc., Warsaw, IN, USA, and others)
Preservation of Cortical Bone in Oral and Maxillofacial Surgery Procedures
(Mohammad Hosein Kalantar Motamedi, Oral and Maxillofacial Surgery, Trauma Research Center, Baqiyatallah University of Medical Sciences and Attending Surgeon, Azad University of Medical Sciences, Dental School, Tehran, Iran)
Origins and Evolution of Plants on the Earth and the Descendants of ANITA
Zoo Animals: Husbandry, Welfare and Public Interactions


The we heart collective's next exhibition has been announced for Feb 15th. It will be held in a recording studio with a few performances from some triple J unearthed bands (details on the Facebook event page).
I designed the collateral for this exhibition :) which was lots of fun (being a group of designers, we take turns to do each exhibits collateral) and of course used the collective's signature lettering by Ashleigh Brennan.


text:
Inside Ismailism
Taking you inside the secret world of Nizari Ismailis
1. Introduction to Ismailism
2. Ismaili Beliefs, Prayers and Practices
2.1 Ismaili Fakelore
3. Ismaili Festivals
4. Quran and Ismailism
5. Rulings on Ismailism
6. Revert Stories from Ismailism to Islam
7. Aga Khan and Ismailism in the Media
8. The Ismaili Community
9. Ismaili History
Book Downloads
God's Money
History of Ismailis: From Assassins to Aga Khan
Champagne Safari
The Aga Khans – A Picture Gallery
Prince Karim Aga Khan – Aga Khan IV
Inaara Aga Khan (Princess Gabriele of Leiningen) – Former Wife of Karim Aga Khan
Mata Salamat (Om Habibeh) – Mother of Karim Aga Khan
Salwa Aga Khan (Kendra Spears) – Daughter-in-law of Aga Khan IV
Yasmin Aga Khan – Sister of Karim Aga Khan
Zahra Aga Khan – Daughter of Karim Aga Khan
اردو ویب سائٹ اور مضامین
The Nizari Ismaili Trinity
Nizari Ismailis recite the Ismaili Holy Du'a (called Du'a) instead of the Muslim prayer (called salāt in Arabic and namaz in Persian and Urdu). In Urdu-speaking countries, Ismailis insist that since the word namaz does not appear anywhere in the Quran, the namaz which is recited by the Muslims is never commanded by the Quran…
Position of Ramadhan in Ismailism
Ismāʿīlism is based on the abrogation of the Islamic law – which means that ever since their imām made a historical declaration at Alamut in 1164, Ismāʿīlis have absolved themselves of all Islamic practices including ṣalāt (prayer), wuḍū' (ablution), ṣawm (fasting), hajj (pilgrimage), zakāt (charity), abstinence from ribā (interest) and other obligations placed upon a…
7. Aga Khan and Ismailism in the Media / 8. The Ismaili Community
In 1991, Sadruddin Kabani was caught red-handed smuggling more than a million dollars in cash along the US-Canadian border. The money was destined for Aga Khan through Tajuddin Kurji of Aga Khan Foundation Canada and was collected from the Ismāʿīlī community in the name of dasond, mehmani, majlis memberships and various other religious contributions. The…
Ismaili Imamat's Guidance on Consuming "Oceans of Alcohol"
While only one aspect of Ismāʿīlī Imamat's Guidance Against Drinking Alcohol is played repeatedly in front of the Ismāʿīlī community when Hazar Imām's and his family's pictures surface where they are consuming alcohol. In the age of internet, it is no secret that not only does Hazar Imām run a chain of Serena Hotels where…
Why are Ismailis not Shia?
Nizari Ismailis claim that they are the 'second-largest' branch of Shia Islam. This claim however, is widely and almost unanimously rejected in the Shia circles and by all of the Shia scholars. Shia Islam consists mainly of the following: Twelvers (Athnā'ashariyyah or Ithnā'ashariyyah)l, also known as Jafaris Seveners (Shish Imimeyyah), also known as Ismailis Dawoodi…
Unedited footage of Karim Aga Khan's father getting married in a Church
Recently came across some footage released by British Pathe where Aga Khan's father Aly Solomon Khan was getting married in a Church. the wedding was also 'blessed' by Aga Khan III – Sultan Mohammad Shah who was present there at the wedding grinning from ear to ear. The video description reads: 18 May 1936 –…
May 20, 2021 in 9. Ismaili History.
The Rise of the Aga Khan Dynasty – Part 1
Aga Khan I – Syed Ḥasan-ʿAlī Shah Aga Khan Maḥallātī (1219-1300/1804-81) was the last imam of the Nizārī Ismaʿilis to reside in Iran and the first to bear the title of Aga Khan. He was born in the vilage of Kahak near Maḥallāt in central Iran, where his father, Shah Khalīlallāh, had transferred the seat…
October 20, 2020 in 9. Ismaili History.
Das Avatar: The blasphemous Ismaili claim that Ali was the Tenth Incarnation of the Hindu Lord Vishnu
Before any Ismāʿīlī starts dismissing Daś āvatār (daśāvatāra) or دس اوتار , and saying that it is not approved by the Ismāʿīlī Imām, it should be known that Daś āvatār was presented by the first Aga Khan, Ḥasan 'Alī Shāh himself in the Bombay High Court as evidence of his authority over the Khojas and…
October 4, 2020 in 2. Ismaili Beliefs, Prayers and Practices.
After openly selling Alcohol in Serena Hotels, AKDN now selling Pork
It was narrated from Jābir ibn ʿAbdallāh (may Allāh be pleased with him) that he heard the Prophet ﷺ say when he was in Makkah at the time of the Conquest: "Allāh and His Messenger have forbidden the sale of alcohol, dead meat, pork and idols." It was said: "O Messenger of Allāh, what do…
September 27, 2020 in 7. Aga Khan and Ismailism in the Media.
8 Reasons To Leave Ismailism
I begin by taking the name of Allah, to whom all praise is due, and by asking Allah to send peace and blessings upon His final messenger, Muhammad. When I was an Ismaili I often wondered why people would leave or what problems and dangers they had encountered within the faith. The dangers, stemming from…
July 23, 2020 in 2. Ismaili Beliefs, Prayers and Practices.
Yasir Qadhi exposes Aga Khan and Ismailis
In this recent video, Yasir Qadhi exposes Aga Khan and the Ismāʿīlīs and quotes how the Ismāʿīlī Imām ʿAlā Dhikrihis salām abolished sharīʿah and declared qiyamah. Ever since then Ismāʿīlīs have had nothing to do with 'Islām.
July 4, 2020 in 2. Ismaili Beliefs, Prayers and Practices, 5. Rulings on Ismailism.
After leaving Ismailism, Jinnah invited Aga Khan III to do the same
Aboul Ḥasan Isphani (ابو الحسن اصفھانی) was one of the closest aides of Muḥammad Ali Jinnah. He was a fellow lawyer and at the 29th session of Muslim League held in Allahabad in 1942, Isphani moved the resolution which was passed, giving full powers to Muhammad Ali Jinnah for leading the Muslim League. After independence,…
June 27, 2020 in 7. Aga Khan and Ismailism in the Media.
Do Ismailis Follow the Quran?
This is a simple comparison between the texts of the Ismāʿīlīs versus text of the Qur'ān. Ismāʿīlīs reading the below can decide for themselves if they feel they are following the Qur'ān. Supplications (Du'ā) More relevant verses from the Qur'ān: Gināns Some other examples of the Imām being stated as, or compared to Allāh ﷻ…
June 20, 2020 in 4. Quran and Ismailism.
10 Facts You Never Knew About The Ismaili Prayer
One thing which Muslims in general do not realize about Ismāʿīlīs is that how different is Ismāʿīlīsm as compared to 'Islām. Here are 10 shocking facts which Muslims have never been told about the Ismāʿīlī prayer (also known as Holy Du'ā) which the Ismāʿīlīs pray as a substitute for the Muslim ṣalāt. 1. No adhan,…
May 26, 2020 in 2. Ismaili Beliefs, Prayers and Practices.
Zahra Aga Khan was once tipped as the next Ismaili Imam
Before Karim Aga Khan married Gabrielle Renate Homey, and well before Aly Muhammad Khan was born, Karim Aga Khan had little intentions of pushing his son Rahim as his successor. So much was his lack of confidence in Rahim, that he pushed the idea of Zahra Aga Khan as the next Ismaili Imam as she…
May 17, 2020 in 7. Aga Khan and Ismailism in the Media.
Search hundreds of articles here on Inside Ismailism
Follow Inside Ismailism via Email
Top Articles on Inside Ismailism
The Secret Life of the Aga Khan
Karim Aga Khan's Women – Part 2: Sylvia Casablanca and Patricia Deblave
Wine into Water: Ismaili Imamat's Guidance on Alcohol Consumption
Who are the Ismailis?
What They Didn't Tell You About Dasond in Your Jamatkhana
The Rise of the Aga Khan Dynasty - Part 1
Why did Aga Khan move to Portugal?
Ya Ali Madad: The Ismaili Greeting
Like our page "Rethinking Ismailism" on Facebook
Follow Inside Ismailism on Twitter
Gulshan Aalani on How a scammer used a silicone…
Msa40 on How a scammer used a silicone…
furqanali on Why I too, chose to leave Isma…
qaseem39us on How a scammer used a silicone…
Kaukab Siddique, PhD on How a scammer used a silicone…