CN107070646B - Safe and reliable network transmission method based on password hiding - Google Patents

Safe and reliable network transmission method based on password hiding Download PDF

Info

Publication number
CN107070646B
CN107070646B CN201710034724.1A CN201710034724A CN107070646B CN 107070646 B CN107070646 B CN 107070646B CN 201710034724 A CN201710034724 A CN 201710034724A CN 107070646 B CN107070646 B CN 107070646B
Authority
CN
China
Prior art keywords
password
formula
file
sin
segment
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.)
Active
Application number
CN201710034724.1A
Other languages
Chinese (zh)
Other versions
CN107070646A (en
Inventor
朱文忠
李晓峰
徐志鸽
俞维佳
蒋特
许志聘
朱龙泽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201710034724.1A priority Critical patent/CN107070646B/en
Publication of CN107070646A publication Critical patent/CN107070646A/en
Application granted granted Critical
Publication of CN107070646B publication Critical patent/CN107070646B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H04L63/067—Network architectures or network communication protocols for network security for supporting key management in a packet data network using one-time keys
    • 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds

Abstract

A safe and reliable network transmission method based on password hiding adopts dynamic passwords to realize password hiding transmission of 'one-time pad', and comprises the following steps: (1) the file sending end executes; (2) a file sending end; (3) and a file receiving end.

Description

Safe and reliable network transmission method based on password hiding
Technical Field
The invention belongs to the field of network information security encryption transmission, and particularly relates to a security and reliability network transmission method based on password hiding.
Background
In the information environment with extremely large changes, effective utilization of mapping information and information technology can enable mapping guarantee to be timely, accurate and advanced, and the method has great significance for improving comprehensive guarantee capability. The real-time and space geographic information acquisition system is a great progress of a geographic information data acquisition means. In some emergency situations, only through a reliable and fast information transmission channel, the information can be guaranteed to be safely delivered to a receiving party, so that the receiving party can make a processing solution as early as possible. Through the research on the information transmission technology, the method and the device are beneficial to actively mastering the technology and the method for information acquisition, processing, transmission, control and use so as to promote the improvement of the efficiency, benefit and efficiency of information technology guarantee.
At present, the existing encryption technology has a lot of defects, namely, the known plaintext attack can be carried out by collecting a lot of ciphertexts and original texts, or the plaintext attack can be selected by a public key in asymmetric encryption.
Disclosure of Invention
The invention provides a safe and reliable network transmission method based on password hiding, aiming at solving the problem that a static password is easy to crack by a third party to cause information and damage.
The invention relates to a safe and reliable network transmission method based on password hiding, which adopts the technical scheme that:
the method for hiding and transmitting the passwords of the one-time pad adopts a dynamic password to realize hidden transmission of the passwords of the one-time pad, and comprises the following steps:
(1) file sender execution
(1.1) starting from the security of solving the password, constructing a safe and reliable file transmission mode;
(1.2) constructing a random fixed-length character for a password of the file encryption by using a random algorithm, and encrypting the file;
(1.3) establishing connection with a receiving party, and setting the position of the password hidden in the file by using the connection establishment time as a random parameter;
(1.4) hiding the password in the designated position of the file and then sending the password;
(2) file sending terminal
(2.1) according to the time for establishing connection between the client and the receiving end, taking an hour value hour and a minute value min of the time as random parameters;
(2.2) the password hiding position is determined by an array local, and the local array is determined by a password segment starting point begin, a password segment interval blank and a password segment size;
(2.3) using hour and min as starting points begin of the code segments according to a reference spherical refraction formula when alpha, beta and i are equal to1、i2The paraxial approximation condition can be achieved when enough hours are available:
paraxial approximation condition α ═ sin α ═ tan α, i1＝sini1(1)
β＝sinβ＝tanβ，i2＝sin i2(2)
Law of refraction n1·sin i1＝n2·sin i2(3)
Obtaining a paraxial approximate formula (4) by three formulas (1), (2) and (3):
paraxial approximation n1·i1＝n2·i2(4)
Then, the parameters alpha, beta and theta are approximated:
Figure GDA0001289162330000031
Figure GDA0001289162330000032
by substituting the parameters into the law of refraction equation
n1·α+n2·β＝(n1-n2)·θ (8)
(2.4), replacing 1/u with hour, replacing 1/v with min, wherein n1 and n2 are preset values:
the transformation becomes the formula:
Figure GDA0001289162330000034
the parameters in the above formula and the related reference spherical refraction formula are defined as: n is1Is the refractive index of air, n2Is the refractive index of the spherical medium, i1Is the angle between the incident ray and the normal of the spherical contact point, i2The angle between the refracted ray and the normal of the contact point of the spherical surface is shown, alpha is the angle between the incident ray and the horizontal plane, beta is the angle between the refracted ray and the horizontal plane, theta is the angle between the normal of the contact point of the spherical surface and the horizontal plane, point P is the intersection point of the horizontal plane passing through the center of a circle and the spherical surface, h is the distance between the contact point and the horizontal plane, delta is the distance between the projection of the point A on the horizontal line passing through the center of a circle and the point P, mu is the distance between OPs, r is the radius of a sphere, and v;
(2.5) determining the distance between each password segment by the password segment interval blank, wherein the packercount in the following formula represents the number of file packets, min is min, R, C, VtFor defining the initial value, t isAnd time, simulating a capacitor charge and discharge formula to obtain:
Figure GDA0001289162330000041
Figure GDA0001289162330000042
(2.6) determining the number of characters owned by each password segment according to the size of the password segment, blank being the value obtained in the formula (11), packing representing the number of file packages, min being min, R, C, VtTo determine the initial value of the parameter, t is time. Simulating the formula of capacitor charge and discharge
Figure GDA0001289162330000043
Figure GDA0001289162330000044
(2.7) determining the local array according to the above
local＝begin+n*(blank+size) (14)
And the password is hidden according to the obtained formula.
(3) File receiving end
(3.1) according to the time for establishing connection between the client and the receiving end, taking an hour value hour and a minute value min of the time as random parameters;
(3.2) the receiving end receives the encrypted file with the hidden password;
(3.3) resolving the password hidden in the file;
(3.4) the password hiding position is determined by an array local which is determined by a password segment starting point begin, a password segment interval blank and a password segment size;
(3.5) starting point begin of cipher segment is represented by hour and min, and referring to spherical refraction formula as alpha, beta and i1、i2The paraxial approximation condition can be achieved when enough hours are available:
paraxial approximation condition α ═ sin α ═ tan α, i1＝sin i1(15)
β＝sinβ＝tanβ，i2＝sin i2(16)
Law of refraction n1·sin i1＝n2·sin i2(17)
Obtaining a paraxial approximation formula (18) by three formulas (15), (16) and (17):
paraxial approximation n1·i1＝n2·i2(18)
Then, the parameters alpha, beta and theta are approximated:
Figure GDA0001289162330000051
Figure GDA0001289162330000052
Figure GDA0001289162330000053
the parameters are substituted into the law of refraction formula to obtain:
n1·α+n2·β＝(n1-n2)·θ (22)
replacing 1/u with hour, replacing 1/v with min, wherein n1 and n2 are preset values and are converted into a formula:
(3.6) determining the distance between each password segment by the password segment interval blank, wherein the packercount in the following formula represents the number of file packets, min is min, R, C, VtIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure GDA0001289162330000055
Figure GDA0001289162330000056
(3.7) determining the number of characters owned by each password segment according to the size of the password segment, blank is the value obtained in the formula (25), packercount represents the number of file packages, min is min, R, C and V are minutestIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure GDA0001289162330000057
Figure GDA0001289162330000061
(3.8) determining the local array according to the above
local＝begin+n*(blank+size) (28)
And analyzing the password according to the obtained formula.
The invention has the advantages that: through a technology simulating quantum encryption, the password is 'dynamic' hidden in secret-related data; in the process of each transmission, the encrypted password is randomly changed, so that the difficulty of decryption of the secret-related data is greatly increased; the one-time pad dynamic password design effectively improves the security of the password algorithm.
Drawings
FIG. 1 is a schematic diagram of a file transfer process according to the present invention
FIG. 2 is a schematic diagram of hiding a password in an encrypted file according to the present invention
FIG. 3 is a schematic diagram of resolving a password in an encrypted file according to the present invention
FIG. 4 is a schematic diagram of the spherical refraction equation
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Fig. 1 shows that the client establishes a connection with the server, and a message is sent from the host a to the host B, and the connection can be established through the path of the host a- > server- > host B, and each host does not need to listen to the port any more, but only needs to listen by the server.
Since the messages all pass through the server, the server side stores the information of the files from and to. When the user needs to receive the file, the server end can provide a receiving list according to the number of the user and encrypt and transmit the target file.
(1) File sender execution
(1.1) starting from the security of solving the password, constructing a safe and reliable file transmission mode;
(1.2) constructing a random fixed-length character for a password of the file encryption by using a random algorithm, and encrypting the file;
(1.3) establishing connection with a receiving party, and setting the position of the password hidden in the file by using the connection establishment time as a random parameter;
(1.4) hiding the password in the designated position of the file and then sending the password;
fig. 2 is a diagram of a dynamic password embedding manner based on watermark of watermark, the secure and reliable network transmission method based on password hiding described in the present invention, based on the dynamic password embedding of watermark, adopt the dynamic password, carry on the password hiding transmission of "one time pad", include the following steps specifically:
(1) a random fixed-length character is constructed by utilizing a random algorithm and is used for the password of the file encryption, and the file is encrypted
(2) According to the time for establishing connection between the client and the receiving end, the hour value hour and the minute value min of the time are used as random parameters
(2) File sending terminal
(2.1) according to the time for establishing connection between the client and the receiving end, taking an hour value hour and a minute value min of the time as random parameters;
(2.2) the password hiding position is determined by an array local, and the local array is determined by a password segment starting point begin, a password segment interval blank and a password segment size;
(2.3) using hour and min as starting points begin of the code segments according to a reference spherical refraction formula when alpha, beta and i are equal to1、i2The paraxial approximation condition can be achieved when enough hours are available:
paraxial approximation condition α ═ sin α ═ tan α, i1＝sin i1(1)
β＝sinβ＝tanβ，i2＝sin i2(2)
Law of refraction n1·sin i1＝n2·sin i2(3)
Obtaining a paraxial approximate formula (4) by three formulas (1), (2) and (3):
paraxial approximation n1·i1＝n2·i2(4)
Then, the parameters alpha, beta and theta are approximated:
Figure GDA0001289162330000081
Figure GDA0001289162330000082
Figure GDA0001289162330000083
by substituting the parameters into the law of refraction equation
n1·α+n2·β＝(n1-n2)·θ (8)
(2.4), replacing 1/u with hour, replacing 1/v with min, wherein n1 and n2 are preset values:
the transformation becomes the formula:
Figure GDA0001289162330000084
the parameters in the above formula and the related reference spherical refraction formula are defined as: n is1Is the refractive index of air, n2Is the refractive index of the spherical medium, i1Is the angle between the incident ray and the normal of the spherical contact point, i2Is the angle between the refracted ray and the normal of the spherical contact point, alpha is the angle between the incident ray and the horizontal plane, beta is the angle between the refracted ray and the horizontal plane, theta is the angle between the normal of the spherical contact point and the horizontal plane, and P is the angle between the horizontal plane passing through the center of circle and the sphereThe intersection point of the planes, h is the distance from the contact point to the horizontal plane, delta is the distance between the projection of the point A on the horizontal line passing through the center of the circle and the point P, mu is the distance between OPs, r is the radius of the sphere, and v is the distance between IPs;
(2.5) determining the distance between each password segment by the password segment interval blank, wherein the packercount in the following formula represents the number of file packets, min is min, R, C, VtIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure GDA0001289162330000091
(2.6) determining the number of characters owned by each password segment according to the size of the password segment, blank being the value obtained in the formula (11), packing representing the number of file packages, min being min, R, C, VtTo determine the initial value of the parameter, t is time. Simulating the formula of capacitor charge and discharge
Figure GDA0001289162330000093
Figure GDA0001289162330000094
(2.7) determining the local array according to the above
local＝begin+n*(blank+size) (14)
And the password is hidden according to the obtained formula.
Fig. 3 is a schematic diagram of cryptanalysis based on watermark of watermark, where the cryptanalysis method based on watermark of watermark mainly includes the following steps:
(3) file receiving end
(3.1) according to the time for establishing connection between the client and the receiving end, taking an hour value hour and a minute value min of the time as random parameters;
(3.2) the receiving end receives the encrypted file with the hidden password;
(3.3) resolving the password hidden in the file;
(3.4) the password hiding position is determined by an array local which is determined by a password segment starting point begin, a password segment interval blank and a password segment size;
(3.5) starting point begin of cipher segment is represented by hour and min, and referring to spherical refraction formula as alpha, beta and i1、i2The paraxial approximation condition can be achieved when enough hours are available:
paraxial approximation condition α ═ sin α ═ tan α, i1＝sin i1(15)
β＝sinβ＝tanβ，i2＝sin i2(16)
Law of refraction n1·sin i1＝n2·sin i2(17)
Obtaining a paraxial approximation formula (18) by three formulas (15), (16) and (17):
paraxial approximation n1·i1＝n2·i2(18)
Then, the parameters alpha, beta and theta are approximated:
Figure GDA0001289162330000101
Figure GDA0001289162330000103
the parameters are substituted into the law of refraction formula to obtain:
n1·α+n2·β＝(n1-n2)·θ (22)
replacing 1/u with hour, replacing 1/v with min, wherein n1 and n2 are preset values and are converted into a formula:
Figure GDA0001289162330000104
(3.6) determining the distance between each password segment by the password segment interval blank, wherein the packercount in the following formula represents the number of file packets, min is min, R, C, VtIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure GDA0001289162330000111
Figure GDA0001289162330000112
(3.7) determining the number of characters owned by each password segment according to the size of the password segment, blank is the value obtained in the formula (25), packercount represents the number of file packages, min is min, R, C and V are minutestIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure GDA0001289162330000113
Figure GDA0001289162330000114
(3.8) determining the local array according to the above
local＝begin+n*(blank+size) (28)
And analyzing the password according to the obtained formula.
FIG. 4 is a reference spherical refraction equation
The parameters in the reference spherical refraction formula are defined as: n is1Is the refractive index of air, n2Is the refractive index of the spherical medium, i1Is the angle between the incident ray and the normal of the spherical contact point, i2Is the angle between the refracted ray and the normal of the spherical contact point, alpha is the angle between the incident ray and the horizontal plane, beta is the angle between the refracted ray and the horizontal plane, theta is the angle between the normal of the spherical contact point and the horizontal plane, P is the intersection point of the horizontal plane passing through the center of the circle and the spherical plane, h is the distance between the contact point and the horizontal plane, and delta is the distance between A and the point A on the horizontal planeAnd the distance between the projection on the horizontal line passing through the center of the circle and the point P, mu is the distance between OPs, r is the radius of the sphere, and v is the distance between IPs.

Claims (1)

1. A safe and reliable network transmission method based on password hiding adopts dynamic passwords to realize password hiding transmission of 'one-time pad', and comprises the following steps:
(1) the file sending end executes the file;
(1.1) starting from the security of solving the password, constructing a safe and reliable file transmission mode;
(1.2) constructing a random fixed-length character for a password of the file encryption by using a random algorithm, and encrypting the file;
(1.3) establishing connection with a receiving party, and setting the position of the password hidden in the file by using the connection establishment time as a random parameter;
(1.4) hiding the password in the designated position of the file and then sending the password;
(2) a file sending end;
(2.1) according to the time for establishing connection between the client and the receiving end, taking an hour value hour and a minute value min of the time as random parameters;
(2.2) the password hiding position is determined by an array local, and the local array is determined by a password segment starting point begin, a password segment interval blank and a password segment size;
(2.3) using hour and min as starting points begin of the code segments according to a reference spherical refraction formula when alpha, beta and i are equal to1、i2The paraxial approximation condition can be achieved when enough hours are available:
paraxial approximation condition α ═ sin α ═ tan α, i1＝sin i1(1)
β＝sinβ＝tanβ，i2＝sin i2(2)
Law of refraction n1·sin i1＝n2·sin i2(3)
Obtaining a paraxial approximate formula (4) by three formulas (1), (2) and (3):
paraxial approximation n1·i1＝n2·i2(4)
Then, the parameters alpha, beta and e are approximated:
Figure FDA0002203688920000021
Figure FDA0002203688920000022
Figure FDA0002203688920000023
by substituting the parameters into the law of refraction equation
n1·α+n2·β＝(n1-n2)·θ （8)
(2.4), replacing 1/u with hour, replacing 1/v with min, wherein n1 and n2 are preset values:
the transformation becomes the formula:
Figure FDA0002203688920000024
the parameters in the above formula and the related reference spherical refraction formula are defined as: n is1Is the refractive index of air, n2Is the refractive index of the spherical medium, i1Is the angle between the incident ray and the normal of the spherical contact point, i2The angle between the refracted ray and the normal of the contact point of the spherical surface is shown, alpha is the angle between the incident ray and the horizontal plane, beta is the angle between the refracted ray and the horizontal plane, theta is the angle between the normal of the contact point of the spherical surface and the horizontal plane, point P is the intersection point of the horizontal plane passing through the center of a circle and the spherical surface, h is the distance between the contact point and the horizontal plane, delta is the distance between the projection of the point A on the horizontal line passing through the center of a circle and the point P, mu is the distance between OPs, r is the radius of a sphere, and v;
(2.5) determining the distance between each password segment by the password segment interval blank, wherein the packercount in the following formula represents the number of file packets, min is min, R, C, VtIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure FDA0002203688920000031
Figure FDA0002203688920000032
(2.6) determining the number of characters owned by each password segment according to the size of the password segment, blank being the value obtained in the formula (11), packing representing the number of file packages, min being min, R, C, VtTo determine the initial value of the parameter, t is time. Simulating the formula of capacitor charge and discharge
Figure FDA0002203688920000033
Figure FDA0002203688920000034
(2.7) determining the local array according to the above
local＝begin+n*(blank+size) (14)
Hiding the password according to the obtained formula;
(3) a file receiving end;
(3.1) according to the time for establishing connection between the client and the receiving end, taking an hour value hour and a minute value min of the time as random parameters;
(3.2) the receiving end receives the encrypted file with the hidden password;
(3.3) resolving the password hidden in the file;
(3.4) the password hiding position is determined by an array local which is determined by a password segment starting point begin, a password segment interval blank and a password segment size;
(3.5) starting point begin of cipher segment is represented by hour and min, and referring to spherical refraction formula as alpha, beta and i1、i2The paraxial approximation condition can be achieved when enough hours are available:
paraxial approximation condition α ═ sin α ═ tan α, i1＝sin i1(15)
β＝sinβ＝tanβ，i2＝sin i2(16)
Law of refraction n1·sin i1＝n2·sin i2(17)
Obtaining a paraxial approximation formula (18) by three formulas (15), (16) and (17):
paraxial approximation n1·i1＝n2·i2(18)
Then, the parameters alpha, beta and theta are approximated:
Figure FDA0002203688920000042
Figure FDA0002203688920000043
the parameters are substituted into the law of refraction formula to obtain:
n1·α+n2·β＝(n1-n2)·θ (22)
replacing 1/u with hour, replacing 1/v with min, wherein n1 and n2 are preset values and are converted into a formula:
Figure FDA0002203688920000044
(3.6) determining the distance between each password segment by the password segment interval blank, wherein the packercount in the following formula represents the number of file packets, min is min, R, C, VtIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure FDA0002203688920000051
Figure FDA0002203688920000052
(3.7) determining the number of characters owned by each password segment according to the size of the password segment, blank is the value obtained in the formula (25), packercount represents the number of file packages, min is min, R, C and V are minutestIn order to determine the initial value of the parameter, t is time, and the analog capacitor charge-discharge formula is obtained:
Figure FDA0002203688920000054
(3.8) determining the local array according to the above
local＝begin+n*(blank+size) (28)
And analyzing the password according to the obtained formula.
CN201710034724.1A 2017-01-17 2017-01-17 Safe and reliable network transmission method based on password hiding Active CN107070646B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710034724.1A CN107070646B (en) 2017-01-17 2017-01-17 Safe and reliable network transmission method based on password hiding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710034724.1A CN107070646B (en) 2017-01-17 2017-01-17 Safe and reliable network transmission method based on password hiding

Publications (2)

Publication Number Publication Date
CN107070646A CN107070646A (en) 2017-08-18
CN107070646B true CN107070646B (en) 2020-01-14

Family

ID=59598573

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710034724.1A Active CN107070646B (en) 2017-01-17 2017-01-17 Safe and reliable network transmission method based on password hiding

Country Status (1)

Country Link
CN (1) CN107070646B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108282484B (en) * 2018-01-30 2021-03-02 平安普惠企业管理有限公司 Password acquisition method and device, computer equipment and storage medium
CN110677421B (en) * 2019-09-30 2020-07-14 贵州航天云网科技有限公司 Remote operation and maintenance and data exchange method oriented to equipment industrial control safety

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101156173A (en) * 2005-04-14 2008-04-02 皇家飞利浦电子股份有限公司 Watermarking of an image motion signal
CN101976428A (en) * 2010-07-30 2011-02-16 南开大学 Binary image fragile watermark embedding and extraction method based on topology structure
CN105471811A (en) * 2014-06-19 2016-04-06 北京搜狗科技发展有限公司 Privacy space processing method and privacy space processing device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6563937B1 (en) * 2001-11-28 2003-05-13 Sony Corporation Method and apparatus to detect watermark that are resistant to arbitrary deformations
CN103873508B (en) * 2012-12-12 2016-04-13 腾讯科技（深圳）有限公司 A kind of method of hiding active set member's identifying information, server and terminal

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101156173A (en) * 2005-04-14 2008-04-02 皇家飞利浦电子股份有限公司 Watermarking of an image motion signal
CN101976428A (en) * 2010-07-30 2011-02-16 南开大学 Binary image fragile watermark embedding and extraction method based on topology structure
CN105471811A (en) * 2014-06-19 2016-04-06 北京搜狗科技发展有限公司 Privacy space processing method and privacy space processing device

Also Published As

Publication number Publication date
CN107070646A (en) 2017-08-18

Similar Documents

Publication Publication Date Title
CN100536393C (en) Secret shared key mechanism based user management method
CN104052658A (en) Privacy protection system and method based on social network
TW201616830A (en) Method, apparatus, and system for quantum key distribution, privacy amplification, and data transmission
CN106790037B (en) User mode encrypted instant messaging method and system
CN108683706B (en) Encryption algorithm based on NB-IOT cloud lock communication and verification method thereof
CN104836656B (en) A kind of storage of video file and transmission method
CN106506453B (en) Power big data transmission method and system based on quick matching and integrity detection
CN108964893B (en) Key processing method, device, equipment and medium
CN109951513A (en) Anti- quantum calculation wired home quantum cloud storage method and system based on quantum key card
CN110896401A (en) Two-dimensional code-based unidirectional data stream transmission system and method between isolated networks
CN105812366A (en) Server, anti-crawler system and anti-crawler verification method
CN107070646B (en) Safe and reliable network transmission method based on password hiding
CN110932854A (en) Block chain key distribution system and method for Internet of things
WO2023005734A1 (en) Vehicle data uploading method and apparatus, and vehicle, system and storage medium
CN108881960A (en) The method of intelligent video camera head security control and data confidentiality based on id password
CN106330432A (en) DES encryption algorithm based encryption method
CN107493283B (en) Method and system for realizing message security encryption based on live broadcast platform
CN106789845A (en) A kind of method of network data security transmission
CN104821879B (en) A kind of encryption method in electric power system data transfer
CN108650277A (en) A kind of data encryption and transmission method
CN103414703A (en) Safe subscription publishing system and method based on wireless sensor network and cloud computing
CN110213056B (en) Anti-quantum computing energy-saving communication method and system and computer equipment
CN112367165A (en) Serial port communication method and device, electronic equipment and computer readable medium
CN109495257B (en) Data acquisition unit encryption method based on improved SM2 cryptographic algorithm
CN110278077A (en) A kind of method, apparatus for obtaining electric energy meter data information, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant