JPS605673A - Facsimile equipment - Google Patents
Facsimile equipmentInfo
- Publication number
- JPS605673A JPS605673A JP11357483A JP11357483A JPS605673A JP S605673 A JPS605673 A JP S605673A JP 11357483 A JP11357483 A JP 11357483A JP 11357483 A JP11357483 A JP 11357483A JP S605673 A JPS605673 A JP S605673A
- Authority
- JP
- Japan
- Prior art keywords
- received data
- control
- facsimile machine
- data
- facsimile
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/44—Secrecy systems
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Facsimile Transmission Control (AREA)
Abstract
Description
【発明の詳細な説明】
〔産業上の利用分野〕
この発す」は受信データに対して秘匿受信制御を行なう
ファクシミリ装置に関する。DETAILED DESCRIPTION OF THE INVENTION [Industrial Field of Application] This invention relates to a facsimile machine that performs confidential reception control on received data.
従来、ファクシミリ通信に用いられる秘匿通信方式は、
特殊な符号化方式を用いたり、符号化された’Ｉｉ’を
報にスクランブルをかける方式のものが一般的である。Conventionally, the secret communication method used for facsimile communication is
Generally, a special encoding method is used or the encoded 'Ii' is scrambled.
このような方式は、限られた送受信機の間でしか交信が
不可能であり、Ｃａ工ＴＴ規格＜７で相互交信性が高ま
ったファクシミリネットワークのＩＦ ｔｐ化の方向に
逆向するものである。またこの穏の方式は通信回ね上の
秘匿性のみを対象とするものであり、受信側のファクシ
ミ１７ 装置ｉ“Ｌでの秘匿性は考慮していない。Such a system allows communication only between a limited number of transmitters and receivers, and is in the opposite direction of the IF TP-based facsimile network, which has improved mutual communication with the CA TT standard <7. Furthermore, this modest method is intended only for the confidentiality of communication lines, and does not take into account the confidentiality of the facsimile machine 17 i"L on the receiving side.
すなわち、これらの方式では一担受信機で情報を受信し
た後には、該受イＢ様は情報の機密性の如何罠かかわら
ず全ての情報を直ちにハードコピー化してしまう。した
がって、例えば、機密ｆｉｔ報に１ニゲ係する人がｎＦ
定の受（ｉｊ時刻に受信側のファクシミリ装置の彷にい
ない：ｌ心合などには、該機密魯類はファクシミリ装置
、３の排出トレイに放置されたままの状態となり１、！
、’ｌ、：密保設上好ましくないという不都合があった
。That is, in these systems, after the information is received by the receiver, the receiver B immediately converts all the information into hard copies, regardless of the confidentiality of the information. Therefore, for example, a person who is involved in confidential fitness information is nF
If the recipient's facsimile machine is not present at the specified time, the confidential item will be left in the ejection tray of the facsimile machine.
,'l,: There was an inconvenience that it was not preferable in terms of secret storage.
この発明は上記実情に９みてなされたものであり、標準
的なファクシミリ通信方式を用いたファクシミリ装置Ｉ
ＬＪの交信において、受信側のファクシミリ装置での４
７畏密保ソ゛）を好適に図るようにしたファクシミリニ
侍ｆろ１を提供することを目的とする。This invention was made in view of the above-mentioned circumstances, and is a facsimile machine I using a standard facsimile communication system.
4 on the receiving side facsimile machine during LJ communication.
An object of the present invention is to provide a facsimile mini-SAMURAI f1 which is designed to suitably ensure security of confidentiality.
そこでこの発明では、オペレータにまり入力された秘匿
受信制御のための制御情報に基づぎ１当該フアクシミリ
装置で受信したデータを所定の態様で演算処理し、該演
３”τ処理した受信データ全適宜の記憶、α手段を用い
て記憶、なした後、オペレータが受信データのハードコ
ピー化を所望する際には、再び前記ｆｆｉ！Ｉ岬箭報を
入力することにより前記記憶した受信データを前記演３
丁処理の逆懸衆で演算処理して元の受信データに復ツケ
させ、この後所定の記へ）ヲ行なうようにしている。Therefore, in this invention, data received by the facsimile device is arithmetic-processed in a predetermined manner based on control information for confidential reception control inputted by the operator, and all of the received data subjected to the When the operator desires to convert the received data into a hard copy after storing the received data using appropriate storage and alpha means, the operator inputs the ffi! Performance 3
The arithmetic processing is performed in reverse order to restore the original received data, and then the process proceeds to a predetermined record.
前記制御情報には前記演算処理の元となる秘密コード、
秘匿受信制御を行なう時刻の範囲を示す情報、受信デー
タに対する秘匿性の重要間を示す情報などが含まれる。The control information includes a secret code that is the source of the arithmetic processing;
This information includes information indicating a time range for performing confidential reception control, information indicating an important period of confidentiality for received data, and the like.
これにより、前記制御情報にハづいて記憶部に記憶され
た受信データは該ホＩＪ ｒＱ情報を知り得るものにし
か、該受信データにλ４応したハードコピーをイー）る
ことがで・きな（なる。As a result, the received data stored in the storage unit based on the control information can only be made a hard copy corresponding to λ4 by those who can know the IJ rQ information. (Become.
以下この発明にかかるファクシミリ装置を添付図面に示
す実施例にしたがって詳＃ｌＶｃ説明する。DESCRIPTION OF THE PREFERRED EMBODIMENTS The facsimile apparatus according to the present invention will be described in detail below according to an embodiment shown in the accompanying drawings.
第１図にこの発明の一実施例を示す。第１図のファクシ
ミリ装置にはこの発明の％ Ｇ９である受信部の（７１
成のみを示しており、送信部の図示は省略した。FIG. 1 shows an embodiment of the present invention. The facsimile machine shown in FIG. 1 has a receiving section (71
Only the components are shown, and illustration of the transmitter is omitted.
第１図において、通信回線１を介して受信した受信デー
タは通常は、に］ｆｆ１ｉＪ岬変復調部１０を介して復
号化部２０に入力され、該復号化部２゜で符号化された
受信データが伐号化された後記録部３０に入力され、適
宜記Ｑが施される。前記の一般的な溝成の他に、本実施
例では操作部４０、記憶部５０および制御部６ｏのｌｉ
ｌ成によって相互文化性のある全てのファクシミリ送信
様を秘匿通信の対象機とすることを可能にした。In FIG. 1, received data received via a communication line 1 is normally input to a decoding unit 20 via a modulation/demodulation unit 10, and the received data is encoded by the decoding unit 2°. After being converted into a name, it is inputted to the recording section 30, and a note Q is applied thereto as appropriate. In addition to the general groove configuration described above, in this embodiment, the operating section 40, the storage section 50, and the control section 6o have a
With this configuration, we have made it possible for all facsimile senders with mutual cultural characteristics to be targeted for confidential communications.
操作部４０は上記秘匿通信様り姥を動作させるための制
御データを入力するための数値キー、アルファベットキ
ー、ファンクションキー等ヲ有して借成され、オペレー
タが入力した上記制御データを制御部６０のキーワード
記憶部６１に入力する。前記制御データにおけるキーワ
ードとしては以下に列記するもの等が含まれる。The operation unit 40 is provided with numeric keys, alphabet keys, function keys, etc. for inputting control data for operating the secret communication system, and the control unit 60 receives the control data input by the operator. input into the keyword storage section 61 of. Keywords in the control data include those listed below.
（１）受信時間：所定の受信データに対して秘匿通信機
能を動作させる時刻の範
囲を指定する。(1) Reception time: Specify the time range for operating the secure communication function for predetermined received data.
（２） ＩＤコード；秘匿通信を所望する相手送信機の
識別（より）コードな指定す
る。(2) ID code: Specify the identification code of the other party's transmitter with which secure communication is desired.
（３）秘密コード： ４ｙ）低通信機能を動作させる烏
合に該秘密コードを利用して受信
データを機密化し、そして同じ
秘密コードを用いて機密化した
受信データを元の受信データに
復元する。(3) Secret code: 4y) The secret code is used in the unit that operates the low communication function to make the received data confidential, and the same secret code is used to restore the confidential received data to the original received data.
のランク情報。例えば「秘」「 重要」「一般」というように３ 段階にランク分げする。Rank information. For example, “Secret” “ 3, such as “important” and “general” Divide into ranks.
次に記憶部５０は（９１Ｊえば磁気デ仁スク、磁気テー
プを記１意媒体とするものであり、制御部６０の制御に
基づき力目録部６２で加算処理した受信データを記憶し
、また同制御に基づき記憶した前記受信データを減３γ
ｔ■６３に出力する。ＦｔｆｌＪ ｒｆＪ部６０は本命
リリにかかる制御の他に通常装置全体Ｑ制「りな行なう
必要があるためにマイクロコンヒ−−りで俳成する。第
１図に示したｆｌ？！Ｉ師部６０としては、本発明に直
接かかるものとして１キ一ワード記瓜部（＋ １１減算
部６３、加算部６２のみを示した。キーワード記憶部６
１は操作部４０でオペレータが指定した［）１ｆ記ｔ１
．１ｌＩＩデータを記憶するものであり、例えばＲＡＭ
、 ０ＭＯ８等で講戎する。記憶係るりため、上記キー
ワード記憶部６エに対しては４池等でバックアップする
。Next, the storage unit 50 (91J, for example, a magnetic disk or magnetic tape is used as a storage medium) stores the received data that has been added by the force inventory unit 62 under the control of the control unit 60, and also The received data stored based on the control is reduced by 3γ.
Output to t■63. In addition to controlling the favorite Lily, the FtflJ rfJ section 60 normally performs micro-control because it is necessary to carry out Q system control for the entire device. 1 shows only the 1 keyword storage unit (+11 subtraction unit 63 and addition unit 62) as those directly related to the present invention.Keyword storage unit 6
1 is specified by the operator on the operation unit 40 [)1f t1
．． It stores 1lII data, for example, RAM
, will be lectured at 0MO8 etc. For storage purposes, the keyword storage section 6e is backed up by four storages or the like.
加算部６２、ｏ、算部６３はこの場合、説明の便宜士別
々に借成したが、これらはマイクロコンピュータの論浬
演算様能を７−ｉｆいれば、同じハードを用いてＩδ成
することができる。加算部６２は当該ファクシミリ装置
の受信データに前記制御データに秘密コードな所定の態
様で加５０．、該加算結果を記１．狂）：ｆｉＳ ５０
に記憶させる。減ｉγ部６３では前記記憶部５０にＬｊ
’Ｌ ’ＬｉＵ’、 した受信データな記録する際に、
前記加昇した受信データから前記制御データの秘７；〒
コードな前記の逆８係で減算することにより、受信デー
タを元の受信データに復帰させて伎号部２０に出力する
。In this case, the addition units 62, o, and calculation unit 63 were borrowed separately for convenience of explanation, but if the logic calculation function of a microcomputer is 7-if, they can be used to perform Iδ using the same hardware. I can do it. The adder 62 adds 50. the control data to the received data of the facsimile machine in a predetermined manner such as a secret code. , write the addition results in 1. crazy): fiS 50
to be memorized. The reduction iγ unit 63 stores Lj in the storage unit 50.
'L 'LiU', when recording the received data,
Secret 7 of the control data from the incremented received data;
The received data is restored to the original received data by subtracting it using the above-mentioned inverse 8 coefficient and is output to the signal section 20.
次に本実Ｊｌｔ、ｒｈ例装置の重す作例を説明する。Next, an example of the production of the actual Jlt and rh example apparatus will be explained.
まず、オペレータは操作部４０で当該秘匿通信に必要な
割りデータを入力する。この制御データには前述したよ
うに、相手送信機のよりコード、受信時刻の範囲、演訂
処理のための秘密コード、Ｍ要件のランク等が含まれる
。この場合前記秘密コードなｒ １２３４Ｊであるとす
る。キーワード記憶部６１で上記の制御データが記憶さ
れる。First, the operator inputs the allocation data necessary for the confidential communication using the operation unit 40. As described above, this control data includes the transmission code of the other transmitter, the reception time range, the secret code for redaction processing, the rank of M requirements, and the like. In this case, assume that the secret code is r1234J. The above control data is stored in the keyword storage section 61.
この後、当該ファクシミリ装置にデータが受信されたと
する。第２図＜＞に該受イδデータの一例を示す。なお
、第２図（ａ）ではシリアル受信データｆ！：１６進表
現で示した。Assume that data is subsequently received by the facsimile machine. An example of the received δ data is shown in FIG. In addition, in FIG. 2(a), the serial reception data f! : Shown in hexadecimal notation.
制御部６０は該受信データのよりコード、受信時刻等を
キーワード記憶部６１に記憶した前記制御データと比較
し、該受信データが秘匿通信を動作させるべきものと判
別したならば、該受信データを網制唾・変復調部工０を
介して７Ｂｌｌ師部６０の加ＪＴ部６２に取込む。該受
信データがオペレータに指定された秘匿通信を動作させ
るべきものでないと判別した場合は、網制却・変復調部
１０．Ｑ号化部２０ｇ介して記録部３゜で通常の記○を
行なう。The control unit 60 compares the code, reception time, etc. of the received data with the control data stored in the keyword storage unit 61, and if the control unit 60 determines that the received data is for operating secure communication, the control unit 60 controls the received data. It is taken into the processing JT section 62 of the 7Bll phloem 60 via the network control/modulation/demodulation section 0. If it is determined that the received data is not one that should activate the confidential communication specified by the operator, the network control/modulation/demodulation unit 10. Ordinary marking is performed in the recording section 3° via the Q coding section 20g.
加算部６２に取込まれたシリアル受゛信データは１バイ
ト単位に区切られ、第２ 膳ｒ （ｂ）に示すように前
記秘密コードｒ１２３４Ｊのそれぞれと順次サイクリッ
クに加算される。第２図（ｔ’） Ｋ示゛した値も全て
工６進表現を用いている。まず、１バイト目の受信デー
タｒ ＯＯＪは秘密コードｒ１２３４Ｊの「１」と加算
され、該加算結果ｒ ０１ 〕カ記憶部５０に記憶、へ
される。次に２バイト目の受信データ「１８」は秘密コ
ード「１２３４」の「２」と加算され、該加算結果「ｌ
Ａ」が記憶部５０に記憶、へされる。次いで、３バイト
目の受信データ「９８」は秘Ｖｆｆコード「１２３４」
の「３」と加算され、該加算結果「９Ｂ」が記憶部５０
に記憶される。次に、４バイト目の受信データ「Ｂ２」
がイ必密コード「１２３４」の「４」と加算され、該加
算結果「Ｂ６」が記憶部５０に記憶、へされる。そして
５バイト目の受イｄデータ「ｏ２」は再び秘密コードｒ
１２３４Ｊの「ｌ」と加算され、該加算結果「０３」が
記憶部５０に記憶される。以下このようなザイクリツク
な加−ｑが順次／ＩＤ算部６ｚで行なわれ、加算結果は
記’ｆＩ部５０４Ｃ記憶される。な名、この記憶の１祭
に、受信記憶データの記憶部５０における先頭アドレス
および最終アドレスなキーワード記憶部６１に記憶させ
るようにすれば記憶部５０からの読出しの際に装置ｂ１
判断し易くなる。The serial reception data taken into the adder 62 is divided into 1-byte units, and is sequentially and cyclically added to each of the secret codes r1234J as shown in the second row (b). The values shown in FIG. 2 (t') K are all expressed in hexadecimal notation. First, the first byte of received data r OOJ is added to “1” of the secret code r1234J, and the addition result r 01 is stored in the storage unit 50 . Next, the second byte of received data "18" is added to "2" of the secret code "1234", and the addition result "l"
A'' is stored in the storage unit 50. Next, the third byte of received data “98” is the secret Vff code “1234”
is added to “3”, and the addition result “9B” is stored in the storage unit 50.
is memorized. Next, the 4th byte of received data “B2”
is added to "4" of the secret code "1234", and the addition result "B6" is stored in the storage section 50. And the 5th byte received data “o2” is the secret code r again.
1234J is added, and the addition result “03” is stored in the storage unit 50. Thereafter, such similar additions are sequentially performed in the /ID calculation section 6z, and the addition results are stored in the fI section 504C. For this purpose, if the first address and the last address of the received storage data are stored in the keyword storage section 61 in the storage section 50, when reading from the storage section 50, the device b1
It becomes easier to judge.
次にオペレークが前記記・遣した受信データの出力を所
望する場合（では、オペレータは前記秘密コードｒ１２
３４Ｊを含めて１５ｆｌ Ｈ己のｉ！ｉ制御データデー
ｅ、件部４０に入力し、所定のアウトプット処理を行
なう。前記ｆｌｉｌｌ 御データは再びキーワード記憶
部６１に記憶され、制御部６０は記憶部５０にバイト区
切りに記・諭した前記受信データを減Ω部６３にｔｉｉ
Ｃ出させる。Next, when the operator desires to output the received data written/transmitted, the operator inputs the secret code r12.
15fl including 34J H's i! i Control data data e is input to the data section 40 and predetermined output processing is performed. The flill control data is stored again in the keyword storage unit 61, and the control unit 60 stores the received data written and instructed in byte units in the storage unit 50 in the Ω reduction unit 63.
Let C come out.
減算部６３に６℃込まれた受信データ（第２図（ｂ）参
照）は、該減’ＬＩ：部で受信データを被減数、前記秘
密コードｒ１２３４Ｊのそれぞれを減数どした波釘が前
記と同ｉ；」２にしてバイト単位にＪ胞次行なわれる。The received data entered into the subtraction section 63 by 6 degrees Celsius (see FIG. 2(b)) is subtracted from the received data in the subtraction section 63 by subtracting the minuend and the secret code r1234J, respectively. "i;" is set to 2 and the processing is performed in J byte units.
このｃＬ！２ ：Ｃ’；’：によって、受信データは元
の受信データに葆帰することができる。この減、！ア出
力は・ａ月化部２０に１ｌｊＫ次入力され、復号化部２
０で符号化された受信データは「黒」あるいは「白」の
２値付号に復号化されて記録部３０に入力されろ。記り
部３０で適宜の記録が施された後、受信データは初めて
ノ１−トコピー化される。This cL! 2 :C';': allows the received data to be returned to the original received data. This decrease! The a output is inputted to the a-month conversion unit 20 in 1ljK order, and the decoding unit 2
The received data encoded with 0 is decoded into a binary code of "black" or "white" and input to the recording unit 30. After being appropriately recorded in the writing section 30, the received data is converted into a notebook copy for the first time.
この゛アウトプット処理の際、もし前記秘密コードｒ１
２３４ＪＹ知らないオペレータが、受信データをハード
コピー化しようとして、他の異なる秘譜コードを入力し
たとする。この場合、前記減算部６３での誠、淳処理が
出鱈目きものとなり、出力されるハードコピーは当然側
を示した情報であるかＶＩＪ別のつかないものとなって
しまう。したがって、本ファクシミリ装置によれば、秘
密コード灯の前記制御データを知り得るものにしか、受
イムデータに対応したノ・−トコビーを得ることができ
ないようになる。During this output processing, if the secret code r1
Suppose that an operator who does not know 234JY attempts to convert the received data into a hard copy and inputs another secret code. In this case, the Makoto and Atsushi processing in the subtracting section 63 becomes a travesty, and the output hard copy is of course information indicating the side or is not marked by VIJ. Therefore, according to the present facsimile machine, only those who can know the control data of the secret code lamp can obtain the note corresponding to the received time data.
ところで、本ファクシミリ装置では限られた記憶領域の
有効利用を図るために、記憶部５゜の記憶領域がオーバ
ーフローするり化性がある場合、前記制御データに含ま
れる受信データの重要度を示す情、ｉ哉と記憶部５０に
対する記憶時刻の新旧とに基づき受信データに所定の低
先頃位ケつけ、該優先順位の低いものから１原に記憶部
５０から自動的に出力するようにしている。By the way, in order to make effective use of the limited storage area in this facsimile machine, if there is a possibility that the storage area of the storage unit 5 overflows, information indicating the importance of the received data included in the control data is , i and the newer or older storage time in the storage unit 50, the received data is assigned a predetermined priority order, and the data is automatically output from the storage unit 50 in descending order of priority.
前記録先順位はＡｉｌ述の３段階のランク分けのら合「
一般」「重要」「易」のノ＋；Ｑ ＋ｃ ＋：ｉＪ位が
高くなり、また１；己１．α時刻のカましいものほど順
位が高（なることは勿論である。したがって、本ファク
シミリ装ｆｆによれば、計先顔位の高い受信ｆ −タは
記憶部５０に長時１：）ｊ記憶を保つことができ、新し
い受（ｇデータをいつでも記憶部５０に記憶させること
ができる。The previous record ranking is based on the three-level ranking mentioned by Ail.
General", "Important", and "Easy" No +; Q +c +: iJ rank becomes high, and 1; own 1. It goes without saying that the more powerful the α time, the higher the ranking. Therefore, according to this facsimile equipment ff, the received f-ta with a higher initial position is stored in the storage unit 50 for a long time. The memory can be maintained, and new data can be stored in the storage unit 50 at any time.
なお、本実施例のＶｃ算処理では受信データを１バイト
ごとに区切った加釘処理を採用したが、該演３ｊ処棚は
勿論化の形態を採用してもよい。Note that although the Vc calculation process of this embodiment employs a dot process in which the received data is divided into 1-byte units, it is of course possible to adopt the form of a dot.
例えば、受１ａデーメの区分けは２バイトＪｐ位でもよ
く、他のビット単位を採用してもよい。また演３′ｆは
他に乗除募処理を用いてもよく、単に論理和、論理積等
を用いた方式でもよい。要はオペレータが入力する秘密
コードに基づいて受信データを適宜演算処理すればよい
のである。For example, the reception 1a deme may be divided into 2 bytes JP, or other bit units may be used. In addition, operation 3'f may also use multiplication/division processing, or may simply be a method using logical sum, logical product, or the like. The point is that the received data may be appropriately processed based on the secret code input by the operator.
また、本実施例で述べた制御データには４つの情報を含
ませるようにしたが、該制御データには効率良い記憶を
行なわせるための他の制御情報を他に含ませるようにし
てもよいことは勿論である。Further, although the control data described in this embodiment includes four pieces of information, the control data may also include other control information for efficient storage. Of course.
以上説明したように、この発明にかかるファクシミリ装
置によれば、
１）相互交信性のある全てのファクシミリ装置を秘匿通
信の対象イλ゛壱とすることができる。As described above, according to the facsimile apparatus according to the present invention, 1) all facsimile apparatuses capable of mutual communication can be used as targets for secure communication;
２）受信機に記憶させるための制御情報を知り得るもの
にしか受信データのハードコピーを得ることができない
ために、受信側のファクシミリ装置での様密保ｄを好適
に図ることができるようになる。2) Since only those who know the control information to be stored in the receiver can obtain a hard copy of the received data, it is possible to suitably maintain the security of the facsimile machine on the receiving side. Become.
等々の優れた効果を奏する。and other excellent effects.
第１図はこの発明にかかるファクシミリ装置の一実施例
を示すブロック図、第２図は第１図に示した実施例装置
の動作例を説明するだめの図である。FIG. 1 is a block diagram showing an embodiment of a facsimile apparatus according to the present invention, and FIG. 2 is a diagram for explaining an example of the operation of the embodiment shown in FIG.
Claims (8)
るための、ＩＧ作都と、前記制御情報に基づき当該ファ
クシミリ装置の受信データを所定の態様で演算処テア１
する７”ｊ＋； １０制却手段と、該第１の制御手段で
演算処理した受信データ乞記憶する記憶部と、前記制御
’Ｉｒｆ報に基づき前記記憶部で記イ、ハした受信デー
タを読出して前記第１０制呻手段の６′（算処理の逆！
四↑、美で演算処３１■シて元の受信データに復帰させ
る第２の制ｂ１り手段とを具えｌこことを特徴とするフ
ァクシミリ装置。(1) In order to control the control 117 report for the confidential reception fee b1, the data received by the facsimile device is processed in a predetermined manner based on the IG production and the control information.
7"j+; 10 control means; a storage section for storing the received data arithmetic-processed by the first control means; and a storage section for reading out the received data recorded and written in the storage section based on the control 'Irf information. 6' of the tenth groan suppressing means (reverse calculation process!
4. A facsimile machine characterized by comprising: a second control means for restoring the received data to the original received data through the arithmetic processing unit 31;
シミリ装置１ユに秘匿受信ｉ！ＩＩＪ郡な行わせる時刻
の範囲な示す’Ｉ７７報を含む４’ｆ ＊’Ｆ 請求の
範囲々Ｉ（１）項記載のファクシミ リ 装 １１イ。(2) If; II n'I blue: The bottle is secretly received by the facsimile machine 1! Facsimile equipment as set forth in Claims I(1) 11B.
秘匿受信を所見Ｊする相手ファクシミリ装］；ヱの、：
リシ別コードを示す情報を含む特許請求の？７． Ｂ月
帛１−ｔ：４記１，１′シのファクシミリ装置。(3) The above-mentioned 1blJ i'Jil '1ilI-information is sent to the other party's facsimile machine which detects confidential reception];
For patent claims that include information indicating the licence-specific code? 7. B Monthly sheet 1-t: Facsimile machine of 4th article 1, 1'.
段による演井処坪の元となる、秘密コードを示す情報を
含むム１゛）許請求の、預ＩＨＪ第（１）項記載のファ
クシミリ装ｄ０(4) The control information includes information indicating a secret code, which is the source of the εJl and the operation depth by the second control means. mounting d0
要度を示す情報を含む特許請求の範囲第（１）項記載の
ファクシミリ装置荀。(5) The facsimile machine according to claim (1), wherein the control information includes information indicating the degree of confidentiality of received data.
記憶領域が不足する当今、所定の優先順位に従って自動
的に読出されることを特徴とする特許請求の範囲第（１
）項記載のファクシミリ装置。(6) The received data stored in the storage unit is automatically read out in accordance with a predetermined priority order at a time when the storage area of the storage unit is insufficient.
) Facsimile machine described in paragraph 2.
る秘匿性の重要度に基づぎ決定される特許請求の範囲第
（６）項記載のファクシミリ装置。(7) The facsimile apparatus according to claim (6), wherein the predetermined place of death Ii is determined based on the importance of confidentiality for received data.
憶時刻の新旧に基づき決定される特許請求のヰｉ！囲ム
３（６）項記載のファクシミリ装置。(8) The predetermined priority level is determined based on the newness and oldness of storage time in the storage unit! The facsimile machine described in Box 3(6).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP11357483A JPS605673A (en) | 1983-06-23 | 1983-06-23 | Facsimile equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP11357483A JPS605673A (en) | 1983-06-23 | 1983-06-23 | Facsimile equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPS605673A true JPS605673A (en) | 1985-01-12 |
Family
ID=14615685
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP11357483A Pending JPS605673A (en) | 1983-06-23 | 1983-06-23 | Facsimile equipment |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS605673A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH02153677A (en) * | 1988-12-05 | 1990-06-13 | Canon Inc | Facsimile equipment |
| JPH0382767A (en) * | 1989-08-24 | 1991-04-08 | Mitsubishi Materials Corp | Cutting tool made of surface coated tungsten carbide-base sintered hard alloy excellent in adhesive strength of hard coating layer |
| JPH03146677A (en) * | 1989-10-30 | 1991-06-21 | Toshiba Tungaloy Co Ltd | Coated sintered hard alloy for intermittent cutting |
-
1983
- 1983-06-23 JP JP11357483A patent/JPS605673A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH02153677A (en) * | 1988-12-05 | 1990-06-13 | Canon Inc | Facsimile equipment |
| JPH0382767A (en) * | 1989-08-24 | 1991-04-08 | Mitsubishi Materials Corp | Cutting tool made of surface coated tungsten carbide-base sintered hard alloy excellent in adhesive strength of hard coating layer |
| JPH03146677A (en) * | 1989-10-30 | 1991-06-21 | Toshiba Tungaloy Co Ltd | Coated sintered hard alloy for intermittent cutting |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5479512A (en) | Method and apparatus for performing concryption | |
| CN109150499B (en) | Method and device for dynamically encrypting data, computer equipment and storage medium | |
| US3798360A (en) | Step code ciphering system | |
| US6038321A (en) | Data transfer method, communication system and storage medium | |
| EP0002389B1 (en) | Multiple domain data communication | |
| US8363838B2 (en) | Methods for the generation of identical symmetrical cryptographic keys | |
| CN103081396A (en) | Communication terminal, communication system, communication method and communication program | |
| JPS6127751B2 (en) | ||
| US4969190A (en) | Encrypting system of data | |
| CN112235299A (en) | Data encryption and decryption method, device, equipment, system and medium | |
| CN113014580A (en) | File transmission method and device, electronic equipment and storage medium | |
| JPS605673A (en) | Facsimile equipment | |
| US5761310A (en) | Communication system for messages enciphered according to an RSA-type procedure | |
| US7436966B2 (en) | Secure approach to send data from one system to another | |
| Watanabe et al. | Broadcast channels with confidential messages by randomness constrained stochastic encoder | |
| KR101839701B1 (en) | An apparatus for one-way data transmission and method thereof | |
| CA1330597C (en) | Encoding and decoding methods | |
| JPH0698179A (en) | Facsimile equipment | |
| US7607023B2 (en) | Data transfer method, data transfer apparatus, data transmission device, and data reception device | |
| CN114422230A (en) | Information transmission system based on data encryption | |
| JPH0556267A (en) | Coding and decoding method | |
| JPH07140896A (en) | File ciphering method and its device | |
| Soni | Performance Analysis of Cascaded Hybrid Symmetric Encryption Models | |
| EP1471486A2 (en) | Time based encryption algorithm | |
| CN115204320A (en) | Naive Bayes model training method, device, equipment and computer storage medium |