专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09252957B2 Method for preventing laundering and repackaging of multimedia content in content distribution systems 有权
标题翻译：内容分发系统中防止多媒体内容的洗涤和重新包装的方法
公开(公告)号：US09252957B2
公开(公告)日：2016-02-02
申请号：US12736262
申请日：2009-04-07
申请人： Alain Durand , Marc Joye , Mohamed Karroumi , Yan-Mei Tang Talpin
发明人： Alain Durand , Marc Joye , Mohamed Karroumi , Yan-Mei Tang Talpin
IPC分类号： G06F11/30 , H04L9/32 , H04L9/08
CPC分类号： H04L9/3247 , H04L9/0836 , H04L2209/60
摘要： A method for distributing content in a content distribution system is disclosed which comprises the steps of: encrypting at a Content Packager a content using a content encryption key to generate an encrypted content; sending the content encryption key to a Licensing Authority; receiving from the Licensing Authority a distribution key containing an encryption of the content decryption key (Kc) for a given set of authorized devices; creating a secure link between the content encryption key (Kc) and the content protected by this content encryption key using a signature of the content; and distributing the encrypted content together with the signature of the content. A method for receiving content distributed according to the above-mentioned method in a device able to play back the content is also disclosed where the content signature is checked before any play back of the content.
摘要翻译：公开了一种在内容分发系统中分发内容的方法，包括以下步骤：使用内容加密密钥在内容打包机处加密内容以生成加密的内容; 将内容加密密钥发送给授权机构; 从授权机构接收包含对于给定的授权设备集合的内容解密密钥（Kc）的加密的分发密钥; 使用内容的签名在内容加密密钥（Kc）和由该内容加密密钥保护的内容之间建立安全链接; 并且将加密的内容与内容的签名一起分发。还公开了一种在能够回放内容的设备中接收根据上述方法分发的内容的方法，其中在内容的任何回放之前检查内容签名。

2. 发明申请

US20120321075A1 FAULT-RESISTANT EXPONENTIATIONI ALGORITHM 有权
标题翻译：阻抗指数算法
公开(公告)号：US20120321075A1
公开(公告)日：2012-12-20
申请号：US13487457
申请日：2012-06-04
申请人： Marc Joye , Mohamed Karroumi
发明人： Marc Joye , Mohamed Karroumi
IPC分类号： H04L9/28
CPC分类号： G06F7/723 , G06F2207/7261 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/122
摘要： A method for performing a m-ary right-to-left exponentiation using a base x, a secret exponent d and a modulus N, wherein m is a power of 2. A device having a processor and m+1 registers R[0]-R[m] in at least one memory: initializes register R[0] to h for a chosen value h, wherein the order of the value h is a divisor of m*(m−1)/2, register R[m] to x(m−1) and the registers other than R[0] and R[m] to the value h; updates register R[r] to R[r] times x, wherein r is the remainder of a division of d by (m−1) mod N; obtains a working exponent q that is the quotient of the division of d by (m−1); performs l iterations, starting at i=0, of: setting R[qi] to R[qi] times R[m] and raising R[m] to the power of m, where l is the length of q in base m and qi is the i-th digit of the representation of q in base m and ql−1 is non-zero; verifies the correctness of the result by checking that R[m] equals the product of registers R[0]-R[m−1] to the power of m−1; and outputs the product of R[l]j, where 1≦j≦m−1, only if the correctness is successfully verified.
摘要翻译：一种用于使用基数x，秘密指数d和模数N执行从右到左取幂的方法，其中m是2的幂。具有处理器并且m + 1寄存器R [0] 在至少一个存储器中的-R [m]：将寄存器R [0]初始化为h以选择值h，其中值h的顺序是m *（m-1）/ 2的除数，寄存器R [m ]到x（m-1）以及除R [0]和R [m]之外的寄存器到值h; 将寄存器R [r]更新为R [r]乘以x，其中r是d除以（m-1）mod N的余数的剩余部分; 得到一个工作指数q，即d（m-1）的除法的商; 从i = 0开始执行l次迭代，将R [qi]设置为R [qi]次R [m]，并将R [m]提高到m的幂，其中l是基本m中q的长度， qi是基数m中q的表示的第i位数，ql-1是非零; 通过检查R [m]等于寄存器R [0] -R [m-1]的乘积与m-1的幂来验证结果的正确性; 并且仅当正确性被成功验证时才输出R [1] j的乘积，其中1＆nlE; j＆nlE; m-1。

3. 发明申请

US20110016311A1 METHOD FOR PREVENTING LAUNDERING AND REPACKAGING OF MULTIMEDIA CONTENT IN CONTENT DISTRIBUTION SYSTEMS 有权
标题翻译：内容分发系统中多媒体内容的清除和重新包装的方法
公开(公告)号：US20110016311A1
公开(公告)日：2011-01-20
申请号：US12736262
申请日：2009-04-07
申请人： Alain Durand , Marc Joye , Mohamed Karroumi , Yan-Mei Tang Talpin
发明人： Alain Durand , Marc Joye , Mohamed Karroumi , Yan-Mei Tang Talpin
IPC分类号： H04L9/08
CPC分类号： H04L9/3247 , H04L9/0836 , H04L2209/60
摘要： A method for distributing content in a content distribution system is disclosed which comprises the steps of: encrypting at a Content Packager a content using a content encryption key to generate an encrypted content; sending the content encryption key to a Licensing Authority; receiving from the Licensing Authority a distribution key containing an encryption of the content decryption key (Kc) for a given set of authorized devices; creating a secure link between the content encryption key (Kc) and the content protected by this content encryption key using a signature of the content; and distributing the encrypted content together with the signature of the content. A method for receiving content distributed according to the above-mentioned method in a device able to play back the content is also disclosed where the content signature is checked before any play back of the content.
摘要翻译：公开了一种在内容分发系统中分发内容的方法，包括以下步骤：使用内容加密密钥在内容打包机处加密内容以生成加密的内容; 将内容加密密钥发送给授权机构; 从授权机构接收包含对于给定的授权设备集合的内容解密密钥（Kc）的加密的分发密钥; 使用内容的签名在内容加密密钥（Kc）和由该内容加密密钥保护的内容之间建立安全链接; 并且将加密的内容与内容的签名一起分发。还公开了一种在能够回放内容的设备中接收根据上述方法分发的内容的方法，其中在内容的任何回放之前检查内容签名。

4. 发明授权

US08700921B2 Fault-resistant exponentiation algorithm 有权
标题翻译：故障求幂算法
公开(公告)号：US08700921B2
公开(公告)日：2014-04-15
申请号：US13487457
申请日：2012-06-04
申请人： Marc Joye , Mohamed Karroumi
发明人： Marc Joye , Mohamed Karroumi
IPC分类号： H04L9/28 , H04K1/00
CPC分类号： G06F7/723 , G06F2207/7261 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/122
摘要： A method for performing a m-ary right-to-left exponentiation using a base x, a secret exponent d and a modulus N, wherein m is a power of 2. A device having a processor and m+1 registers R[0]−R[m] in at least one memory: initializes register R[0] to h for a chosen value h, wherein the order of the value h is a divisor of m*(m−1)/2, register R[m] to x(m−1) and the registers other than R[0] and R[m] to the value h; updates register R[r] to R[r] times x, wherein r is the remainder of a division of d by (m−1) mod N; obtains a working exponent q that is the quotient of the division of d by (m−1); performs l iterations, starting at i=0, of: setting R[qi] to R[qi] times R[m] and raising R[m] to the power of m, where l is the length of q in base m and qi is the i-th digit of the representation of q in base m and ql−1 is non-zero; verifies the correctness of the result by checking that R[m] equals the product of registers R[0]-R[m−1] to the power of m−1; and outputs the product of R[j]j, where 1≦j≦m−1, only if the correctness is successfully verified.
摘要翻译：一种用于使用基数x，秘密指数d和模数N执行从右到左取幂的方法，其中m是2的幂。具有处理器并且m + 1寄存器R [0] 在至少一个存储器中的-R [m]：将寄存器R [0]初始化为h以选择值h，其中值h的顺序是m *（m-1）/ 2的除数，寄存器R [m ]到x（m-1）以及除R [0]和R [m]之外的寄存器到值h; 将寄存器R [r]更新为R [r]乘以x，其中r是d除以（m-1）mod N的余数的剩余部分; 得到一个工作指数q，即d（m-1）的除法的商; 从i = 0开始执行l次迭代，将R [qi]设置为R [qi]次R [m]，并将R [m]提高到m的幂，其中l是基本m中q的长度， qi是基数m中q的表示的第i位数，ql-1是非零; 通过检查R [m]等于寄存器R [0] -R [m-1]的乘积与m-1的幂来验证结果的正确性; 并输出R [j] j的乘积，其中1＆nlE; j＆nlE; m-1，只有正确性被成功验证。

5. 发明申请

US20130091583A1 METHOD AND DEVICE FOR SECURED ENTRY OF PERSONAL DATA 有权
标题翻译：用于安全进入个人数据的方法和装置
公开(公告)号：US20130091583A1
公开(公告)日：2013-04-11
申请号：US13704377
申请日：2011-06-15
申请人： Mohamed Karroumi , Eric Diehl
发明人： Mohamed Karroumi , Eric Diehl
IPC分类号： G06F21/60
CPC分类号： G06F21/604 , G06F3/0236 , G06F3/04886 , G06F21/83 , G07F7/1041
摘要： A method for secured entry of personal data is disclosed. This method comprises for each item of personal data a first step of presentation of a virtual keyboard comprising keys and a first cursor, followed by a step of selection of a key corresponding to the item of personal data wherein the virtual keyboard also comprises at least one dummy cursor and wherein the position on the virtual keyboard of the at least one dummy cursor depends on the position of the first cursor. A device for secured entry of personal data configured to implement the method is further disclosed.
摘要翻译：公开了一种有担保输入个人资料的方法。该方法包括对于个人数据的每个项目，呈现包括密钥和第一光标的虚拟键盘的第一步骤，随后是选择对应于个人数据项的步骤的步骤，其中虚拟键盘还包括至少一个虚拟光标，并且其中所述至少一个虚拟光标的虚拟键盘上的位置取决于第一光标的位置。还公开了一种用于实现该方法的用于安全输入个人数据的设备。

6. 发明申请

US20120207300A1 Method and Device for Generating Control Words 审中-公开
标题翻译：用于生成控制字的方法和装置
公开(公告)号：US20120207300A1
公开(公告)日：2012-08-16
申请号：US13356537
申请日：2012-01-23
申请人： Mohamed Karroumi
发明人： Mohamed Karroumi
IPC分类号： H04L9/00
CPC分类号： H04L9/3236 , H04L9/0836 , H04L2209/603
摘要： The present invention relates to the generation of n control words for encryption of a content item. A device obtains a first key Kstart and a second key Kend; generates the n control words using the formula:CWi=h1 i(Kstart) ⊕h2 n-i(KEnd), i=0 . . . n−1, wherein CWi denotes 5 control word i, h1 and h2 denote one-way functions, and ⊕ denotes a combination operation; and outputs the n generated control words. The least one one-way function is preferably a hash function and the combination operation is preferably XOR.
摘要翻译：本发明涉及生成用于内容项的加密的n个控制字。设备获得第一密钥Kstart和第二密钥Kend; 使用以下公式生成n个控制字：CWi = h1 i（Kstart）⊕h2n-i（KEnd），i = 0。。。 n-1，其中CWi表示5个控制字i，h1和h2表示单向函数，⊕表示组合操作; 并输出n个生成的控制字。最少一个单向函数优选地是散列函数，并且组合操作优选为XOR。

7. 发明申请

US20120042379A1 SYSTEM AND METHOD FOR DETECTING GENUINE COPIES OF PRE-RECORDED DIGITAL MEDIA 审中-公开
标题翻译：用于检测预记录数字媒体的复制的系统和方法
公开(公告)号：US20120042379A1
公开(公告)日：2012-02-16
申请号：US13138904
申请日：2010-04-22
申请人： Eric Diehl , Mohamed Karroumi , Michel Morvan , Christophe Vincent , Ben Crosby
发明人： Eric Diehl , Mohamed Karroumi , Michel Morvan , Christophe Vincent , Ben Crosby
IPC分类号： G06F21/00
CPC分类号： G11B20/00855 , G06F21/10 , G06F21/31 , G06F2221/2103 , G06F2221/2129 , G11B20/00086 , G11B20/00094 , G11B2220/2537
摘要： To authenticate a digital medium for a given title, an authentication server selects a number of challenges corresponding to the title from an authentication database, clears an error counter and sends the challenges sequentially to an authentication application in a media reader in which the digital medium is inserted. Upon reception of a response, it is verified if the answer is correct. If this is the case, then the next challenge is sent; otherwise, it is first verified if a correct answer was mandatory and if so, it is deduced that the digital medium is not genuine. If an incorrect may be accepted, then the error counter is incremented and the next challenge is sent. When there are no more challenges to send, it is verified if the error counter is above an acceptable limit. If so, the digital medium is deemed as not genuine. The invention may be used to allow an owner of a digital medium to access further information or content.
摘要翻译：为了对给定标题的数字媒体进行认证，认证服务器从认证数据库中选择与标题相对应的挑战数量，清除错误计数器，并将挑战顺序地发送到数字媒体为媒体的媒体读取器中的认证应用插入。收到答复后，验证答案是否正确。如果是这样，那么下一个挑战就是发送; 否则，首先验证一个正确的答案是否是强制性的，如果是这样，则推断数字媒体不是真实的。如果不正确可以接受，则错误计数器递增，并发送下一个挑战。当没有更多的挑战要发送时，验证错误计数器是否高于可接受的限制。如果是这样，数字媒体被认为是不真实的。本发明可以用于允许数字媒体的所有者访问更多的信息或内容。

8. 发明授权

US08341426B2 Methods and devices for instruction level software encryption 有权
标题翻译：用于指令级软件加密的方法和设备
公开(公告)号：US08341426B2
公开(公告)日：2012-12-25
申请号：US12653224
申请日：2009-12-10
申请人： Stéphane Onno , Mohamed Karroumi , Antoine Monsifrot
发明人： Stéphane Onno , Mohamed Karroumi , Antoine Monsifrot
IPC分类号： G06F12/14
CPC分类号： G06F21/14 , G06F21/125 , G06F2221/2107 , H01L2924/30107 , H04L9/0637 , H04L9/0656 , H01L2924/00
摘要： A method of encrypting compiled computer code instructions to be decrypted instruction by instruction during execution. The computer code instructions are encrypted using a chaining mode so that an encrypted instruction depends on the values of the instruction, the value of the preceding instruction and a pseudo-random number. As it may happen that the instruction can be arrived at from more than one preceding instruction, at least one of the preceding instructions is associated with a random number compensator for use during decryption of the encrypted instruction, so that the decryption of the encrypted instruction yields the same result regardless of which the preceding instruction was. Also provided are an encryption device, a decryption device and method, and a digital support medium storing encrypted compiled computer code instructions.
摘要翻译：在执行期间通过指令加密编译的计算机代码指令以进行解密指令的方法。使用链接模式来加密计算机代码指令，使得加密指令取决于指令的值，前一条指令的值和伪随机数。可能发生的是，可以从多于一个的先前指令得到指令，所述前述指令中的至少一个与加密指令的解密期间使用的随机数补偿器相关联，从而加密指令的解密产生相同的结果，不管前面的说明是什么。还提供了加密装置，解密装置和方法以及存储加密编译的计算机代码指令的数字支持介质。

9. 发明授权

US08265271B2 Method and device for managing a transmission of keys 有权
标题翻译：用于管理密钥传输的方法和设备
公开(公告)号：US08265271B2
公开(公告)日：2012-09-11
申请号：US12312318
申请日：2007-11-06
申请人： Mohamed Karroumi , Stephane Onno , Alain Durand
发明人： Mohamed Karroumi , Stephane Onno , Alain Durand
IPC分类号： H04L9/00 , H04K1/00 , G06F21/00
CPC分类号： H04N7/165 , H04N21/234327 , H04N21/2347 , H04N21/2662 , H04N21/4405 , H04N21/63345
摘要： The present invention concerns a method and a device for encrypting an encoded scalable enhancement frame sent by an emitter to a receiver, the enhancement frame comprising a plurality of complementary streams ordered in term of quality level, each complementary stream corresponding to a combination of more than one scalability type, where a complementary stream of a lower quality level corresponds to a lower quality on each scalability type, comprising at the level of the emitter the steps of generating a key per complementary stream for encrypting said complementary stream in such a way that all scalability types can be either simultaneously or individually used, said keys being generated in such a way that only the keys of the complementary streams of quality levels lower than the quality level of a complementary stream can be obtained from the key of said complementary stream, and sending the key of a complementary stream corresponding to a required quality level to the receiver, the key permitting a receiver to generate the keys of the complementary streams of the lower quality levels only. The present invention also concerns a method and a device for decrypting a received encoded scalable enhancement frame.
摘要翻译：本发明涉及一种用于加密由发射器发送到接收机的经编码的可缩放增强帧的方法和装置，所述增强帧包括在质量级别上排序的多个互补流，每个互补流对应于多于一种可扩展性类型，其中较低质量水平的补充流对应于每种可扩展性类型的较低质量，包括在发射器的级别处产生用于加密所述互补流的每个互补流的密钥的步骤，使得所有可扩展性类型可以同时或单独使用，所述密钥以这样一种方式生成，即只能从所述互补流的密钥获得质量水平的互补流的密钥低于互补流的质量水平，以及将对应于所需质量水平的补充流的密钥发送给接收机t 他的密钥允许接收机仅产生较低质量级别的补充流的密钥。本发明还涉及一种用于解密接收的经编码的可缩放增强帧的方法和装置。

10. 发明授权

US08259934B2 Methods and devices for a chained encryption mode 有权
标题翻译：用于链接加密模式的方法和设备
公开(公告)号：US08259934B2
公开(公告)日：2012-09-04
申请号：US12592696
申请日：2009-12-01
申请人： Mohamed Karroumi , Stéphane Onno , Antoine Monsifrot
发明人： Mohamed Karroumi , Stéphane Onno , Antoine Monsifrot
IPC分类号： H04K1/00
CPC分类号： H04L9/0637 , H04L2209/24
摘要： An encryption chaining mode takes plaintext block N, generates encryption key N by combining, preferably by XOR, encryption key N-1 and plaintext block N-1 and encrypts plaintext block N using an encryption algorithm with encryption key N to output ciphertext block N. Encryption key for the first plaitnext block is generated by XOR-ing a random Initialization vector and a random intialization key K. In a preferred embodiment, initialization key K is subkeys resulting form a key schedule algorithm and encryption key N-1 is only one of the subkeys. Encryption key for the first plaintext block is generated by XOR-ing a random Initialization vector and one subkey resulting form a key schedule algorithm. Also provided is a corresponding decryption method, an encryption device, a decryption device.
摘要翻译：加密链接模式采用明文块N，优选地通过XOR，加密密钥N-1和明文块N-1组合来生成加密密钥N，并且使用具有加密密钥N的加密算法加密明文块N.以输出密文块N. 通过对随机初始化向量和随机初始化密钥K进行XOR生成，生成第一第一嵌段的加密密钥。在优选实施例中，初始化密钥K是由密钥调度算法产生的子密钥，加密密钥N-1仅为子项。第一个明文块的加密密钥是由一个随机的初始化向量和一个子密钥进行XOR生成的，形成密钥调度算法。还提供了相应的解密方法，加密装置，解密装置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式