Apparatus and method for protecting message data
US-2015188708-A1 · Jul 2, 2015 · US
US9673983B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9673983-B2 |
| Application number | US-201313764524-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 11, 2013 |
| Priority date | Sep 14, 2012 |
| Publication date | Jun 6, 2017 |
| Grant date | Jun 6, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Disclosed is a method for protecting message data. In the method, the message data is padded with padding bits generated based on a deterministic function performed on the message data. The padded message data is compressed to generate compressed data. A length of the compressed data is dependent on the padding bits. The compressed data is encrypted to generate encrypted message data.
Opening claim text (preview).
What is claimed is: 1. A method for protecting message data, comprising: padding the message data with padding bits that depend on an output generated from a hash function performed directly on the message data; compressing the padded message data to generate compressed data, wherein an variable length of the compressed data is dependent on the padding bits; and encrypting the compressed data to generate encrypted message data. 2. The method of claim 1 , wherein the message data is an input to the hash function, and the padding bits are an output of the hash function generated based on the message data. 3. The method of claim 1 , wherein the padding bits are prefixed to the message data. 4. The method of claim 1 , wherein the padding bits are constrained to allow an end of the padding bits to be determined by a receiver. 5. A remote station, comprising: means for padding message data with padding bits that depend on an output generated from a hash function performed directly on the message data; means for compressing the padded message data to generate compressed data, wherein an entire variable length of the compressed data is dependent on the padding bits; and means for encrypting the compressed data to generate encrypted message data. 6. The remote station of claim 5 , wherein the deterministic function includes a hash function, the message data is an input to the hash function, and the padding bits are an output of the hash function generated based on the message data. 7. The remote station of claim 5 , wherein the padding bits are prefixed to the message data. 8. The remote station of claim 5 , wherein the padding bits are constrained to allow an end of the padding bits to be determined by a receiver. 9. A remote station, comprising: a processor, implemented as hardware, configured to: pad message data with padding bits that depend on an output generated from a hash function performed directly on the message data; compress the padded message data to generate compressed data, wherein an entire variable length of the compressed data is dependent on the padding bits; and encrypt the compressed data to generate encrypted message data. 10. The remote station of claim 9 , wherein the message data is an input to the hash function, and the padding bits are an output of the hash function generated based on the message data. 11. The remote station of claim 9 , wherein the padding bits are prefixed to the message data. 12. The remote station of claim 9 , wherein the padding bits are constrained to allow an end of the padding bits to be determined by a receiver. 13. A non-transitory computer-readable medium, comprising: code for causing a computer to pad message data with padding bits that depend on an output generated from a hash function performed directly on the message data; code for causing a computer to compress the padded message data to generate compressed data, wherein an entire variable length of the compressed data is dependent on the padding bits; and code for causing a computer to encrypt the compressed data to generate encrypted message data. 14. The non-transitory computer-readable medium of claim 13 , wherein the message data is an input the hash function, and the padding bits are an output of the hash function generated based on the message data. 15. The non-transitory computer-readable medium of claim 13 , wherein the padding bits are prefixed to the message data. 16. The non-transitory computer-readable medium of claim 13 , wherein the padding bits are constrained to allow an end of the padding bits to be determined by a receiver.
received data contents, e.g. message integrity · CPC title
Passive attacks, e.g. eavesdropping or listening without modification of the traffic monitored · CPC title
involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC · CPC title
Electricity · mapped topic
wherein the data content is protected, e.g. by encrypting or encapsulating the payload · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.