1. An electric connector carried by a first supporting member, cooperating with a complementary electric connector in turn carried by a second supporting member, and connectable to the complementary connector by connecting said first and said second supporting member in an assembly direction (A); said connector comprising an insulating casing defining at least one cavity for housing a respective electric terminal and having, externally, a frame member connectable to said first supporting member; characterized by comprising elastic connecting means connecting said casing to said frame member and flexible transversely with respect to said assembly direction (A) to define an angular alignment device, wherein the elastic connecting means are arranged between the frame member and casing so that outermost portions of the elastic connecting means are located at a distance inwards from outer walls forming the casing.
2. A connector as claimed in claim 1, characterized in that said elastic connecting means are flexible in a first and second displacement direction (B, C) perpendicular to each other and to said assembly direction (A) to enable said casing to move parallel to itself with respect to said frame member.
3. A connector as claimed in claim 1, characterized in that said elastic connecting means comprise at least one pair of leaf spring members connecting said frame member to opposite facing outer portions of said casing wherein at least one leaf spring member of the at least one pair of leaf spring members is located inside an opening in the casing.
4. A connector as claimed in claim 3, characterized in that each said leaf spring member comprises a first portion projecting from said frame member in said assembly direction (A) and flexible in said first displacement direction (B); a second portion fixed to said casing and flexible in said second displacement direction (C); and a third portion substantially rigidly connecting said first and said second portion.
5. A connector as claimed in claim 4, characterized in that said first portion of each said leaf spring member is of a height, measured in said first displacement direction (B), smaller than its width measured in said second displacement direction (C), so as to be flexible in said first displacement direction (B) and substantially rigid in said second displacement direction (C).
6. A connector as claimed in claim 4, characterized in that said second portion of each said leaf spring member is of a width, measured in said second displacement direction (C), smaller than its height measured in said first displacement direction (B), so as to be flexible in said second displacement direction (C) and substantially rigid in said first displacement direction (B).
7. A connector as claimed in claim 4, characterized in that said second portion of each said leaf spring member is partly fixed to the relative said outer portion of said casing, and partly engages a relative opening in the outer portion with clearance in said second displacement direction (C).
8. A connector as claimed in claim 1, characterized in that said casing and said frame member are integral with each other.
9. A connector as claimed in claim 1, characterized by comprising positioning means projecting from said casing in said assembly direction (A) and cooperating with reference means on said complementary connector to align the casing with said complementary connector with respect to said assembly direction (A) prior to actual mutual engagement of the connectors.
10. A connector as claimed in claim 9, characterized in that said positioning means comprise at least one seat formed on said casing, for receiving said reference means on said complementary connector, and having a cross section increasing in said assembly direction (A).
11. A connector as claimed in claim 10, characterized in that said seat comprises an inlet portion increasing in section in said assembly direction (A); and an end portion extending from a minimum-section end of the inlet portion in the opposite direction to said assembly direction (A), and having a substantially constant section.
12. A connector as claimed in claim 11, characterized in that said casing defines a compartment for receiving said complementary connector; and in that at least said inlet portion of said seat is formed in a projection of said casing projecting in said assembly direction from an inlet opening of said compartment.
13. A connector as claimed in claim 10, characterized in that said casing is substantially parallelepiped-shaped, and comprises four said leaf spring members carried in pairs by respective opposite outer walls of the casing; and two said seats formed in respective said outer walls and each interposed between the relative said leaf spring members.
14. A connector as claimed in claim 9, wherein the casing has a general parallel piped shape with major walls and minor walls, and the positioning means are located inwards, at a distance apart from the minor walls of the casing.
15. An electrical connector assembly comprising:
a connector adapted to be carried by a first support member; and
a complementary connector adapted to be carried by a second support member and to be connected to the connector by connection of the first and second support members in an assembly direction;
the connector comprising a casing with a cavity for an electrical terminal, an attachment section adapted for mounting the connector to the first support member, and an elastic connection member movably connecting the casing to the attachment section;
wherein the elastic connection member is restrained for allowing motion of the casing in a predetermined plane but preventing rotation of the casing relative to the assembly direction, and the elastic connection member attaches to the casing wall at a distance inwards from an adjoining casing wall.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of selectively encrypting multiple portions of data within a document, comprising the steps of:
for each portion of data within the document:
assigning the portion of data an authorization level;
a.) representing the portion of data within the document in binary format having words of X bits in length;
b.) using a computer to perform a first reversible rearrangement of the order of the bits of each word of the data portion utilizing a line from a randomly-generated reference table;
c.) using the computer to perform a second reversible rearrangement of the order of the bits of each word of the data portion from step (b) utilizing another line from the randomly-generated the reference table; and
d.) repeating steps (a)-(c) for the data portion in accordance with the assigned authorization level associated with the data portion such that the portion of the data document is wrapped with different layers of encryption corresponding to authorization levels equal to and less than the assigned authorization level.
2. The method of claim 1, wherein the portion of data within the document comprises a paragraph within the document.
3. The method of claim 1, wherein a user is authorized to decrypt data portions within the document that are at or less than the authorization level associated with the user.
4. The method of claim 1, wherein the second rearrangement is performed differently from the first rearrangement.
5. The method of claim 1, comprising the step of:
e.) generating the reference table prior to the step (a),
wherein the reference table includes a first row of m entries and r rows of n entries each.
6. The method of claim 5, wherein m, n, and r comprise prime numbers.
7. The method of claim 5, wherein step (b) comprises the step of: f.) rearranging the bits of each word utilizing the first row of the reference table.
8. The method of claim 5, wherein step (c) comprises the step of: f.) rearranging the bits of each word utilizing one of the r rows of the reference table.
9. The method of claim 8, wherein step (e) comprises the step of: g.) rearranging the bits of adjacent words utilizing successive rows of the r rows of the reference table, respectively, and wherein the first of the r rows of the reference table succeeds the last of the r rows of the reference table, during the repetition of steps (a)-(c).
10. The method of claim 5, wherein step (e) comprises the step of: f.) assigning numbers to the entries of the reference table, one number per entry, wherein the number assigned to each entry in the first row is unique within the first row, and wherein the number assigned to each entry in each of the r rows is unique within each respective row.
11. The method of claim 10, wherein step (b) comprises the steps of: g.) grouping each word of the data into m groups of bits; h.) arranging the numbers from the first row of the table into numerical order; i.) correlating each of the groups of bits with one of the numbers from the first row of the table as arranged in numerical order; and j.) rearranging the groups of bits based upon the numbers from the first row of the table as ordered in the first row of the table.
12. The method of claim 11, wherein step (g) comprises the step of: k.) grouping each word of the data into m\u22121 groups of p bits in length and one group of q bits in length, q being less than p.
13. The method of claim 10, wherein step (c) comprises the steps of: g.) grouping each word of the data into n groups of bits; h.) arranging the numbers from one of the r rows of the table into numerical order; i.) correlating each of the groups of bits with one of the numbers from the one of the r rows of the table as arranged in numerical order; and j.) rearranging the groups of bits based upon the numbers from the one of the r rows of the table as ordered in the one of the r rows of the table.
14. The method of claim 13, wherein step (g) comprises the step of: k.) grouping each word of the data into n\u22121 groups of p bits in length and one group of q bits in length, q being less than p.
15. A method of selectively encrypting multiple portions of data within a document, comprising the steps of:
for each portion of data within the document:
assigning the portion of data an authorization level;
a.) representing the portion of data within the document in binary format having words of X bits in length;
b.) using a computer to perform an XOR operation on a first data word utilizing a key and a word from a randomly-generated first noise table, wherein the noise table is represented in binary format having words of X bits in length, and wherein the key is represented in binary format having a word of X bits in length;
c.) using the computer to perform the XOR operation on successive data words utilizing an immediately preceding XOR operation result and a subsequent word from the randomly-generated noise table; and
d.) repeating steps (a)-(c) for the data portion in accordance with the assigned authorization level associated with the data portion such that the portion of the data document is wrapped with different layers of encryption corresponding to authorization levels equal to and less than the assigned authorization level.
16. The method of claim 15, wherein the portion of data within the document comprises a paragraph within the document.
17. The method of claim 15, wherein a user is authorized to decrypt data portions within the document that are at or less than the authorization level associated with the user.
18. The method of claim 15, wherein prior to performing step (b), the method comprises the step of: e.) setting the first noise table word as one of the words within the noise table.
19. The method of claim 15, comprising the step of: e.) generating the noise table prior to performing step (a), the noise table having a greater size than the data.
20. The method of claim 19, wherein step (e) comprises the steps of f.) obtaining a data sample that is at least an order of magnitude greater in size than the random character table; g.) identifying a data sub-sample within the data sample, the data sub-sample being equal in size to a random character table that is at least a predetermined number of bytes in size; h.) representing the data sub-sample in words of X bits in length; i.) performing a first rearrangement of the order of the bits in each word of the data sub-sample utilizing a reference table; j.) performing a second rearrangement of the order of the bits in each word of the data sub-sample utilizing the reference table; and k.) performing successive XOR operations on each rearranged word of the data sub-sample, respectively, utilizing the random character table.
21. The method of claim 20, wherein the data sample comprises non-repetitive data strings.
22. The method of claim 20, wherein the second rearrangement is performed differently from the first rearrangement.
23. The method of claim 20, comprising the step of: l.) generating the reference table, wherein the reference table includes a first row of m entries and r rows of n entries each.
24. The method of claim 23, wherein m, n, and r comprise prime numbers.
25. The method of claim 23, wherein step (i) comprises the step of: m.) rearranging the bits of each word utilizing the first row of the reference table.
26. The method of claim 23, wherein step (j) comprises the step of: m.) rearranging the bits of each word utilizing one of the r rows of the reference table.
27. The method of claim 26, wherein step (m) comprises the step of: n.) rearranging the bits of adjacent words utilizing successive rows of the r rows of the reference table, respectively, and wherein the first of the r rows of the reference table succeeds the last of the r rows of the reference table, during the repetition of steps (a)-(c).
28. The method of claim 23, wherein step (l) comprises the step of: m.) assigning numbers to the entries of the reference table, one number per entry, wherein the number assigned to each entry in the first row is unique within the first row, and wherein the number assigned to each entry in each of the r rows is unique within each respective row.
29. The method of claim 28, wherein step (i) comprises the steps of: n.) grouping each word of the data sub-sample into m groups of bits; o.) arranging the numbers from the first row of the table into numerical order; p.) correlating each of the groups of bits with one of the numbers from the first row of the table as arranged in numerical order; and q.) rearranging the groups of bits based upon the numbers from the first row of the table as ordered in the first row of the table.
30. The method of claim 29, wherein step (n) comprises the step of: r.) grouping each word of the data into m\u22121 groups of p bits in length and one group of q bits in length, q being less than p.
31. The method of claim 28, wherein step (j) comprises the steps of: n.) grouping each word of the data sub-sample into n groups of bits; o.) arranging the numbers from one of the r rows of the table into numerical order; p.) correlating each of the groups of bits with one of the numbers from the one of the r rows of the table as arranged in numerical order; and q.) rearranging the groups of bits based upon the numbers from the one of the r rows of the table as ordered in the one of the r rows of the table.
32. The method of claim 31, wherein step (n) comprises the step of r.) grouping each word of the data into n\u22121 groups of p bits in length and one group of q bits in length, q being less than p.
33. A method of selectively encrypting multiple portions of data within a document, comprising the steps of:
for each portion of data within the document:
assigning the portion of data an authorization level;
a.) representing the portion of data within the document in binary format having words of X bits in length;
b.) using a computer to perform a first rearrangement of the order of the bits of each word of the data portion utilizing a line from a randomly-generated reference table;
c.) using the computer to perform a second rearrangement of the order of the bits of each word of the data from step (b) utilizing another line from the randomly-generated the reference table, wherein the first and second rearrangements generate a first rearranged word and a second rearranged word;
d.) using the computer to perform an XOR operation on the first rearranged word utilizing a key and a word from a randomly-generated first noise table, wherein the noise table and key are represented in binary format having words of X bits in length and the key is represented in binary format having a word of X bits in length;
c.) using the computer to perform the XOR operation on the second rearranged word utilizing the key, a subsequent word from the randomly-generated noise table, and a result from performing the XOR operation on the first rearrange word; and
d.) repeating steps (a)-(e) for the data portion in accordance with the assigned authorization level associated with the data portion such that the portion of the data document is wrapped with different layers of encryption corresponding to authorization levels equal to and less than the assigned authorization level.
34. The method of claim 33, wherein the portion of data within the document comprises a paragraph within the document.
35. The method of claim 33, wherein a user is authorized to decrypt data portions within the document that are at or less than the authorization level associated with the user.