Patent US5613005A successfully refreshed from Google Patents.
US5613005A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cipher communication method and device
Assignee: Murata Machinery Ltd
•
Filing: 1995-07-06
•
Granted: 1997-03-18
•
Expires: 2015-07-06
Abstract
Abstract Self-synchronizing encryption/decoding circuits are provided with a plurality of irreducible polynomials. An irreducible polynomial to be used in encryption between sending and receiving stations is selected prior to cipher communication. On the sending side, the selected irreducible polynomial is used to encrypt communication information to be transmitted. On the receiving side, the selected irreducible polynomial is used to decrypt communication information that is received. Use of an irreducible polynomial as a key provides a simple structure which eliminates the effects of missing data and enables encryption and decoding with communication lines on which gaps readily occur in the data being communicated.
Inventors
- 👤 Yasuyuki Murakami
- 👤 Kazuhito Ito
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 07:18
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/12; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04L2209/00; H04L2209/08; H04L2209/30; H04L2209/34; H04L2209/80
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
109 words
A method of cipher communication between a sending station for encrypting communication information and a receiving station for decrypting communication information, the method comprising: equipping the sending station and the receiving station with a plurality of irreducible polynomials, selecting at least one irreducible polynomial from among the plurality of irreducible polynomials, the step of selecting at least one irreducible polynomial being performed by at least one of the sending station and the receiving station, using the selected irreducible polynomial to perform a self-synchronizing encryption of communication information at the sending station, and using the selected irreducible polynomial to perform a self-synchronizing decryption of communication information at the receiving station.
Claim 2
Independent Claim
109 words
A method of cipher communication between a sending station for encrypting communication information and a receiving station for decrypting communication information, the method comprising: equipping the sending station and the receiving station with a plurality of irreducible polynomials, selecting at least one irreducible polynomial from among the plurality of irreducible polynomials, the step of selecting at least one irreducible polynomial being performed by at least one of the sending station and the receiving station, using the selected irreducible polynomial to perform a self-synchronizing encryption of communication information at the sending station, and using the selected irreducible polynomial to perform a self-synchronizing decryption of communication information at the receiving station.
Claim 3
Dependent Claim
49 words
The method of claim 1, wherein communication procedure signals are established between the sending station and the receiving station, and wherein information relating to the selected irreducible polynomial is transmitted to at least one of the receiving station and the sending station in accordance with the communication procedure signals.
Claim 4
Dependent Claim
13 words
The method of claim 1, wherein the irreducible polynomial comprises a primitive polynomial.
Claim 5
Dependent Claim
44 words
The method of claim 1, wherein at least one of the sending station and the receiving station is provided with a telephone number and a specified calculation formula is provided for selecting a primitive polynomial number, constructing a primitive polynomial, and executing cipher communication.
Claim 6
Dependent Claim
80 words
A cipher communication device, comprising: memory means for storing a plurality of irreducible polynomials, selection means for selecting at least one irreducible polynomial from among the plurality of irreducible polynomials stored in the memory means, construction means for constructing at least one desired irreducible polynomial in response to the selected irreducible polynomial, and encryption/decryption means for using the desired irreducible polynomial to perform at least one of a self-synchronizing encryption of communication information and a self-synchronizing decryption of communication information.
Claim 7
Dependent Claim
80 words
A cipher communication device, comprising: memory means for storing a plurality of irreducible polynomials, selection means for selecting at least one irreducible polynomial from among the plurality of irreducible polynomials stored in the memory means, construction means for constructing at least one desired irreducible polynomial in response to the selected irreducible polynomial, and encryption/decryption means for using the desired irreducible polynomial to perform at least one of a self-synchronizing encryption of communication information and a self-synchronizing decryption of communication information.
Claim 8
Dependent Claim
25 words
The device of claim 5, wherein the selection means comprises means for selecting the at least one irreducible polynomial in response to randomly generated numbers.
Claim 9
Dependent Claim
27 words
The device of claim 5, comprising: communication procedure signal sending means for transmitting information relating to the selected irreducible polynomial in accordance with a communication procedure signal.
Claim 10
Dependent Claim
53 words
The device of claim 5, comprising: communication procedure signal receiving means for receiving information in accordance with a communication procedure signal, the selection means being responsive to the communication procedure signal receiving means for selecting the at least one irreducible polynomial in response to information received by the communication procedure signal receiving means.
Claim 11
Dependent Claim
13 words
The device of claim 5, wherein the irreducible polynomial comprises a primitive polynomial.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-03-17 | 2000-09-16 | 2001-03-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-03-17 | 2004-09-16 | 2005-03-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-03-17 | 2008-09-16 | 2009-03-18 | $7700.00 | Window Closed / Lapsed |