Author: claimsbot

1. A computer implemented method of generating a private key and a corresponding public key of a correspondent in a communication system, the correspondent having a cryptographic unit, the method comprising:
said cryptographic unit generating a digital signature;
said cryptographic unit obtaining message data;
said cryptographic unit generating a self-signed signature message by combining said message data and said digital signature; and
said cryptographic unit computing said private key using said self-signed signature message and computing said corresponding public key using said private key such that said corresponding public key is verifiable using said digital signature and said self-signed signature message;
wherein the digital signature includes an integer, and said generating said self-signed signature message by combining said message data and said digital signature includes concatenating said message data and said digital signature into said self-signed signature message; and wherein said computing said private key and said corresponding public key includes:
said cryptographic unit computing a message digest from an integer hash value of said self-signed signature message,
said cryptographic unit computing said private key from said digital signature and said message digest,
said cryptographic unit computing said corresponding public key from said private key, and
said cryptographic unit sending said corresponding public key to a certification authority with information to allow said certification authority to confirm an identity of said correspondent, and issue a certificate once said identity has been confirmed, and said certificate authority is a second computer system which is separate from a first computer system with the cryptographic unit of the correspondent.
2. The method of claim 1, further comprising:
said cryptographic unit receiving the message data from the certification authority, wherein the message data contains randomness.
3. The method of claim 2, further comprising:
said cryptographic unit sending a request message to the certification authority, and
said cryptographic unit receiving the message data from the certification authority over a secure channel,

wherein the message data is generated by the certification authority from the request message and signed with a private key of the certification authority.
4. The method of claim 1, wherein said digital signature, said private key, and said corresponding public key are generated based on a Digital Signature Algorithm (DSA).
5. The method of claim 1, wherein said digital signature, said private key, and said corresponding public key are generated based on an Elliptic Curve Digital Signature Algorithm.
6. The method of claim 1,
wherein the digital signature includes an integer, and said generating the digital signature includes:
said cryptographic unit generating an ephemeral public key,
said cryptographic unit obtaining a salt value,
said cryptographic unit computing a hash value of a pre-determined number of repetitions of a concatenation of said salt value and said ephemeral public key, and
said cryptographic unit assigning, as said integer, an integer value of said hash value.
7. The method according to claim 6 further comprising said cryptographic unit sending said corresponding public key and a certificate request to the certification authority for use by said certification authority in verifying said corresponding public key and in issuing a certification of said corresponding public key upon successful verification, wherein said certificate request comprises said self-signed signature message.
8. The method of claim 6 wherein said generating said digital signature using said cryptographic unit comprises:
obtaining an ephemeral private key k and a corresponding ephemeral public key R;
computing a first signature component r from said ephemeral public key R; and
obtaining a second signature component s;

and wherein said private key is computed according to a formula r\u22121 (sk\u2212e) mod n, wherein e is derived from said self-signed signature message and n is an order of an underlying group having a generator G.
9. The method of claim 8 wherein said group is an elliptic curve group.
10. The method of claim 9 wherein said corresponding public key is computed according to a formula r\u22121 (sR\u2212eG).
11. The method of claim 1, wherein the digital signature includes an integer, and said generating the digital signature includes:
said cryptographic unit selecting an ephemeral private key, said ephemeral private key being a value selected at random,
said cryptographic unit computing an ephemeral public key from said ephemeral private key, said ephemeral public key being a product of said ephemeral private key and an elliptic curve point, and
said cryptographic unit assigning to said integer an integer value corresponding to said ephemeral public key.
12. A method of generating a self-signed signature and a pair of keys comprising a private key d and public key Q, said method being performed by a cryptographic unit of a correspondent, said method comprising:
said cryptographic unit selecting an ephemeral private key k, said ephemeral private key k being a non-negative integer smaller than a prime number n,
said cryptographic unit computing an ephemeral public key from said ephemeral private key k, said ephemeral public key being a product of said ephemeral private key and an elliptic curve point G,
said cryptographic unit assigning an integer value corresponding to said ephemeral public key to a first signature integer r;
said cryptographic unit selecting a second signature integer s, said second signature integer being a non-negative integer smaller than the prime number n, said first signature integer r and said second signature integer s forming a signature;
said cryptographic unit obtaining message data;
said cryptographic unit generating a self-signed signature message by combining said message data and said signature;
said cryptographic unit computing a message digest e from an integer hash value of said self-signed signature message;
said cryptographic unit computing said private key d using a formula d=(s k\u2212e)r mod n;
said cryptographic unit computing said public key Q using a formula Q=d G; and
said cryptographic unit sending said public key Q to a certification authority with information to allow said certification authority to confirm an identity of said correspondent, and issue a certificate once said identity has been confirmed, and said certificate authority is a second computer system which is separate from a first computer system with the cryptographic unit of the correspondent.
13. The method of claim 12, wherein said cryptographic unit assigning the integer value comprises:
obtaining a salt value,
computing a hash value of a pre-determined number of repetitions of a concatenation of said salt value and said ephemeral public key, and
assigning an integer value of said hash value to said first signature integer r.
14. The method according to claim 12 further comprising sending said public key Q and a certificate request to the certification authority for use by said certification authority in verifying said public key Q and in issuing a certification of said public key Q upon successful verification, wherein said certificate request comprises said self-signed signature message.
15. A non-transitory computer readable medium having stored thereon computer executable instructions for generating a self-signed signature and a pair of keys comprising a private key d and public key Q, said computer executable instructions including instructions for:
selecting an ephemeral private key k, said ephemeral private key being a non-negative integer smaller than a prime number n,
computing an ephemeral public key from said ephemeral private key k, said ephemeral public key being a product of said ephemeral private key and an elliptic curve point G,
assigning an integer value corresponding to said ephemeral public key to a first signature integer r;
selecting a second signature integer s, said second signature integer s being a non-negative integer smaller than the prime number n, said first signature integer r and said second signature integer s forming a signature;
obtaining message data;
generating a self-signed signature message by combining said message data and said signature;
computing a message digest e from an integer hash value of said self-signed signature message;
computing said private key d using a formula d=(s k\u2212e)r mod n;
computing said public key Q using a formula Q=d G; and
sending said public key Q to a certification authority with information to allow said certification authority to confirm an identity of a correspondent, and issue a certificate once said identity has been confirmed, and said certificate authority is a second computer system which is separate from a first computer system with a cryptographic unit of the correspondent.
16. A method of generating from a message a private key and a triple, the triple including the message, an ephemeral public key and a public key, the method being performed by a cryptographic unit on a correspondent, said method comprising:
said cryptographic unit selecting an ephemeral private key, said ephemeral private key being an integer,
said cryptographic unit computing the ephemeral public key from said ephemeral private key, said ephemeral public key being a product of said ephemeral private key and an elliptic curve point,
said cryptographic unit computing a message digest from an integer hash value of said message and said ephemeral public key,
said cryptographic unit computing said private key from said ephemeral private key and said message digest,
said cryptographic unit computing said public key from said message digest and said ephemeral public key, and
said cryptographic unit sending said corresponding public key to a certification authority with information to allow said certification authority to confirm an identity of said correspondent, and issue a certificate once said identity has been confirmed, and said certificate authority is a second computer system which is separate from a first computer system with the cryptographic unit of the correspondent.
17. The method according to claim 16 further comprising sending said public key and a certificate request to the certification authority for use by said certification authority in verifying said public key and in issuing a certification of said public key upon successful verification.
18. A non-transitory computer readable medium having stored thereon a program executable on a computer, the program implementing a method of generating from a message a private key and a triple, the triple including the message, an ephemeral public key and a public key, the program causing a cryptographic unit of a correspondent to:
select an ephemeral private key, said ephemeral private key being an integer selected in random,
compute the ephemeral public key from said ephemeral private key, said ephemeral public key being a product of said ephemeral private key and an elliptic curve point,
compute a message digest from an integer hash value of said message and said ephemeral public key,
compute said private key from said ephemeral private key and said message digest,
compute said public key from said message digest and said ephemeral public key, and
send said corresponding public key to a certification authority with information to allow said certification authority to confirm an identity of said correspondent, and issue a certificate once said identity has been confirmed, and said certificate authority is a second computer system which is separate from a first computer system with the cryptographic unit of the correspondent.
19. A device comprising a correspondent having a cryptographic unit configured to perform the method of claim 6.
20. A device comprising a correspondent having a cryptographic unit configured to perform the method of claim 12.
21. A device comprising a correspondent having a cryptographic unit configured to perform the method of claim 16.
22. A device comprising a correspondent having a cryptographic unit configured to perform the method of claim 8.
23. A non-transitory computer readable medium having stored thereon a program executable on a computer for performing the method of claim 8.

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 for the removal of airborne molecular contaminants (AMC) from a substrate, comprising:
providing a purified purge gas, wherein the purified purge gas comprises water, the purified purge gas having an AMC concentration less than about 1 part per billion (ppb) on a volume basis;
contacting at least a portion of the substrate with the purified purge gas;
producing a contaminated purge gas by transferring AMC from the substrate into the purified purge gas; and
removing the contaminated purge gas from the substrate,
wherein the water in the purified purge gas is in an amount sufficient to remove AMC from the substrate at a faster rate than the method using a nitrogen purge gas.
2. The method of claim 1 wherein the amount of water in the purified purge gas is less than about 100 parts per million on a volume basis.
3. The method of claim 1 wherein the AMC includes at least one of hydrocarbons, Si containing organics, NOx, SOx, and amines.
4. The method of claim 3 wherein the amount of water in the purified purge gas is at least about 100 parts per million on a volume basis.
5. The method of claim 1 wherein the steps of contacting and producing are performed at a temperature above ambient temperature.
6. The method of claim 5 wherein the amount of water in the purified purge gas is at least about 100 parts per million on a volume basis.
7. The method of claim 1 further comprising purging of the substrate with an inert gas after removing the contaminated purge gas from the substrate.
8. The method of claim 7 wherein the inert gas includes at least one of nitrogen, argon, noble gases, and methane.
9. The method of claim 1 wherein the substrate is enclosed within a chamber.
10. The method of claim 9 wherein the substrate includes at least one silicon substrate.
11. The method of claim 9 wherein the substrate includes a wafer.
12. The method of claim 1 wherein the substrate is contaminated with AMC before the substrate is contacted with purified purge gas.

1. In an RF access control system, a method for providing indications of the state of a Wireless Access Point Module (WAPM) to an observer, said WAPM having at least one indicator and fixedly positioned adjacent a single access point, said method including the steps of: providing an indication of the version of software installed on said WAPM using said at least one indicator.
2. The method of claim 1 wherein said WAPM includes a lock, said method further including the step of providing an indication that said lock is relocking.
3. The method of claim 1 further including the step of providing an indication that said WAPM is sending a link request looking for a WPIM.
4. The method of claim 1 further including the step of providing an indication that said WAPM is engaged in an error test with a WAPM.
5. The method of claim 1 further including the step of providing an indication that said WAPM has successfully linked with a WPIM.
6. The method of claim 1 further including the step of providing an indication that said WAPM has not received communication from a WPIM within a specified time interval.
7. In an RF access control system, a method for providing indications of the state of a Wireless Access Point Module (WAPM) to an observer, said WAPM having at least one indicator and fixedly positioned adjacent a single access point, said method including the steps of:
providing an indication of the version of software installed on said WAPM using said at least one indicator, wherein said WAPM receives data from a card reader, said method further including the step of providing an indication that said WAPM has received data form a card reader.
8. The method of claim 7 further including the step of providing an indication that said WAPM does not understand data received from said card reader.
9. The method of claim 7 further including the step of providing an indication that access through the WAPM has been granted in response to said data from said card reader.
10. The method of claim 7 further including the step of providing an indication that access through the WAPM has been denied in response to said data from said card reader.
11. An RF access control system for controlling access to an access point, the control system including:
an access control panel operable to make access decisions for the access point;
a wireless panel interface module (WPIM) in communication with the access control panel and including a transceiver operable to send and receive access signals; and
a Wireless Access Point Module (WAPM) fixedly positioned adjacent the access point and in communication with the wireless panel interface module, said WAPM having installed software, said WAPM providing an indication to an observer of the version of software installed on said WAPM using said at least one indicator.
12. The system of claim 11 further including: a lock for securing said WAPM, wherein said at least one indicator provides an indication that said lock is relocking.
13. The system of claim 11, wherein said at least one indicator provides an indication that said WAPM is sending a link request looking for said WPIM.
14. The system of claim 13 wherein said at least one indicator provides an indication that said WAPM is engaged in an error test with said WPIM.
15. The system of claim 13 wherein said at least one indicator provides an indication that said WAPM has successfully linked with said WPIM.
16. The system of claim 13 wherein said at least one indicator provides an indication that said WAPM has not received communication from said WPIM within a specified time interval.
17. An RF access control system for controlling access to an access point, the control system including:
an access control panel operable to make access decisions for the access point;
a wireless panel interface module (WPIM) in communication with the access control panel and including a transceiver operable to send and receive access signals;
a Wireless Access Point Module (WAPM) fixedly positioned adjacent the access point and in communication with the wireless panel interface module, said WAPM having installed software, said WAPM providing an indication to an observer of the version of software installed on said WAPM using said at least one indicator; and
a card reader, said card reader providing data to said WAPM, wherein said at least one indicator provides an indication that said WAPM has received data from a card reader.
18. The system of claim 17 wherein said at least one indicator provides an indication that said WAPM does not understand data received from said card reader.
19. The system of claim 17 wherein said at least one indicator provides an indication that access through the WAPM has been granted in response to said data from said card reader.
20. The system of claim 17 wherein said at least one indicator provides an indication that access through the WAPM has been denied in response to said data from said card reader.

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 determining a data dictionary for data dictionary compression, the method comprising:
receiving, by a processor, statistical information about a data set included in a column of a data table;
receiving, by the processor, additional information about the data set that indicates one or both of a data format utilized by the data set and a type of information represented by the data set; and
generating, by the processor, a data dictionary for compression of the data set based, at least in part, on the statistical information and the additional information, wherein the data dictionary is generated such that the data dictionary is capable of compressing data that is statistically predicted to be received at a future point.
2. The method of claim 1, the method further comprising:
analyzing, by the processor, retrieved data from one or more sources to provide information about one or more aspects of the data set, wherein the retrieved data includes one or more of: metadata, database statistics, data profiling, and user input; and
generating, by the processor, at least a portion of the additional information based, at least in part, on a result of that analysis.
3. The method of claim 1, wherein the additional information about the data set includes at least one of: data constraints, declared data types, inferred data types, expressions included in the data set, patterns identified in the data set, monotony of values in the data set, variability of values in the data set, value ranges in the data set, excluded value ranges in the data set, and growth range of values in the data set.
4. The method of claim 1, wherein the data dictionary is configured to support both data compression and one or more of: arithmetic operations, order preservation, and fixed length encoding.
5. The method of claim 1, the method further comprising:
predicting, by the processor, one or both of a type of data and a quantity of that data that will be received at a later time; and
modifying, by the processor, the data dictionary such that the data dictionary is configured to accommodate one or both of the type of data and the quantity of that data that is predicted to be received.
6. The method of claim 1, the method further comprising:
determining, by the processor, a number of values included in the data set;
determining, by the processor, whether the number at least meets a threshold that indicates a minimum quantity of values needed to build the data dictionary; and
responsive to a determination that the number is below the threshold, building, by the processor, the data dictionary based, at least in part, on a number of common suffixes that are included in the data set.
7. The method of claim 1, the method further comprising:
compressing, by the processor, the data set based, at least in part, on the data dictionary, wherein the data dictionary is a columnar dictionary that is configured to reduce encoding and decoding costs of the data set by exploiting metadata about data that is included in a column that is compressed.