WO2006114841A1 - Procede et systeme de traitement d’informations - Google Patents

Procede et systeme de traitement d’informations Download PDF

Info

Publication number
WO2006114841A1
WO2006114841A1 PCT/JP2005/006903 JP2005006903W WO2006114841A1 WO 2006114841 A1 WO2006114841 A1 WO 2006114841A1 JP 2005006903 W JP2005006903 W JP 2005006903W WO 2006114841 A1 WO2006114841 A1 WO 2006114841A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
xor
random number
function
information processing
Prior art date
Application number
PCT/JP2005/006903
Other languages
English (en)
Japanese (ja)
Inventor
Hidefumi Sugihara
Original Assignee
Trusted Solutions Corporation
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Trusted Solutions Corporation filed Critical Trusted Solutions Corporation
Priority to PCT/JP2005/006903 priority Critical patent/WO2006114841A1/fr
Priority to JP2007514362A priority patent/JPWO2006114841A1/ja
Publication of WO2006114841A1 publication Critical patent/WO2006114841A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/065—Encryption by serially and continuously modifying data stream elements, e.g. stream cipher systems, RC4, SEAL or A5/3
    • H04L9/0656—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher
    • H04L9/0662—Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher with particular pseudorandom sequence generator

Definitions

  • the present invention relates to an information processing method and an information processing system.
  • the Noh and Shush functions are widely used for encryption, error detection, falsification detection, and the like (for example, JP-A-2005-32130).
  • FIG. 7 is a block diagram showing a conventional information processing method.
  • This information processing method (encryption method) is the AONT (All Or Nothing Transform) method (reference: V. Boyko, "On the security properties of OAEP as an all-or-nothing transform, Advances in
  • the X and Y are combined by a predetermined method to create encrypted data for transfer.
  • An object of the present invention is to provide an information processing method and an information processing system capable of speeding up processing without reducing safety (data confidentiality).
  • the information processing method of the present invention includes generating pseudo-random data having the same data amount as the original data from random data;
  • the information processing method of the present invention preferably includes a step of generating divided data obtained by dividing the combined data into two or more.
  • the step of separating the combined data into first XOR data and second XOR data the step of separating the combined data into first XOR data and second XOR data
  • the method includes a step of calculating an exclusive OR of the random number data and the pseudo random number data to restore the original data.
  • the step of restoring the divided data force and the combined data is performed.
  • the method includes a step of calculating an exclusive OR of the random number data and the pseudo random number data to restore the original data.
  • the divided data is distributed data generated using a secret sharing method. [0022] Thereby, safety can be further improved.
  • the step of generating the combined data information that can specify a size of one of the first XOR data and the second XOR data that is input is provided. It is preferable to add to the combined data! /.
  • the first XOR data and the second XOR data are separated based on the information! preferable.
  • the information processing method of the present invention includes extracting, from predetermined encrypted data, first XOR data having the same data amount as preset original data and second XOR data other than the first XOR data;
  • the pseudo-random number data is generated from the random number data by a single arithmetic process. [0030] Thereby, it is possible to speed up the processing.
  • the pseudo-random number data is AONT (All or nothing).
  • the function is a no-chush function.
  • the information processing system of the present invention includes a pseudo random number data generation unit that generates pseudo random number data having the same data amount as the random number data force data,
  • a first arithmetic unit that calculates an exclusive OR of the pseudo-random number data and the original data to generate first XOR data
  • a function data generation unit that generates function data having the same data amount as the random number data using the first XOR data force using a predetermined function
  • a second arithmetic unit that calculates an exclusive OR of the random number data and the function data to generate second XOR data
  • a data combining unit that combines the first XOR data and the second XOR data to generate combined data.
  • the information processing system of the present invention preferably further includes a data dividing unit that generates divided data obtained by dividing the combined data into two or more.
  • a data separation unit that separates the combined data into the first XOR data and the second XOR data
  • a function data generation unit that generates the function data by using a predetermined function
  • a third arithmetic unit for calculating the exclusive OR of the second XOR data and the function data to restore the random number data
  • a pseudo random number data generation unit for generating the pseudo random number data from the random number data; It is preferable to have a fourth arithmetic unit that calculates the exclusive OR of the random number data and the pseudo random number data and restores the original data.
  • a data separator that separates the combined data into the first XOR data and the second XOR data
  • a function data generation unit that generates the function data by using a predetermined function
  • a third arithmetic unit for calculating the exclusive OR of the second XOR data and the function data to restore the random number data
  • a pseudo random number data generation unit that generates the pseudo random number data from the random number data; and a fourth arithmetic unit that calculates an exclusive OR of the random number data and the pseudo random number data to restore the original data. Preferred to have.
  • the data combination unit when the data combination unit generates the combination data, specifies a size of one of the first XOR data and the second XOR data to be input. It preferably has a function of adding information to be obtained.
  • the data combining unit when generating the combined data, specifies a size of one of the first XOR data and the second XOR data that is input. Has the function of adding information
  • the data separation unit preferably separates the first XOR data and the second XOR data based on the information.
  • FIG. 1 is a block diagram showing an embodiment of an information processing system of the present invention.
  • FIG. 2 is a block diagram showing a configuration example of a server.
  • FIG. 3 is a block diagram showing a configuration example of a client in the embodiment of the present invention.
  • FIG. 4 is a diagram showing a configuration example of server hardware in the embodiment of the present invention.
  • FIG. 5 is a flowchart showing the operation of the server.
  • FIG. 6 is a flowchart showing the operation of the client.
  • FIG. 7 is a block diagram showing a conventional information processing method.
  • FIG. 1 is a block diagram showing an embodiment of the information processing system of the present invention.
  • an information processing system 100 is used when performing data communication via an open network 30 such as an Internet line, for example, and includes a server 10 and a client 20 and.
  • FIG. 2 is a block diagram illustrating a configuration example of the server.
  • the server 10 includes a storage unit 11, a pseudo-random number data generation unit 12, a first calculation unit 13, a hash value generation unit 14, a second calculation unit 15, a data combination unit 16, a distributed data A generation unit (data division unit) 17 and an interface unit 18 are included.
  • the storage unit 11 includes data to be encrypted (hereinafter referred to as "secret data") D, such as data that needs to be kept secret, and random number data R created by a random number generator (not shown). Store various data.
  • secret data data to be encrypted
  • random number data R created by a random number generator (not shown).
  • random number means a number that occurs without any regularity.
  • the pseudo random number data generation unit 12 performs pseudo random number processing on the random number data R to generate pseudo randomness, pseudoao-random num. er Arthur ⁇ Ta PD is generated.
  • the pseudo-random number processing is a polynomial calculation computer (in this embodiment, a CP described later).
  • U101 is a process that outputs a sequence that cannot be distinguished from a random number, and the number contained in this sequence is called a (cryptographic) pseudorandom number.
  • pseudo-random numbers refer to the numbers included in a sequence obtained by deterministic calculations.
  • the pseudo random number process is a variable size distributed algorithm, and the number and size of the pseudo random number data to be generated can be arbitrarily set.
  • the above-described AONT (see FIG. 7) is used, and the hash function in the AONT is used.
  • G is replaced with the pseudo random number processing.
  • the first calculation unit 13 and the second calculation unit 15 calculate an exclusive OR (XOR) of input data.
  • the hash value generation unit 14 calculates the input data using a predetermined hash function, and generates function data (hash value) FD having the same size as the random number data R.
  • the “no” and “sh” functions are functions for summarizing a sequence of character strings such as documents and numbers into data of a fixed length (fixed length).
  • the data combining unit 16 combines a plurality of input data using a predetermined method to generate one combined data CD. Data input to the data combining unit 16 is data XPD and data XR, which will be described later.
  • the data combining unit 16 has a function of specifying the size (length) of one of the input data XPD and data XR and adding this information to the combined data CD as a header HD.
  • the header HD indicates information for specifying the size of the data XPD.
  • the distributed data generation unit (data division unit) 17 has a function of dividing the input combined data CD into a plurality of pieces (generating a plurality of pieces of divided data) by a predetermined method.
  • the distributed data generation unit 17 uses the secret sharing method (a kind of encryption method) for the input combined data CD to distribute the data Sl, S2,..., Sn (where n Is an integer greater than or equal to 2.)
  • the secret sharing method is a method of managing one secret information (secret) by distributing it to a plurality of pieces of shared information (shear).
  • this secret information is distributed and encoded into n pieces (where n is an integer of 2 or more) of distributed information (shear), and when arbitrary pieces of distributed information are collected, the original information is obtained.
  • Secret information can be restored, but the original secret information cannot be restored even if k 1 or less pieces of distributed information are collected. Also, if you look at each piece of shared information (share), you do not know the partial information of confidential information!
  • the data division method in the distributed data generation unit (data division unit) 17 is not limited to the method using the secret sharing method described above.
  • the total amount of data is 10,000 bytes.
  • X from the 1st byte to the Xth byte, X + from the 1st byte to the Yth byte, '', from the ⁇ th byte to the 10000th byte (however, 1 ⁇ ⁇ ⁇ ⁇ 10000)
  • a method that simply divides the data into 2 or 3 or more may be adopted.
  • there is an advantage that the time required for processing is shorter than that by the secret sharing method and the total size of the individual divided data is reduced.
  • the interface unit 18 transmits / receives various data such as distributed data Sl, S 2,..., Sn to / from the client 20 via the open network 30.
  • FIG. 3 is a block diagram illustrating a configuration example of the client.
  • the client 20 includes an interface unit 21, a distributed data restoration unit (divided data combining unit) 22, a hash value generation unit 24, a third calculation unit 25, a pseudo random number data generation unit 26, and a fourth calculation.
  • the interface unit 21 transmits and receives various data such as distributed data Sl, S2, ..., Sn to and from the interface unit 18 of the server 10 via the open network 30.
  • the distributed data restoration unit 22 receives the number of reconstructable pieces of distributed data Sl, S2, ⁇ , Sn, and inputs the combined data CD (header HD) from them. Restore). Here, there are cases where the combined data CD can be restored even if not all of the distributed data Sl, S2,.
  • the data separation unit 23 obtains a header from the combined data CD obtained by the distributed data restoration unit 22.
  • Data XPD and data XR are separated based on HD information.
  • the hash value generation unit 24 corresponds to the hash function of the hash value generation unit 14. A function is provided, and an operation is performed on input data using this hash function.
  • the third calculation unit 25 and the fourth calculation unit 27 calculate an exclusive OR (XOR) of the input data.
  • the pseudo random number data generation unit 26 performs the same process as the pseudo random number data generation unit 12 on the input function data FD to restore the secret data D.
  • the storage unit 28 stores various types of input data and programs necessary for various types of data processing, such as a program including an algorithm that can restore each distributed data to the combined data CD.
  • FIG. 4 is a diagram illustrating an example of a hardware configuration of a server used in the present embodiment.
  • the server 10 includes a CPU (Central Processing Unit) 101 and a ROM (Read Only Memory) 10
  • RAM Random Access Memory
  • HDD Hard Disk Drive
  • F l / F
  • the CPU 101 executes various arithmetic processes according to the program stored in the HDD 104 and controls each unit of the server 10.
  • the ROM 102 stores a basic program executed by the CPU 101 and the like.
  • the RAM 103 temporarily stores at least a part of an OS (Operating System) program application program to be executed by the CPU 101.
  • the RAM 103 stores various data necessary for processing by the CPU 101.
  • the HDD 104 stores an OS and application programs.
  • the IZF 105 changes the input format of data input from the input device 107 and inputs it, and transmits and receives data to and from the network 30 according to a predetermined protocol.
  • a monitor 111 is connected to the graphic device 106.
  • Graphics device 106 is connected to the graphic device 106.
  • An image is displayed on the screen of the monitor 111 according to a command from the CPU 101.
  • the input device 107 is composed of, for example, a keyboard and a mouse, and generates and inputs data corresponding to a user operation.
  • FIG. 4 shows a hardware configuration example of the server 10 hardware 20 Can be realized with the same hardware configuration.
  • FIG. 5 is a flowchart showing the operation of the server.
  • random number data R is input to the pseudorandom number data generation unit 12 (step Sl l).
  • the pseudo random number data generation unit 12 generates and outputs pseudo random number data PD equal to the size of the secret data D based on the input random number data R (step S 12).
  • the hash value generator 14 executes the hash function with the data XPD as input, and generates and outputs the function data FD (step S14).
  • the second computing unit 15 computes an exclusive OR of the function data FD and the random number data R, and outputs the obtained result as data XR (second XOR data) (step S15). .
  • the data combining unit 16 combines the data XR and the data XPD to generate a combined data CD, and adds information specifying the size of the data XPD as the header HD.
  • the distributed data creation unit 17 generates n distributed data Sl, S2,..., Sn with the combined data CD force (step S17).
  • the server 10 transfers the distributed data Sl, S 2,..., Sn to the transfer destination (client 20 in this embodiment) via the interface unit 18 (I / F 105) (step S 18 ).
  • the order and timing of the transfer of each distributed data can be arbitrarily set or selected, and the transfer route and transfer timing of each distributed data may be the same or different.
  • the client 20 receives some data via the interface unit 21, it performs the following processing.
  • FIG. 6 is a flowchart showing the operation of the client.
  • the distributed data restoration unit 22 tries to restore the combined data CD from the input data (step S21). If any data is restored (Yes in step S21), the data is regarded as combined data CD and the following processing is performed.
  • step S21 if the input data force cannot be restored (No in step S21), the process ends.
  • the data separation unit 23 specifies the size of the information power data XPD of the header HD, and separates the combined data CD into data XPD and data XR (step S22).
  • the hash value generation unit 24 inputs the data XPD separated in step S22, executes the hash function, and generates and outputs function data dFD (step S23).
  • the third computing unit 25 computes the exclusive OR of the generated function data dFD and data XR, and outputs the obtained result as random number data R (step S24).
  • the pseudo random number data generation unit 26 generates and outputs pseudo random number data dPD based on the random number data R obtained in step S 24 (step S 25).
  • the fourth computing unit 27 computes an exclusive OR of the data XPD and the pseudorandom data dPD, and stores the obtained data in the storage unit 28 as secret data D (step S26). .
  • the pseudo random number data generation unit 12 performs pseudo random number processing, which is far more than obtaining a hash value using a no-shush function. Pseudorandom number data that cannot be identified by a third party can be generated with a small number of operations. As a result, the processing of the server 10 can be speeded up without deteriorating the safety, so that the processing load on the server 10 can be reduced. As a result, the data processing speed of the information processing system 100 and the speed of data transmission / reception are significantly increased, and it is advantageous to cope with higher speeds. In particular, in the present invention, for example, when there is a large amount of data such as image data of a still image or a moving image, there is an advantage that the merit of powerful high speed is great.
  • the distributed data is transferred from Sano to the client.
  • the client may create the distributed data and transfer it to the server.
  • the distributed data restoration unit 22 functions as the distributed data creation unit 17
  • the data separation unit 23 functions as the data combination unit 16.
  • the restoration operation is performed in real time via the interface.
  • each created distributed data is stored in the storage unit 28 of the client 20, The secret data D may be restored arbitrarily.
  • the function to be used is not limited to the hash function.
  • the functions include various mathematical expressions.
  • the random number data R obtained using the random number generator is used.
  • the present invention is not limited to this.
  • the data obtained using the hash function for the secret data D is converted into the random number data. Can be used as R.
  • the authentication system of the present invention has been described based on the illustrated embodiment. However, the present invention is not limited to this, and the configuration of each unit is an arbitrary configuration having the same function. Can be replaced. In addition, any other component may be added to the present invention.
  • a plurality of server devices may be provided, or a plurality of client devices may be provided.
  • the information processing system of the present invention can also be applied to other uses other than the open network 30 (for example, a closed network (private line)).
  • the information processing method of the present invention can be applied, for example, when secret data stored in a storage medium in a computer is stored in another storage medium in the computer, for example.
  • a computer-readable recording medium includes a magnetic recording device, an optical disk, a magneto-optical recording medium, and a semiconductor memory.
  • Magnetic recording devices include hard disk drives (HDD), flexible disks (FD), and magnetic tapes.
  • Optical disks include DVD (Digital Versatile Disc), DVD-RAM (Random Access Memory), CD-ROM (Compact Disc Read Only Memory), CD-R (Recordable) ZRW (ReWritable), and the like.
  • Examples of magneto-optical recording media include MO (Magneto-Optical disk).
  • the secret sharing method is used as the encryption process.
  • the present invention is not limited to this.
  • a process of using key encryption after physically dividing may be used.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Storage Device Security (AREA)

Abstract

L’invention concerne un procédé et un système de traitement d’informations comprenant : une étape permettant de générer, à partir des données de nombre aléatoire R, des données de nombre pseudo-aléatoire PD ayant le même nombre de données que les données secrètes D; une étape de calcul individuel OU collectivement les données de nombre pseudo-aléatoire PD, les données secrètes D et les données de génération XPD; une étape pour générer, à partir des données XPD et en utilisant une fonction prédéfinie, les données de fonction FD ayant le même nombre de données que celles de nombre aléatoire R. L’invention comprend également une étape pour calculer individuellement ou collectivement, les données de nombre aléatoire R, les données de fonction FD et les données aléatoires de génération XR; et une étape pour concaténer les données XPD et les données de nombre aléatoire XR et générer les données concaténées CD.
PCT/JP2005/006903 2005-04-08 2005-04-08 Procede et systeme de traitement d’informations WO2006114841A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/JP2005/006903 WO2006114841A1 (fr) 2005-04-08 2005-04-08 Procede et systeme de traitement d’informations
JP2007514362A JPWO2006114841A1 (ja) 2005-04-08 2005-04-08 情報処理方法および情報処理システム

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2005/006903 WO2006114841A1 (fr) 2005-04-08 2005-04-08 Procede et systeme de traitement d’informations

Publications (1)

Publication Number Publication Date
WO2006114841A1 true WO2006114841A1 (fr) 2006-11-02

Family

ID=37214480

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2005/006903 WO2006114841A1 (fr) 2005-04-08 2005-04-08 Procede et systeme de traitement d’informations

Country Status (2)

Country Link
JP (1) JPWO2006114841A1 (fr)
WO (1) WO2006114841A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012161417A1 (fr) * 2011-05-26 2012-11-29 동국대학교 경주캠퍼스 산학협력단 Procédé et dispositif de gestion de la distribution de droits d'accès dans un environnement de nuage informatique
WO2014109059A1 (fr) * 2013-01-11 2014-07-17 株式会社日立製作所 Système et procédé de mémorisation de chiffrement de données
US9722779B1 (en) 2016-01-13 2017-08-01 ZenmuTech, Inc Computer programs, secret management methods and systems
JP6300286B1 (ja) * 2016-12-27 2018-03-28 株式会社ＺｅｎｍｕＴｅｃｈ アクセス管理システム、アクセス管理方法及びプログラム

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000045358A1 (fr) * 1999-01-28 2000-08-03 Yutaka Yasukura Procede pour assurer la securite d'informations electroniques

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2182254C (fr) * 1996-07-29 2000-02-15 Weidong Kou Format de fichier generique pour multiplicite d'exigences de securite

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2000045358A1 (fr) * 1999-01-28 2000-08-03 Yutaka Yasukura Procede pour assurer la securite d'informations electroniques

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BOYKO V. ET AL: "On the security properties of OAEP as an all-or-nothing transform.", ADVANCES IN CRYPTOLOGY-CRYPTO'99, LECTURE NOTES IN COMPUTER SCIENCE., vol. 1666, 13 October 1999 (1999-10-13), pages 503 - 518, XP001194959 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012161417A1 (fr) * 2011-05-26 2012-11-29 동국대학교 경주캠퍼스 산학협력단 Procédé et dispositif de gestion de la distribution de droits d'accès dans un environnement de nuage informatique
WO2014109059A1 (fr) * 2013-01-11 2014-07-17 株式会社日立製作所 Système et procédé de mémorisation de chiffrement de données
US9722779B1 (en) 2016-01-13 2017-08-01 ZenmuTech, Inc Computer programs, secret management methods and systems
US9780947B1 (en) 2016-01-13 2017-10-03 ZenmuTech, Inc Computer programs, secret management methods and systems
US9866374B2 (en) 2016-01-13 2018-01-09 ZenmuTech, Inc Computer programs, secret management methods and systems
JP6300286B1 (ja) * 2016-12-27 2018-03-28 株式会社ＺｅｎｍｕＴｅｃｈ アクセス管理システム、アクセス管理方法及びプログラム
WO2018124105A1 (fr) * 2016-12-27 2018-07-05 株式会社ＺｅｎｍｕＴｅｃｈ Système de gestion d'accès, procédé de gestion d'accès et programme
JP2018106026A (ja) * 2016-12-27 2018-07-05 株式会社ＺｅｎｍｕＴｅｃｈ アクセス管理システム、アクセス管理方法及びプログラム

Also Published As

Publication number Publication date
JPWO2006114841A1 (ja) 2008-12-11

Similar Documents

Publication Publication Date Title
JP3864675B2 (ja) 共通鍵暗号装置
JP3901909B2 (ja) 暗号化装置およびプログラムを記録した記録媒体
JP6019453B2 (ja) 暗号化装置、復号化装置、及びプログラム
US20120269340A1 (en) Hierarchical encryption/decryption device and method thereof
KR20070022021A (ko) 데이터 암호 처리 방법 및 장치
JP2011514091A (ja) 暗号システム
CN101218589A (zh) 从非对称私钥生成秘密密钥
US7894608B2 (en) Secure approach to send data from one system to another
Cordova et al. Comparative analysis on the performance of selected security algorithms in cloud computing
JP2006311383A (ja) データ管理方法、データ管理システムおよびデータ管理装置
Iavich et al. Comparison and hybrid implementation of blowfish, twofish and rsa cryptosystems
Ahmad et al. Distributed text-to-image encryption algorithm
WO2006114841A1 (fr) Procede et systeme de traitement d’informations
Singh et al. Comparative study of DES, 3DES, AES and RSA
JPWO2018212015A1 (ja) 秘密計算装置、比較方法、比較プログラム、および秘密計算システム
Karthik et al. Hybrid cryptographic technique using OTP: RSA
US20210226791A1 (en) Encryption system, encryption apparatus, decryption apparatus, encryption method, decryption method, and program
JP6797337B2 (ja) メッセージ認証装置、メッセージ認証方法及びメッセージ認証プログラム
Kumar et al. A novel framework for secure file transmission using modified AES and MD5 algorithms
JP7325689B2 (ja) 暗号文変換システム、変換鍵生成方法、及び、変換鍵生成プログラム
JP5489115B2 (ja) 原本性保証装置、原本性保証プログラム、及びこのプログラムを記録する記録媒体
JP4752239B2 (ja) 共通鍵暗号方法及び装置
JP3864798B2 (ja) 共通鍵暗号の復号装置
Mubasir et al. Fast Implementation of the Rivest-Shamir-Adleman (RSA) Algorithm with Robust Packet Data Loss Detection Function
Srinadh et al. Data security and recovery approach using elliptic curve cryptography

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2007514362

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

NENP Non-entry into the national phase

Ref country code: RU

WWW Wipo information: withdrawn in national office

Country of ref document: RU

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSANT TO RULE 112(1) EPC - FORM 1205A DATED 26-02-2008

122 Ep: pct application non-entry in european phase

Ref document number: 05728911

Country of ref document: EP

Kind code of ref document: A1