CN108173643A - A kind of efficient key common recognition transmission method - Google Patents

A kind of efficient key common recognition transmission method Download PDF

Info

Publication number
CN108173643A
CN108173643A CN201611018455.1A CN201611018455A CN108173643A CN 108173643 A CN108173643 A CN 108173643A CN 201611018455 A CN201611018455 A CN 201611018455A CN 108173643 A CN108173643 A CN 108173643A
Authority
CN
China
Prior art keywords
dimensional vectors
common recognition
calculates
dimensional
vector
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.)
Granted
Application number
CN201611018455.1A
Other languages
Chinese (zh)
Other versions
CN108173643B (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.)
Shanghai Hu min block chain science and Technology Co., Ltd.
Original Assignee
赵运磊
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 赵运磊 filed Critical 赵运磊
Priority to CN201611018455.1A priority Critical patent/CN108173643B/en
Publication of CN108173643A publication Critical patent/CN108173643A/en
Application granted granted Critical
Publication of CN108173643B publication Critical patent/CN108173643B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0838Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0863Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords

Abstract

The present invention provides a kind of efficient key common recognition transmission method, including:SenderSecret information k is determined in advance1∈ { 0,1 }.There are one four dimensional vectors of secret inputRecipientThere are one four dimensional vectors of secret inputWhereinWithThe value distance of respective dimensions is close;Encode and toTransmit a four dimension coding information ByWithDecoding obtains k2=k1

Description

A kind of efficient key common recognition transmission method
Technical field
The present invention relates to password and coding techniques field, specifically, being related to a kind of efficient key common recognition transmission method.
Background technology
With the fast development of quantum computer, the password and encryption algorithm for developing anti-quantum attack become more and more to compel It cuts.Lattice, is based particularly on LWE and RLWE problems, and novel cipher system is the mainstream technology of rear quantum cryptography.Based on LWE How nucleus module with the cryptographic system of RLWE (particularly public key encryption, key agreement etc.) is from closer to the distance but not Reach secret common recognition and transmission in equal value.There are inefficient, error rate are high, practical for existing secret common recognition and transfer scheme Property it is poor the shortcomings of, the secret common recognition and transfer approach of Development of Novel have in great industry and application value, are to lead and account for According to the core technology of international information-security industry commanding elevation.
Give two four dimensional vectorsWithDefinition I.e. to vectorRound up per one-dimensional, whereinIt is to round up Operator, the single order norm of definition vectorDefinitionFor quadravalence square formation. Set ZqIt can be represented with two methods:Or Wherein It is downward rounding operation symbol.For arbitrary integer x ∈ Z, define | x |q=min { x mod q, q-x mod q };For arbitrary Four dimensional vectors Definition
Invention content
To solve the above problems, the present invention provides a kind of efficient key common recognition transmission method, inventive method reaches The upper bound of the attainable efficiency of key common recognition transmission method institute is the first secret common recognition for reaching the efficiency upper bound and to transmit in the world Method.In order to reduce out rate, we reach secret common recognition and the transmission of one with four-dimensional information;Inventive method can be used for Build the public key encryp the most efficient based on RLWE so far.The method includes:
Systematic parameter:Params=(q, m, g, d), wherein q, m, g, d are positive integer, are met:M >=2, q >=g > 2,0≤ D < q (1-1/g) -2;Typically, q is prime number;It enables WithFor the four-dimension Column vector;Systematic parameter can be consulted to decide by the user in system or be determined or by can by using the process of inventive method Letter third party gives.
Give two four dimensional vectorsWithDefinition I.e. to vectorRound up per one-dimensional, whereinIt is the fortune that rounds up Operator, the single order norm of definition vectorDefinitionIt enables For quadravalence Square formation;For arbitrary integer x ∈ Z, define | x |q=min { x mod q, q-x mod q };For arbitrary four dimensional vectorWhereinOr Be to Lower rounding operation symbol, definition
Two users (can be equipment, program etc.) in system, the initiator for running inventive method is denoted asOperation side The respondent of method is denoted asThere are one four dimensional vectors of secret input With secret information k1 ∈ { 0,1 };There are one four dimensional vectors of secret input Meet Inventive method will causeWithReach identical key common recognition k1=k2∈ { 0,1 }, wherein k2It will be byIt is calculated.For this purpose, ToThe four-dimensional vector information of transmission oneSpecifically:
Sender's coding method:It is calculated as followsIt and willIt sends to
Step 1:It calculates
Step 2:It calculates and checks:IfB=0 is then enabled, otherwise enables b=1;Note
Step 3:It calculates
Step 4:It willIt sends to
Recipient's coding/decoding method:It receivesLater,K is calculated as follows2
Step 1:It calculates
Step 2:It calculates
Step 3:It calculates and checks:If t < 1, enable k2=0, otherwise enable k2=1.
In order to description simplicity during, how inventive method knows together and pass from apart from four closer dimensional vectors if only describing The secret information of defeated one.In the practical application of inventive method, interactive each side can have more high-dimensional input;Such as: Vector in interactive each party's input is 1024 dimensions, at this moment the vector of 1024 dimensions can be divided into 255 groups, each group Four dimensional vectors are regarded as, then operation inventive method 256 times parallel, so as to know together and transmit the information of 256.Invention Method can also be extended to work in the situation that input is bivector or octuple vector.
Pay attention to the k in inventive method1It can be assured that before inventive method is run by sender, so as to excellent Good online and concurrent operation ability, this is a critical nature of inventive method.Inventive method is when for key agreement, k1 It is to be randomly selected from { 0,1 };When inventive method is when for encrypting, k1Any distribution on { 0,1 } can be obeyed.When should During for being constructed based on the cryptographic system of LWE or RLWE, LWE or RLWE data need to be exchanged by running the interaction each side of inventive method, And vector is exported respectively by these dataWithWhen applied to RLWE cryptographic systems, q is generally prime number;And applied to LWE During cryptographic system, q both can be that prime number may be conjunction number.

Claims (1)

1. a kind of efficient key common recognition transmission method, which is characterized in that the method includes:
Systematic parameter:Params=(q, m, g, d), wherein q, m, g, d are positive integer, are met:M >=2, q >=g, 0≤d < q (1- 1/g)-2;
It enablesWithFor four dimensional vectors;Give two four dimensional vectorsWithDefinition I.e. To vectorRound up per one-dimensional, wherein " " is the operator that rounds up, the single order norm of definition vectorDefinition It enablesFor quadravalence square formation;For arbitrary integer x ∈ Z, define | x |q=min { x mod q, q-x mod q};For arbitrary four dimensional vectorWhereinOr It is downward rounding operation symbol, defines
Two users (can be equipment, program etc.) in system, the initiator for running inventive method is denoted asOperation method Respondent is denoted asThere are one four dimensional vectors of secret input With secret information k1∈ { 0,1 };There are one four dimensional vectors of secret input Meet Inventive method will causeWithReach identical key common recognition k1=k2∈ { 0,1 };For this purpose,ToTransmit four dimensional vectors Information
Sender's coding method:Specifically,It obtains as followsIt and willIt sends to
It calculatesIfThen B=0 is enabled, otherwise enables b=1;NoteIt calculates It willIt sends to
Recipient's coding/decoding method:It receivesLater,It calculatesIt calculates If t < 1, Then enable k2=0, otherwise enable k2=1.
CN201611018455.1A 2016-11-18 2016-11-18 Efficient secret key consensus transmission method Active CN108173643B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611018455.1A CN108173643B (en) 2016-11-18 2016-11-18 Efficient secret key consensus transmission method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611018455.1A CN108173643B (en) 2016-11-18 2016-11-18 Efficient secret key consensus transmission method

Publications (2)

Publication Number Publication Date
CN108173643A true CN108173643A (en) 2018-06-15
CN108173643B CN108173643B (en) 2021-04-13

Family

ID=62525951

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611018455.1A Active CN108173643B (en) 2016-11-18 2016-11-18 Efficient secret key consensus transmission method

Country Status (1)

Country Link
CN (1) CN108173643B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108989031A (en) * 2018-07-27 2018-12-11 上海扈民区块链科技有限公司 A kind of more bit error correction coding-decoding methods
CN109861821A (en) * 2019-02-26 2019-06-07 清华大学 A kind of wrong coordination approach for LWE public key cryptography

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150399A (en) * 2007-10-12 2008-03-26 四川长虹电器股份有限公司 Generation method for share secret key
CN101187856A (en) * 2007-12-12 2008-05-28 四川长虹电器股份有限公司 Random number generation method
CN103368725A (en) * 2012-04-06 2013-10-23 中国科学院软件研究所 Construction method of G0-type S-box and circuit of G0-type S-box

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150399A (en) * 2007-10-12 2008-03-26 四川长虹电器股份有限公司 Generation method for share secret key
CN101187856A (en) * 2007-12-12 2008-05-28 四川长虹电器股份有限公司 Random number generation method
CN103368725A (en) * 2012-04-06 2013-10-23 中国科学院软件研究所 Construction method of G0-type S-box and circuit of G0-type S-box

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108989031A (en) * 2018-07-27 2018-12-11 上海扈民区块链科技有限公司 A kind of more bit error correction coding-decoding methods
CN109861821A (en) * 2019-02-26 2019-06-07 清华大学 A kind of wrong coordination approach for LWE public key cryptography
CN109861821B (en) * 2019-02-26 2020-10-30 清华大学 Error coordination method for LWE public key password

Also Published As

Publication number Publication date
CN108173643B (en) 2021-04-13

Similar Documents

Publication Publication Date Title
CN1324502C (en) Method for discriminating invited latent member to take part in group
CN109657489B (en) Privacy protection set intersection two-party secure calculation method and system
CN1144418C (en) Method and device for authenticating first instance and second instance
CN107911209B (en) Method for establishing security public key password for resisting quantum computing attack
CN1889433A (en) Mutual identifying key consultation method and system based on hidden common key certificate
CN109274503A (en) Distributed collaboration endorsement method and distributed collaboration signature apparatus, soft shield system
CN109327308B (en) Quantum key distribution method and system with bidirectional identity authentication function
CN104901935A (en) Bilateral authentication and data interaction security protection method based on CPK (Combined Public Key Cryptosystem)
CN107196926A (en) A kind of cloud outsourcing privacy set comparative approach and device
CN105099671B (en) A kind of identity hides and non-extensible safe authentication key agreement method
CN104038493B (en) Bilinear pairing-free cloud storage data security audit method
CN107566121B (en) Efficient secret consensus method
JP6974461B2 (en) Methods and systems for advanced data-centric cryptographic systems using geometric algebra
CN108173643A (en) A kind of efficient key common recognition transmission method
CN109376540A (en) A kind of image encryption method based on Duffing mapping and genetic manipulation
CN104753947A (en) Attribute-based verifiable outsourcing decryption system and method with fixed ciphertext length
Min et al. Novel multi-party quantum key agreement protocol with g-like states and bell states
CN108234129A (en) A kind of two-way authentication cryptographic key negotiation method and system based on lattice password
CN107241190A (en) The key agreement construction method and the network platform of a kind of identity-based
CN111416712A (en) Quantum secret communication identity authentication system and method based on multiple mobile devices
CN105162585B (en) A kind of session cipher negotiating method of secret protection
CN102594551A (en) Method for reliable statistics of privacy data on radio frequency identification (RFID) tag
CN103780794A (en) Image encryption improved method based on chaotic system
CN107317676B (en) Key distribution method based on quantum graph state
CN108650087A (en) A kind of SM2 ellipse curve signature dot product encryption methods under binary field F2m

Legal Events

Date Code Title Description
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20190412

Address after: Room 5345, Lane 786, Xinzhong Road, Xinhe Town, Chongming District, Shanghai

Applicant after: Shanghai Hu min block chain science and Technology Co., Ltd.

Address before: 200433 Fudan University, 220 Handan Road, Yangpu District, Fudan University

Applicant before: Zhao Yunlei

CB02 Change of applicant information
CB02 Change of applicant information

Address after: Room 345, No. 5, 786 Lane, Xinzhong Road, Xinhe Town, Chongming District, Shanghai

Applicant after: Shanghai Hu min block chain science and Technology Co., Ltd.

Address before: Room 5345, Lane 786, Xinzhong Road, Xinhe Town, Chongming District, Shanghai

Applicant before: Shanghai Hu min block chain science and Technology Co., Ltd.

GR01 Patent grant
GR01 Patent grant