{"search_session":{},"preferences":{"l":"en","queryLanguage":"en"},"patentId":"037-674-460-419-069","frontPageModel":{"patentViewModel":{"ref":{"entityRefType":"PATENT","entityRefId":"037-674-460-419-069"},"entityMetadata":{"linkedIds":{"empty":true},"tags":[],"collections":[{"id":11855,"type":"PATENT","title":"University of Montpellier Patent Portfolio","description":"","access":"OPEN_ACCESS","displayAvatar":true,"attested":false,"itemCount":11808,"tags":[],"user":{"id":91044780,"username":"Cambialens","firstName":"","lastName":"","created":"2015-05-04T00:55:26.000Z","displayName":"Cambialens","preferences":"{\"usage\":\"public\",\"beta\":false}","accountType":"PERSONAL","isOauthOnly":false},"notes":[{"id":8467,"type":"COLLECTION","user":{"id":91044780,"username":"Cambialens","firstName":"","lastName":"","created":"2015-05-04T00:55:26.000Z","displayName":"Cambialens","preferences":"{\"usage\":\"public\",\"beta\":false}","accountType":"PERSONAL","isOauthOnly":false},"text":"
Search Applicants and Owners separately:univ* AND Montpellier. Select more for logical variants. Add to collection. Select all patents in the collection and expand by simple families. Add to collection. Total patents: 1289
Search Applicants and Owners separately:univ* AND Montpellier. Select more for logical variants. Add to collection. Select all patents in the collection and expand by simple families. Add to collection. Total patents: 1289
(a) a global encipherment key is fixed initially;\n
(b) the fragmentable file is enciphered as a function of said global key to form a first encrypted file;\n
(c) the global key is enciphered by the processor using an asymmetric encipherment algorithm to obtain an enciphered global key;\n
(d) values representative of the enciphered global key are inserted among the fragments of said encrypted file to form a second encrypted file; and\n
(e) said second encrypted file is transmitted, wherein, in step (b), for a succession of fragments:\n
(b1) each current fragment is assigned a dynamic encryption key determined on the basis of a combination involving a group of previously encrypted fragments, wherein a linear combination is applied to the values of the previously encrypted fragments by the processor, the linear combination expressed by:\n\n {zi=(∑j=1nαjpi-j′)modXpi′=(zi+pi)modX\n
where:\n\nzi is the dynamic key value assigned to the current fragment of value pi,\nαj with j lying between 1 and n is a set of coefficients for implementing the linear combination applied to the current fragment,\np′i-j with i-j lying between i-n and i−1 is a set of values of n previously encrypted fragments,\np′i is the value of the encrypted current fragment, and\nmod X corresponds to a congruence specific to a sampling of said fragments; and\n
(b2) the value of the current fragment is allocated a value which is dependent on its initial value and on said dynamic key."],"number":1,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 1, according to which in step (d), a value representative of a signature of the fragmentable file is moreover inserted."],"number":2,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 1, wherein said linear combination involves coefficients (a) which are expressed as a function of the global key."],"number":3,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 1, wherein said linear combination involves coefficients whose sum is minimal in absolute value."],"number":4,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 1, wherein the global key comprises a succession of a first number of values,\n
and the linear combination involves a second number of previously encrypted fragments, the first number being a multiple of the second number."],"number":5,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 5, wherein said linear combination involves coefficients whose sum is minimal in absolute value, and the coefficients αj are expressed by the relation:\n{αj=βj-2l-1-1ifβj∈{0,…,2l-2},αj=±2l-1ifβj=2l-1,\nwith\nβj=∑n=1l2l-nblj-l+n.\n
where are blj−l+n successive values of the global key."],"number":6,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 5, wherein the first number is twice the second number."],"number":7,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 1, wherein said successive values of the global key are inserted into respective blocks of encrypted fragments, of the same dimensions."],"number":8,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 1, wherein said file consists of samples and each fragment is a sample or a block of samples."],"number":9,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 9, wherein the samples are pixels or voxels or temporal pixels."],"number":10,"annotation":false,"title":false,"claim":true},{"lines":["A method for secure reception of an encrypted file fragmentable into a plurality of fragments, where a processor performs the method in which:\n
a′) the encrypted file is received;\n
b′) values representative of an enciphered global key are extracted from among the fragments of said encrypted file;\n
c′) the enciphered global key is deciphered using a public key to obtain a deciphered global key;\n
d′) the encrypted fragmentable file is deciphered as a function of said deciphered global key, wherein in step b′), a dynamic encryption key specific to each current fragment is determined by the processor on the basis of a linear combination involving a group of previously decrypted fragments, the linear combination expressed by:\n\n{zi=(∑j=1nαjpi-j′)modXpi′=(zi+pi)modX \n
where:\n"],"number":11,"annotation":false,"title":false,"claim":true},{"lines":["The method as claimed in claim 11, wherein the decrypted file is verified by means of a signature inserted with the enciphered global key."],"number":12,"annotation":false,"title":false,"claim":true},{"lines":["A send/receive system comprising:\nzi is the dynamic key value assigned to the current fragment of value pi,\nαj with j lying between 1 and n is a set of coefficients for implementing the linear combination applied to the current fragment,\np′1-j with i-j lying between i-n and i−1 is a set of values of n previously encrypted fragments,\np′i is the value of the encrypted current fragment, and\nmod X corresponds to a congruence specific to a sampling of said fragments.\n
an encryption system embodied as a set of machine-executable instructions stored on a computer readable storage memory, the instructions executed by a processor, the encryption system configured to:\n
(a) fix a global encipherment key;\n
(b) encipher a fragmentable file as a function of said global key to form a first encrypted file;\n
(c) encipher the global key by means of an asymmetric encipherment algorithm to obtain an enciphered global key,\n
(d) insert values representative of the enciphered global key are inserted among the fragments of said encrypted file to form a second encrypted file; and\n
(e) transmit said second encrypted file for a succession of fragments:\n
(b1) assign each current fragment a dynamic encryption key determined on the basis of a combination involving a group of previously encrypted fragments, wherein a linear combination is applied to the values of the previously encrypted fragments, the linear combination expressed by:\n\n{zi=(∑j=1nαjpi-j′)modXpi′=(zi+pi)modX \n
where:\n\nzi is the dynamic key value assigned to the current fragment of value pi,\nαj with j lying between 1 and n is a set of coefficients for implementing the linear combination applied to the current fragment,\np′i-j with i-j lying between i-n and i−1 is a set of values of n previously encrypted fragments,\np′i is the value of the encrypted current fragment, and\nmod X corresponds to a congruence specific to a sampling of said fragments.\n
(b2) allocate the value of the current fragment depending on its initial value and on said dynamic key."],"number":13,"annotation":false,"title":false,"claim":true},{"lines":["A computer system for secure transmission of a file fragmentable into a plurality of fragments, comprising:\n
a processor;\n
a computer readable memory;\n
programming instructions stored on the computer readable memory and executed by the processor to:\n\n\n{zi=(∑j=1nαjpi-j′)modXpi′=(zi+pi)modX \ninitially fix a global encipherment key;\nencipher the fragmentable file as a function of said global key to form a first encrypted file;\nencipher the global key including an asymmetric encipherment algorithm to obtain an enciphered global key;\ninsert values representative of the enciphered global key among the fragments of said encrypted file to form a second encrypted file;\ntransmit said second encrypted file; and wherein for a succession of fragments,\nassign a dynamic encryption key to each current fragment determined on the of a combination involving a group of previously encrypted fragments, wherein a linear combination is applied by the processor to the values of the previously encrypted fragments, the linear combination expressed by:\n
where:\n"],"number":14,"annotation":false,"title":false,"claim":true}]}},"filters":{"npl":[],"notNpl":[],"applicant":[],"notApplicant":[],"inventor":[],"notInventor":[],"owner":[],"notOwner":[],"tags":[],"dates":[],"types":[],"notTypes":[],"j":[],"notJ":[],"fj":[],"notFj":[],"classIpcr":[],"notClassIpcr":[],"classNat":[],"notClassNat":[],"classCpc":[],"notClassCpc":[],"so":[],"notSo":[],"sat":[]},"sequenceFilters":{"s":"SEQIDNO","d":"ASCENDING","p":0,"n":10,"sp":[],"si":[],"len":[],"t":[],"loc":[]}}zi is the dynamic key value assigned to the current fragment of value pi,\nαj with j lying between 1 and n is a set of coefficients for implementing the linear combination applied to the current fragment,\np′i-j with i-j lying between i-n and i−1 is a set of values of n previously encrypted fragments,\np′i is the value of the encrypted current fragment, and\nmod X corresponds to a congruence specific to a sampling of said fragments; and allocate a value of the current fragment dependent on its initial value and on said dynamic key.\n