CN103608829A - System and method for computerized negotiations based on coded integrity - Google Patents

Abstract

An accelerated transparent authenticated Data Exchange system wherein the chronology of alternating senders' and receivers' messages are authenticated typically at each step, with an easy to use provision for resending, in the event of faulty transmission, such that the final message hash value authenticates the negotiation chronologically from first to final message, wherein the final hash value is operative to enable a signature of an entity or entities which binds such entity to the whole data exchange, which signature can be in clear text, encoded, and/or encrypted with authentication integrity. The system is useful for managing computerized negotiations including client-initiated computerized negotiations and including computerized financial transactions.

Description

For the system and method that carries out computerize negotiation based on coding integrality

For quoting of common patented claim

Require the USSN61/461 that is entitled as " System of Customer Generated Vouchers and Automated Negotiation... " submitting on January 18th, 2011,244 right of priority.

US11/578,929 have described use portable electric appts obtains multifactor security.

US12/161,833 described easily by token ID, identify, accept the system from the value of personnel in closed group.

US11/578,076 has described for user being carried out in closed system the system of safety analysis (profiling).Abandon.

US12/439556 has described for the system based on message authentication stream cipher framework and cross feedback, in the situation that modification message is verified to eliminating.

US12/322766 has described loyalty awards system, and wherein, user's point is determined User Status, and user benefits from the privileged mode increasing progressively, and this privileged mode comes from owing to continuing the average point not spending all the time of buying the growth causing.

PCT IL/2010/000075 has described for encrypt and the symmetrical silicon stream cipher of the general compactness & hash maker form of integrality simultaneously.

Technical field

Present invention relates in general to computerized system, and relate more specifically to for transmit the method for the data of the network computer with integrality between the user of computerized system.

Background technology

Believe that following publication has represented relevant prior art and/or technical merit:

US7,827,232 and GB2,430,593 have described symmetrical hardware flow password/RNG framework of robust.

US7,852,162 have described for controlling US7, the generation of the true random & Discrete Stochastic noise of 14 displacements in 827,232.

US6,360,321 have described the slot of sealing, have wherein embedded and have controlled the access of the CPU of computing machine and the safety chip of communicating by letter, the first chip that the PKI smart card of being protected by trusted third party activates.

US6,609,114 have described " Kirchhoff " public key cryptography payment scheme of the swindle " printing " for preventing currency.

US6,749,115 have described dual processor security architecture, and wherein, safety chip access is isolated and/or encrypted program and data-carrier store.

E Biham & O.Dunkelman, A Framework for Iterative Hash Functions, NIST hash forum 2006, Santa Barbara.

E?Biham&O.Dunkelman，Differential?Cryptanalysis?in?Stream?Ciphers，Technion?C?S2007。

S.Vaudenay, A Classical Introduction to Cryptography, Springer, New York, 2006.

O.Dunkelman, A.Hecht, The ZK Crypt Security Analysis, eSTREAM website, version 3, in January, 2007.

The disclosure of all publications of mentioning in instructions and the disclosure of patent documentation and the publication of wherein directly or indirectly quoting and patent documentation is incorporated herein by reference.

Summary of the invention

Any definition that following term can occur according to it in prior art document or according to any definition occurring in this instructions or as give a definition to explain:

" 5 " word ciphertext HV/ label detects entirely, complete " 5 " number of words order & interruption-

During all effective TX/RX ZK ciphering process, each major clock place after initialization, the output of TX & RX password mask (and all state variables in engine, except message input and password/plaintext output word) be identical.In other words, the same in encrypting with conventional flow, transmit leg and take over party's determinacy random number generates engine must be maintained identical link value in each clock period.

" 5 " word sequence is hashed value/label maker that ZK-encrypts entirely.TX encrypts hashed value; If all good, RX deciphers hashed value, and detects the sequence of complete " 5 " word.Therefore,, when to TX initialization identical with RX and ciphertext with when expressly synchronous, wherein in transmission, do not have bit to be damaged; RX will detect complete " 5 " word (hashed value) of being encrypted by TX.

In other words, if a part for TX message input is complete " 5 " word sequence; The TX of described sequence output is complete " 5 " the word sequence of encrypting; Hashed value/label of TX is to carry out the password mask word output sequence of the TX of XOR with the message input of complete " 5 " word.

Therefore, the ciphertext output of RX input TX, and the password mask output of ciphertext word and RX is carried out to XOR (deciphering); And complete " 5 " word of output.

Similarly, in the financal messaging of the encryption format effectively sending, any i complete " 5 " message word of encrypting makes to complete " 5 " word of complete " 5 " word detecting device output of enabling of RX.

Then, complete " 5 " RX output is that these data are not easy to be replicated to the indication with the shared data source key of take over party; Communication channel is reliable; And complete " 5 " RX output is the indication of TX having been inserted in message input to i the message word of complete " 0 " of regulation.The format of complete " 5 " word message can be inserted and be called middle hash.In long message, this can contribute to detect effective " sky " part sending in data.

RX can find to contribute to cause interrupt routine on the transmission position of given known complete " 5 " word that sends sequence for the chance of the equivalent vector of page/frame counter is set.This test has provided having the indication of the transmission quality in the encryption of error propagation, and/or to the integrality of transmit leg and for hashed value in the middle of to the last and comprise this last in the middle of the indication of propagating the TX message in stream encryption of traditional zero defect of all transmission of messages of hashed value.

Automat (automaton), for generating the asynchronous circuit of rdy signal, interrupting & regulates, the link value of authentication-two parts asynchronous automaton circuit has been fixed to new clock status counter and clock status counter before, for example, described in any one below:

The US7827232 of distribution in 2009, is entitled as " Stream Cipher Architecture ".

US2009/0304179, Dual Feedback Precludes Message Modification, on September 7th, 2006.

US13/143,172, the encryption with integrality regulating by 64 bit HAIFA counters, 2010.

For this reason, can add interruption signaling, wrong hashed value, and especially for CMV, wherein, we suppose that negotiation exchanges being in the example of machine generation, can add automat, and hashed value is adjusted in verification function.

Preferred embodiment for negotiation computerize voucher (CMV) agreement in shadow memory circuit, can add automat, and this automat is preserved last link value that each successful hashed value generates automatically; That is, " startup " link value of the next text Hash digest in shadow memory, wherein, each variable bit in link value is associated with the variable bit in shadow memory in function.ZK encrypts automat and in shadow memory, preserves the link value of " well ", and before the link value of " bad luck " is replaced with " well " generate link value before.

If bust this; Be unsuccessful authentication, automat by before the link value of " well " be adjusted in all variablees of ZK encryption stream ciphers engine; Last Hash digest and the authentication of last hashed value can be reruned.

The optics of bar code-conventional can recognition coding system, and the little square that can be identified in black bar shaped or large square by the numeral of variable-width forms.

Buyer-computerized workstation, after to the correlative study of its part human user, it is ready to excite or initiates or participate in consulting, and conventionally causes privilege to be bought conventionally." buyer " and " consumer " and sometimes " take over party " are the non-limiting examples of consulting starting client.

Link value; In ZK Crypted password feedback model (CFB), be all the time all state variables gathering-in traditional hash function, input block is greater than link value.In each new compression, link value before blocking and merging to; Wherein, last link value in common session becomes " hashed value/label ", HV/ label.

It is the currency of all state variables that the ZK encrypted link value of Hash digest and hashed value generate hashed value generation/authentication Hash value generation/certification chain ad valorem, and each bit of last the message word in last coded message word derivation is diffused at least 384 state variable scale-of-two equations of lower 527 bit link values.

In other words, in ZK encryption stream ciphers MAC or hash or initialization cipher feedback pattern CFB process, 32 message word inputs (supposing single 32 bit independence engines) are expanded in 527 bit link values, it comprises random controller, register group, data stirrer (Data Chum), result/feedback processor and 64 bits " HAIFA " counter are (for example, at E.Biham & O.Dunkelman, A Framework for Iterative Hash Functions, NIST Hash Forum2006, the counter of describing in Santa Barbara) all binary-state variables in.HAIFA counter is subject to the Random Effect of initialization procedure; Be not subject to the impact of message input word, but be a part for link value yet.(for the ZK crypto engine group of parallel pairing, link value is postponed to be diffused in 1054 bit link values.) this is compared with traditional hash equipment, wherein, link value is a series of blocking/compress normally.

Cipher feedback pattern; CFB-is in conventional flow is encrypted, and message word does not affect the determinacy random number generating cipher engine (not feeding back in the determinacy random number generating cipher engine of TX or RX) of TX or RX.This can suffer in the situation of little error of transmission (the same with synchro system) advantageous particularlyly, and the bit being damaged is not propagated.(real ciphertext input has produced real plaintext output, and on the contrary, pseudo-ciphertext bit only produces a pseudo-expressly bit.Encryption and decryption are identical operations.)

In conventional block password, for example DES has realized security increase under the cipher feedback pattern CFB of operation; Wherein, in the crypto engine of TX and RX, all feed back the ciphertext word of TX.

Because encryption and decryption process is identical, encrypting the encryption of feedback model (CFB) block encryption is the stream cipher pattern of encrypting, wherein, even if a transmission bit being damaged also propagates into follow-up random destroyed plaintext output.

Hashed value/label generates the message word based on pre-encryption conventionally, and the unique impact of this message word is truncated the state variable into link value, to cipher engine, feeds back this link value; Final link value generates HV/ label conventionally.

In the ZK Crypted password feedback model (CFB) with authentication integrality is encrypted, two processes are identical ciphering process.Encrypt and the generation of HV/ label by encrypting plaintext then complete " 5 " word sequence of HV/ label maker form.Deciphering and the checking of HV/ label are stream cipher type decrypting processes.With the same in block encryption CFB, the ciphertext of TX is fed in the cipher engine of TX and RX.

Password mask; The password mask 32 bit pseudo-random outputs of ciphertext-data stirrer.Under TRNG pattern, the output that normally ZK encrypts of password mask; Under all stream cipher patterns, password mask and plain/cipher text message word carry out XOR, to export resulting ciphertext/ciphertext; And

Under data authentication pattern, label/hashed value is the series connection of complete " 5 " word of MAC pattern output password mask.

The conflict of internal state variable and/or hashed value/label-unexpected inner appearance, wherein, identical link value will occur more than once in Hash digest; Or in two HV/ sequence labels of identical data not, or occur that same chain ad valorem not causes the same Hash value/label of two different pieces of information files; For example, the same Hash value of authenticate contract, and swindle replacement is regarded as not existing in ZK encrypts.

Same chain ad valorem is not present in and is less than 2 provablely ⁶⁴on two positions in the sequence of bit, because unique HAIFA number that each link value comprises.

At the US12/439 authorizing, in 556, pointed out (at least) impossibility of message modification in short message; For example, can rogue ground moving decimal point in the situation that, and in the situation that successive links value can being adjusted to actual value.

Have and be less than 2 ⁶⁴the document of bit, it is immune for " herds (herding) ", attacking, and may be also immune for conflict, this is due to the additional unique random count number comprising at each connection value.

In good hash or MAC function, be extremely difficult to generate significant conflict, and be extremely difficult to design in ZK encrypts.

Series connection hashed value, the ZK that is also referred to as cascaded H V/ label-have integrality encrypts or simple ZK keyed hash value generate agreement be designed to send have in the middle of a large amount of verify datas of series connection hashed value.In consulting three embodiment of computerize voucher (CMV) agreement, resulting data stream is in series by the each several part of text (expressly or ciphertext), and wherein, each part of described text is hashed summary for hashed value, connects afterwards hashed value.All authenticities in front data, the particularly last part of text in each authentication Hash value proof data stream.

Under ZK Crypted password feedback model, the data division of each Hash digest uniquely the value of changing link all bits at front state.Similarly, each hashed value generate the value of changing link uniquely all bits at front state.In ZK encrypts, each hashed value is unique encryption of " complete ' 5 ' word ".We claim unique, because each hashed value is encrypted, are the functions of last the pseudorandom link value state (all 527 variable bits in the configuration of ZK crypto engine) after the Hash digest process to textual portions.

In described agreement, the link value of the end of encrypting in hashed value is " startup " link value of the next part of Hash digest text, is the hashed value generating afterwards.

If declare that the hashed value of deciphering has generated the sequence of " complete ' 5 ' word "; We know all in front textual portions and sequence this hashed value and all in front hashed value, be real.

Yet if decrypted hash value does not generate the sequence of " complete ' 5 ' word ", our supposition at least one bit in transmission is damaged.In this moment, take over party must request retransmission, if from " well " link value bring into operation, this will allow to realize success identity and new " well startup " link value.

Copying a kind of mode that " well " restart link value will be the data sequence of again processing whole processing, until again can start the end of link value.Being reversed is not allow tractablely, because ZK Crypted password feedback model (CFB) function is all " unidirectional " function, and does not probably have possible easy-operating contrary.The hash function of noticing some suggestions is to build around having defined contrary block encryption.

For the preferred embodiment of consulting computerize voucher (CMV) agreement, in consulting computerize voucher (CMV) agreement, added circuit automat, it preserves last link value that each successful hashed value generates automatically; That is, for next text Hash digest, preserve " startup " link value in shadow memory, wherein, each variable bit in link value is associated with the variable bit in shadow memory in function.

If bust this; Cause unsuccessful authentication, automat by before the link value of " well " be adjusted in all variablees of ZK encryption stream ciphers engine; Make thus last Hash digest and hashed value authentication to rerun.

Alternatively expressly or with ZK Crypted password feedback model (CFB) to encrypt the whole or arbitrary portion that ciphertext form sends text, because the hashed value/label generating is identical in two kinds of examples.

Consult computerize voucher (CMV) supplier and can select communicating by letter of decoding and hash authentication, because negotiated sales and registered customers list confidential information normally.

In common negotiation, if the First ray of verify data is safety, unknown or disabled for invader, invader can not authenticate clear data or the encrypt data of transmission, can not be decrypted code message.

Correlativity immunity-we claim: if in fact do not have information to leak into output (output of password mask or to the message of XOR to the output of password mask) (nLFSR stage or message word) from input, export be correlativity immunity or maximum correlation immunity.

Fortress maintains: test has shown to store & XOR intrinsic function (wherein, each bit output normally the function of four or how continuous foreign peoples input) and in fact eliminated correlativity (and deviation (debiases)).

Destroy-due to cross feedback stream and the high diffusion in ZK encrypts, single-bit in efficient message changes the variable bit equation more than 350 binary-state variables in 32 bit words operational characters in impact (destruction) two clocks, and non-adjustable saving land affects all bit variable equations in the password mask in the 3rd major clock; For example, as the US2009/0304179 in distribution, " Dual Feedback Precludes Message Modification ", describes in the Message Modification preclusion proof in 7 days September in 2006.To revise message eliminating prevent in without cipher key Hash, thering is maximum importance, wherein, invader understands all bits and the hashing algorithm of Hash digest.

Cryptoanalysis-cryptoanalysis is the cryptographic sisters' subject in password science, and it is in the processing of deciphering secret, and what Treatment Analysis cryptologist designs, to find weakness or to cause finding the attribute of weakness.

Consult entering of starting client third party's data (C3D)-data consult starting client database (for example, log-on data subset CA), it is associated with the specific negotiation starting client being generated by third party.

Consult the profiles database of the negotiation starting client of starting client account (CA)-registration, the member who comprises public or particular community, or by registering its details and consulting to create the personnel of account so that himself is associated with supplier on computerize voucher transaction engine.The account can create draft negotiation computerize voucher so that consult starting client, as a part for the more efficient processing procedure with supplier.

Consult starting client database (CD)-generally include and consult the known profile data of the secret, finance and other public that keep that starting client is relevant to each in negotiation computerize voucher transaction engine database.The data that keep can be qualitatively-name, address, negotiation starting client No. ID, date of birth, address and postcode, marital status, family and financial status etc., can be also quantitative; For example, the transaction data in front transaction based on seller.For example, if supplier be retailer-, with the formerly transactions history (conventionally, can accumulate this data from supplier's self negotiation starting client relation management (CRM) system) of supplier's negotiation starting client.This profile society/economic account data formation each consult the analysis of computerize voucher and the basis of negotiations process.

The log-on data subset of consulting starting client input data (CID)-store in the account of consulting starting client self is consulted starting client account (CA) database, it conventionally directly provides and inputs by consulting starting client itself.

Voucher (consulting computerize voucher) (CMV)-goods providing for seller and/or the voucher request of service of starting client management are provided, and wherein, the original clause of voucher generates by consulting starting client.Negotiation computerize voucher transaction engine in system represents regular collection (VRS) and the database of product and the negotiation starting client information that seller/provider create of supplier based on supplier, consults the voucher request of auto-negotiation starting client.

The computerize subsystem of consulting the voucher maker (CMVG) of starting client management-be incorporated in consulting computerize voucher transaction engine helps to consult starting client and processes the establishment to the negotiation computerize voucher of log-on consultation starting client.Once this voucher is asked by consulting starting client, to supplier's account and the negotiation engine electronics of negotiation computerize voucher transaction engine, send this voucher.The voucher maker (CMVG) of consulting starting client management can be merged in supplier website.

Consult voucher response (CMVR)-computerized information container (receptacle) of starting client management, for example file, Email or other, its storage is consulted the response of computerize voucher for each.This response is consulted engine (VNE) by supplier and is used supplier's regular collection (VRS) and supplier's database to generate.

Voucher clause (CMVT)-document, file or other computerized information containers of the management of negotiation starting client, storage is by the clause of consulting starting client selection, as the basis to the negotiation of the voucher of negotiation starting client management.This clause is the specific negotiable clause of supplier, and is applicable to Related product or service.Common negotiable clause for offer includes, but is not limited to: " setting price ", " setting discount ", " number of articles ", " setting clause " (that is, the date of voucher validity), " for supplier's message ".Supplier can dynamically pre-determine the scope (min/max) of offer and clause, for example maximum-discount based on loyalty, quantity or only selected percentage discount or even lock price, and allow only for Additional Services, to ask.

Voucher transaction engine (the CMVTE)-complete computerized management system of consulting starting client management, comprises all elements herein, for creating, consult and meeting, consults the negotiation computerize voucher that starting client is initiated.

Consult starting client supplier's database (CVD)-supplier's self negotiation starting client secret management system.

The part that data stirrer-ZK encrypts, for example as described in Figure 21, its processing is from unpredictable rotation and array output MAJ/3XOR filtration of four 32 bit-level of register group.

Stirring operation consists of the following: the displacement of two pseudorandom steppings 4 (stepped4) rule (Splash) matrix; (EVNN) MAJ that exports the random controller of two matrix bits outputs carrying out XOR with two other matrix bits regulates diffusion; And three storage & XOR decoherence (decorrelation) filtrators.

14 noise signals of determinacy & true random noise-random controller transmitting, it affects 61 displacements in register group and data stirrer.In cipher function, noise source is deterministic pseudo-random key and the pseudo-random data generating in data stirrer, and is fed back in random controller and determinacy noise source.

In two kinds of examples, noise source is in 3 " ideal " (checking by pleonasm) noise bits of each clock output-encode in PRF scrambler, to drive the displacement in register group and data stirrer; That is, in group and stirrer, there are not predictable constant series.

Spread the impact of-mono-state variable on a plurality of relevant state variables; Make source variable cause the linear and/or non-linear change of the output in a plurality of correlated variabless; Conventionally affect the change in foreign peoples source.

In the isolation critical path that realizes version of encrypting at ZK; After (estimating on 380 diffusion equations) maximum first rank diffusion occurs in three clocks.

Summary (verb), eap-message digest and Hash digest-conduct generally acknowledged definition conventionally, our pipe is expanded the stream pseudorandom of message word/be diffused into process in the variable of ZK encryption for making a summary or Hash digest process.With all in fact competition hash functions on the contrary, ZK keyed hash summary is cipher feedback pattern expansion function, wherein, the HV word of each engine 32 bit initialization word, message word and input is 527 bit link values by expansion.Every other method is to have the compression function blocking.In ZK encrypts, link value is not blocked all the time, each input bit affects all bits of link value on letter.Owing to having changeable transpose and the random controller of the inherent framework that can not easily be analyzed, eSTREAM contest and NIST SHA-3 have refused ZK encryption.Accusing each other of final contestant in NIST SHA-3 forum proved compression, blocked the foreseeable life cycle of Hash digest process.

Two tracking cross feedbacks-due to poor statistics, avoided traditional feedback procedure in RNG & PRF design, generally this pressure correlativity owing to output stage (password mask); And no matter the feedback of passing judgment on has increased this fact of password complexity potentially.

In ZK encrypts, under cipher feedback and MAC feedback model, the feedback sources of each feedback words and conversion are different, and in very different modes, affect the different piece of register group and data stirrer.MAC pattern feedback flow is quadrature.

Engine-referring to interactive module, has 14 32 bit status variablees and as the integrated random controller of the message input port of single entities.

Engine carrys out work as 32 bit cipher machines separately; Or series connection, wherein, the lower feedback of an engine is diverted into its neighbours.The most simply series connection (64 bit) is the engine pair with the lower feedback of exchange.

In theory, the engine of any number can be connected by circular configuration.

When engine is connected, be connected in series to main frame and be similar to single engine.

Port A (size of input), D (output state and statistics) and E (order and configuration) are 32 bit ports.According to configuration, message input and result output port B and C are 32,64 or 128 bit words, wherein, in a clock period, input a message word and export a result word.

Have authentication integrality encryption-in ZK encrypts, expansion function is carried out encryption and hash under cipher feedback pattern.

Exhaustive search, violence search-by carrying out exhaustive (being also referred to as violence or direct search) in order on key (and known IV and scrambler (if they exist)) at each, crack the most efficiently the good stream cipher of design.

Here quoted Biham publication; E.Biham & O.Dunkelman, Differential Cryptanalysis in Stream Ciphers, Technion CS2007-10, it has proposed: " the stream cipher expection without probability difference (or even impossible differential) for re-synchronization attack, related-key attack and again cipher key attacks be immune ".Fortress has moved all standard random tests, and find that, for the built-in variable in the data stirrer executor in ZK encryption, noise source or cross feedback stream, only pleonasm test detects exactly and proved and do not have difference or impossible differential; At ZK, encrypt in SHA-3NIST hashed version contest introduction version, difference and impossible differential (352 state variables under 32 bit list engine configuration have been got rid of, 47 random controller bit variable-present 79, and the not random additional 64 bit HAIFA Mason counters that regulate feedback flow); After analyzing the simplest chunk of word executor, according to complete mathematical solution, estimate transposed matrix, in direct single engine mathematical solution, will there are at least 5 hundred ten thousand monomials, the probability of about 5,000 5 hundred ten thousand monomials under the configuration with double engines of 64 bit.The estimation of the monomial number under 128 bit configuration will be to guess blindly.He also claims for each resolution, must know all engine variable [n x527; The number of n=interactive engine], so that next state is solved.Because transposed matrix is close, thus small scale to minimize to be incoherent.

In the secret supplier for client presents, main cryptanalysts statement: because single-bit in each clock period is to surpassing direct foreign peoples's diffusion of 400 bits and many displacement combinations of built-in variable; Suppose the Moore's Law progress of quantum calculation, semiconductor design and analytical algorithm; Acquisition need to be over 50 years in attainable algorithm solution.He asserts: with double engines may cost over 200 years.

There is the ZK Crypted password (and associated MAC-has the encryption of integrality) of the DMA input of message word and the business realization of ciphertext output than every other in fact symmetric cryptography and/or the fast magnitude of hash function.Therefore any exhaustive key search is attacked will be infeasible; Current industry is accepted, reluctant work factor (number of test operation) is positioned at 2 ¹²⁸place.Successful brute force attack for lengthy document will require at least 2 ⁵¹²inferior test operation.

Mistake, ZK encrypts transmission, error detection, error correction, and error propagation-modern semiconductors computing equipment is determinacy and reliably, carries out the most complicated pseudo-random function in the situation that not introducing miscount.Memory device and transmission network are not make us trusting, and be overly dependent upon for particular type have the digital signal of making an uproar designed, can detect and correct error of transmission, store single bit mistake, the hardware and software feature of burst error (dynamic adjustments is length and the character of burst conventionally) and for correcting the more complicated equipment of video flowing and other digitaling analoging signals.Under specific circumstances, these equipment add to the data of storage or transmission the redundant data bit that is designed to detect and/or correct structural data.

In the situation that the asynchronous hashed value detecting device automat of this patent, after having the hashed value of the flaw, the mistake detecting is to the interruption of major general's generation for main frame.

ZK encrypts the output of " unidirectional " hardware hashed value authenticator by the non-adjustable destruction that saves land of data bit of any wrong input, therefore three engine cycle.(therefore, we inserted at least three scrambling words at suggestion before total hashed value authentication, to guarantee error diffusion in the hashed value of record, to guarantee the error detection to the last word of transmission data).

Single error bit in transmission in ZK encryption stream ciphers or the Hash digest of storage, scrambling or hashed value is diffused in the equation of about 400 in 527 bit link values, and after three machine cycles, password mask and text or non-adjustable the saving land of hashed value output is carried out to randomization.

Preferably take cost-saving measure, before guaranteeing carrying out described data in ZK encrypts, the mistake of transmission or storage is regulated.

Under cipher feedback pattern, promulgate that Hash digest (having associated deciphering) and hashed value generate, wherein, PRF output is subject to the destruction of the first destroyed input, and all follow-up datas are by the non-adjustable randomization that saves land.We claim that this is error propagation.

In conventional flow, encrypting (referring to Switch@0), is not the function of message input to the feedback of PRF; Therefore the output of password mask is deterministic sequence.Error bit in transmission ciphertext is by the single mistake causing in output sequence; Therefore, we claim in conventional flow is encrypted " mistake is not propagated ".Security negotiation computerize voucher (CMV) scheme that tradition realizes will be used conventional block password to data encryption alternatively, and by traditional ashing technique, carry out hash traditionally.

FB, feedback-in closed-loop system, the arbitrary function that output valve is recycled in the various functions in function will be influential to input value.Referring to LSFR (linear feedback shift register), lower feedback, breakaway layer feedback, cipher feedback and MAC feedback, cipher feedback pattern.

Finite state machine, FSM-sequencing controlling mechanism, consists of combinational logic, clock and memory cell, and it defines limited number continuous state, and wherein, given input state causes to the transfer of the output state of definition.

Can use the simple logic defining in interface to combine step-by-step operation ZK to encrypt by main frame, or be operated by the hardware FSM with the FortressGB design of the necessary expanded function of the most efficient single step direct memory access function, it be outside this core.6 FSM, each FSM carries out described simple logic combination, to carry out initialization, TX and RX encryption/Hash digest and hashed value, generates and detects.

In the end of each process, i.e. initialization, Message Processing and authentication; The generation of ZK encryption stream ciphers automat is asynchronous to be interrupted without clock.

Bistable multivibrator (Flip-Flop)-type D, T & SR-electronic memory unit, can maintain two stable output states, " 1 " or " 0 " on output Q and Q NOT.Synchronous (clock activation) bistable multivibrator using in ZK encrypts is data (D type) and switches (Toggle) (T-shaped).In D bistable multivibrator, activate the input in D junction occurring before the clock period and be sampled and be transferred to output Q being close to.In the configuration of T (switching) bistable multivibrator, output is the reversing from previous output.When clock activating signal bistable multivibrator, the last polarity of reversion Q and QNOT.Clock activate to be what the voltage by clock signal rose to activate, and with being input to, direct connection that clock connects represents in the accompanying drawings; Or activated by the decline of the voltage of input clock signal, by the clock input with bistable multivibrator, be connected adjacent small circle in the accompanying drawings and represent.SR bistable multivibrator is asynchronous device, because they activate constantly in pseudorandom, and the system clock equipment of can't help is carried out stepping.Activation voltage in S input has caused 1 (setting) of stablizing on output Q.The activation of R input (being conventionally labeled as CLR or plaintext) has caused 0 (replacement) of stablizing on output Q.Bistable multivibrator has optional the second output Q NOT, by the Q below the broken broken line of level, is represented.D type bistable multivibrator have be connected to its D input reversion Q NOT output as T bistable multivibrator, wherein, at each, activate clock signal place to output switching.Under ZK encryption stream ciphers and random number generator configuration, use D, T and SR bistable multivibrator.In software is realized, to the emulation of this equipment, be direct.

In bistable multivibrator, store all ZK and encrypt binary variable.Bistable multivibrator is processed half electronic gate (NAND equivalence) in almost ZK encryption.

In the non-security system that is difficult to test, standard method of test JTAG is by the serial scan of all state variable bistable multivibrators is formed, and it is limited to the additional minimum value of two doors on each bistable multivibrator.The experience suggestion of Fortress: manufacturer in good standing does not allow the scanning process (or they provide the burn off to trace wiring) in security module yet.Simple probe can expose all hiding secrets conventionally.Mutual due to all in fact doors after maximum 16 clocks activate and variable, ZK encryption and similar devices are easily tested (from overall situation replacement) with the cycle tests of some customizations.

HAIFA counter, " for the framework of iteration hash function " based on unique unpredictable 64 bit count equipment random initializtions of 64 bit Mersenne Prime LFSR (linear feedback shift register)-advised by Eli Biham and Orr Dunkelman is designed in fact the traditional hash equipment based on block encryption of strengthening having conventional counter.This framework comprises " adjusting " deviation (aberration), is similar to IV or the non-secret cryptographic key in ZK encryption stream ciphers and each link value is distinguished to the also counter of uniquely tagged.

The series connection that the double word counter of ZK encryption HAIFA (enlightenment) comprises relative prime number Mason LFSR (linear feedback shift register), there is element length 7,13,17 and 19, and the nLFSR of 8 unit (can be divided exactly by the multiple of prime number 2); By during having the key of scrambling or any total initialization list entries constituting of IV, it is by the XOR of lower feedback regulation and breakaway layer feedback regulation with carry out initialization; For each encryption with the operation of authentication integrality, be unique (not being unique without cipher key Hash operation for each).In ZK encrypts, pay the output bit of 64 bit HAIFA counters and by its linear sums in breakaway layer and lower feedback words.The essence object of HAIFA counter is the data herds district (herded sections) that avoids a plurality of conflicts and have repeating data district.In all encryptions with have in cipher key Hash (MAC) operation, wherein, HAIFA counter is carried out to random initializtion, and counter increases by 64 state variable bits by link value, and these state variable bits are not subject to ciphertext or the impact expressly of hashed value/label.

Hash, Hash digest, hashed value/label, be also referred to as HV/ label, " complete 5 " maker-hash function is compressed to regular length string by longer binary string high-efficient single direction conventionally, and this regular length string is commonly called hashed value (for hash, have cipher key Hash or MAC) or label (conventionally for having cipher key Hash or MAC).In this data recognizing system, must reasonably guarantee that any swindle in scale-of-two input string changes (large or little) and will present pseudo-hashed value to user.Conventionally, hash function does not relate to secret, is to disclose knownly, and potential assailant knows the process of compression completely, obtains Hash digest.For the true hashed value of supposition that before the monodrome of original binary string, known hashed value inspection receives, it is designed to reasonably to user, guarantee the authenticity of data.Key is made to know that for initiating the hash function of this device key and the user of true hashed value can determine integrality and the source of the data of " being hashed ".

In the operation of ZK keyed hash, the generation of Hash digest and HV/ label and authentication are the encryption/decryption of utilizing the intrinsic cipher feedback pattern of ZK encryption stream ciphers engine.Therefore, the authentication of hashed value can be to the checking of original plaintext or the checking to the ciphertext of storage or transmission.

By TX, the encryption of the string of sexadecimal " 5 " is generated to HV/ label.RX is decrypted " complete 5 " string of encrypting, and makes detecting device (in all engines) for " complete 5 " are detected and occurrence number is counted.If authentification failure, RX receives to destroy and interrupts.Alternatively, RX main frame can read the number of the effective word in verification process on output port.Under all configurations, RX has for re-creating the mechanism of the start-of-chain ad valorem of repetition message; Make TX can resend string, wish the destroyed bit of test before overcoming, and RX can determine " complete 5 " HV/ label maker.

By input data Hash digest to final condition (the last 527 bit link values of single engine of connection not of having prepared ideally engine in ZK encrypts, or be the n x527 in the situation that of connecting engine number at n), hashed value/label that then engine can word for word generate any length is to guarantee authenticity.Hash digest comprises: to data encryption (each input message word is carried out to the summation of password mask word XOR), then encrypted word is divided into 32 bit streams of two quadratures, each bit stream is by unique unpredictable adjusting, and before register group and data stirrer, carry out XOR from the unpredictable unique number of different 32 bit HAIFA in diffusion (6 32 bit stream-4 versions, via lower feedback and breakaway layer feedback) feedback " recycling ".We claim: each summary of message word is that 32 bits are expanded to 527 state variable engines (intermediate chain ad valorem), and will to grow message (a plurality of message) summary be unique expansion of not blocking to final link value.

Conventionally the device with key is categorized as to MAC, message authentication code; Or HMAC, hash MAC.

Initial value, IV initial vector-for the initial value expansion of key, for conventional flow, encrypt are compulsory, because for a limited number of different messages section, password mask encrypt/decrypt is identical sequence for same key.

From identical starting condition, under conventional flow cipher mode, the determinacy sequence of password mask output monodrome.The opponent of the value of the plaintext that can record ciphertext transmission and can learn to translate can record the sequence of secret mask value, and after a while all data that combine to send with same key IV is deciphered.Therefore,, after loading key, we encode to " random number (nonce) " (as disposable value of each message/session of IV), make the unique coding of each data file.When being encrypted with integrality, wherein, link value is the function of input data, and unique IV has guaranteed the uncertain initialization of HAIFA counter during follow-up scrambling.Unique uncertain IV is compulsory in the realization of conventional flow password.

Useful estimation or prediction that intractability-supposition is used known method to make are infeasible; That is, by any method except " exhaustive search ", cracking ZK encryption stream ciphers is probably reluctant utilization.

The feedback tap (tap) that linear feedback shift register-LFSR-extracts according to D class bistable multivibrator definition centering assembling and that have the bistable multivibrator from register, or in the second classification, what have the XOR placed between the bistable multivibrator of register has a clock shift-register devices.Two general categorys of LFSR (linear feedback shift register) are: one-to-many (Jia Luohua " Galois ") and many-one (Fibonacci " Fibonacci ").In many-one sequence, the output by the output XOR of a plurality of taps from shift register to the feedback bistable multivibrator returning to the input of first " left hand " bistable multivibrator.In one-to-many configuration, the output of last bistable multivibrator of register is fed to the specific XOR gate (tap) of placing between register bistable multivibrator and is also fed to the first the most left bistable multivibrator.

LFSR (linear feedback shift register) is linear device, because each configuration for LFSR (linear feedback shift register), given word in the output of each register causes the output of making a definition of register, make when clock is continuous timing, be cycled to repeat n bit words sequence.All-zero word is the unacceptable sequence under pure LFSR (linear feedback shift register) configuration, because 0 XOR 0 equals 0.In full zeroth order section, LFSR (linear feedback shift register) is stuck in zero and enters with zero to go out in the sequence syndrome (Stuck on Zero Syndrome) of (zero in and zero out).Unique input for LFSR (linear feedback shift register) (after initialization) is clock or ledex.N bit LFSR (linear feedback shift register) has the cyclic sequence of 2n-1 n output bit words.The observer who does not change string who recognizes the 2n bit of LFSR (linear feedback shift register) output sequence can re-create whole sequence, and can recognize " point " upper LFSR (linear feedback shift register) intrinsic value at any time.

From the different feedback configuration of the register of the maximal sequence length (2n-1) of equal length, produced whole identical elements of this sequence, but according to different orders.

For not understanding the observer who generates LFSR (linear feedback shift register) equipment, the adjacent phases of one-to-many LFSR (linear feedback shift register) has " local unpredictability " larger than the adjacent phases of many-one LFSR (linear feedback shift register).Tradition LFSR (linear feedback shift register) does not comprise all-zero state (all unit output valve is zero).The middle NFIX of those examples (for example, initiating the last adjusting of Mason LFSR (linear feedback shift register)) that is disposable variable adjustment at LFSR (linear feedback shift register) can insert " 1 " so that sequence regeneration.NFIX can also insert full zeroth order section, and sequence is lengthened to 2n from 2n-1.

MAC FB enables " 1 "/shunt exchange " 0 " (conventional flow encryption)-ZK encryption initialization procedure and comprises installation key and/or initial value and/or scrambler, all state variables of message word input impact; May be only when engine be worked under MAC pattern.Similarly, between the Hash digest of stream encryption process and hash generation without key and have cipher key Hash (MAC) also only when engine is operated under MAC pattern just likely.The encryption with authentication integrality is the process identical with there being cipher key Hash (MAC), except not reading the ciphertext of encrypt/decrypt/expressly.

On the contrary, in order to prevent the propagation of error of transmission, conventional flow is encrypted, and 0AB exchange is arranged on 0 along separate routes, and the residual recording data in enciphered data and hash MAC storage are isolated.

MAC message authentication code-MAC or HMAC, message authentication coding or stricter data authentication coding are the one-way function processes that has key, for by shorter binary string, the label/hashed value of the unique boil down to of large-scale series connection of binary word.Label/hashed value is the unique track relevant to content, makes two inputs that caused by opponent or fault cause the chance (conflict) of same label/hashed value in fact not exist.FortressGB declares: ZK encryption stream ciphers MAC function ratio NIST HMAC configuration is much better than; Although ZK encryption stream ciphers hash function can strengthen any other hash configuration that comprises NIST HMAC.

MAJ function-and if only if, and 2 or 3 inputs are 1, MAJ function output " 1 ", and and if only if, and 2 or 3 inputs are 0, MAJ function output " 0 ".

2 in three inputs that and if only if is agonic, and MAJ function reduces deviation.And if only if, and whole 3 input signals are agonic, but slight relevant, the linear 3 input XOR functions of Nonlinear M AJ function ratio robust more under analyzing.Conventionally, the track of input deviation is left in MAJ output.

The number of the door that MAJ function is used is half of number of the door that uses of comparable 3 input XOR functions, and conventionally has less propagation delay.

In high safety calculates, use 2 in 3 main doors, the puppet causing to get rid of the fault of one of computing equipment by three parallel work-flows is exported.In high safety encryption system, 3 low-power ZK crypto engines can parallel work-flow, and wherein, main frame will only accept to read at least 2 results of reaching an agreement in 3 engines.

The deterministic reluctant uncertain output of pseudorandom of mask, password mask-bottom storage & XNOR linear dependence immunity combiner is mask, this mask is encrypted as ciphertext by message word when with clear-text message word XOR, and when with ciphertext XOR to decrypt ciphertext.Mask is to message coding in the eap-message digest of hash/data authentication, and the password mask of TX is encrypted complete " 5 " the word sequence of hash maker, to export hashed value/label.The password mask of RX is decrypted complete " 5 " the word sequence of encrypting, to generate the string of complete " 5 " word detecting.

By operation key, generate mask.In MAC feedback model, be recycled in register group with the mask of message XOR, and be diffused in follow-up mask.

The nLFSR (linear feedback shift register) that Mersenne Prime (maximum length 2p-1) LFSR (linear feedback shift register) counter is connected in series to any relative prime number n unit (2n) counter-any independently maximum length LFSR (linear feedback shift register) produces unique pseudo-random sequence of all non-zero words.Mersenne Prime (MP) LFSR (linear feedback shift register) of any p unit generates prime number (2p-1) unique number of word.Have the short list of supposition of Mersenne Prime, wherein, p and 2p-1 are prime numbers.If the counter that will consist of single length M P LFSR (linear feedback shift register) be connected, composite sequence (no matter initial setting up value of each counter) length will be whole (2p1-1) (2p2-1) ... (2pn-1) the multiple M1 of the length of individual counter; Reason is that unique common denominator of all MP counters is 1.Sequence comprises that entirely " 0 " word only can be divided exactly by 2 at the nLFSR of interior any maximum length n unit (2n word length-wherein n is any positive integer), and therefore for Mersenne Prime, series connection is relative prime number.The length M 2 that the above-mentioned Mason who links with nLFSR counter connects is (2n) M1.The length of the H series connection (H1) of two unique 32 bit HAIFA word sequences that generated by relative prime number linear shift register sequence is 2 ⁶³< H1 < 2 ⁶⁴64 bit words.

Message word, message-our data input operands (operand) of being conventionally longer than 32 bits during single engine ZK is encrypted are called message (small letter " m ").We will encrypt and be called message word (capitalization " M ") in 32 bit operands of RX reception place deciphering (with password mask XOR) for TX transmission traditionally.In ZK encrypts, all input data; Be that key, IV, scrambler, password and plaintext, HV/ label maker and output are only inputted via message word.

Many displacement basis-C.Schnorr and S.Vaudenay for based on building with a plurality of pseudo-random function the concept that pieces design encryption basis, cause a large amount of diffusions in state space.We claim: ZK encryption stream ciphers is the expansion to original 1995 concepts of Schnorr/Vaudenay.In 32 bit words executors, exist more than 60 displacements, wherein by the unpredictable serial signal from many displacements random controller, adjusted for 31.

Near field, near-field communication, NFC-, referring to for approaching the ISO14443 standard of contact token communication negotiation-with the process of carrying out or adopting agreement to prove right, with the transmission of the value of guaranteeing, or prove identity.By system token and equipment, use negotiation.

Network-computerized ICT and communication infrastructure internet, mobile phone, LAN (powering on, airport etc.).

Network-system is stipulated required permanent haulage line and Wireless Networking; For example, statistics monitors, and the control to the access of equipment and closed region.

Random number (nonce)-random number is expendable value only.The IV using in conventional flow password should be real random value random number.We advise using the true random number being generated by ZK encryption stream ciphers, provide " random number " when generating random challenge (must be uncertain for inquiry person or hacker) and initial value at needs, it can be for preventing the random number of the copy of known ciphertext/clear-text passwords mask code sequence.

Nonlinear function (in ZK encrypts)-AND-function is the simplest nonlinear function, wherein, for " with " change of the single input of logic gate can or can not change an output.Carry (totalizer) gate open is commonly used in older password, but at current ZK, does not encrypt in offer.Non-linear 2 in 3 MAJ functions is ubiquitous nonlinear block during ZK encrypts.Nonlinear function MAJ, " with " and carry conventionally in Output rusults, aggravate the deviation of input bit.MAJ filtrator is the main nonlinear function during ZK encrypts.The non-linear of ZK encryption stream ciphers nLFSR provided by Slips, random imaging and irregular clock.

One-way function-ZK encryption stream ciphers can be the example of one-way function, because it easily calculates y=f (x) for all x, but it is infeasible on calculating to calculate f (x)=y.We tend to think: for any ZK encryption configuration, do not exist tractable contrary.

Online-at the communicable state of the fixing or wireless network that is connected to operator of special time equipment.

Many displacement-the displacements of displacement are adjusted by pseudo-random function and maker.Maker comprises:

11 (being also referred to as pseudo-(P) random clock of the pulse of missing) in 12 (P) random clocks;

The regular ledex of Splash matrix 4;

Digamma function top, centre and bottom control module.

Permutation encoding device 17 nonlinear feedback shift registers

During scrambling by the bit of the unpredictable 2x32 of internal regulation random initializtion the HAIFA counter based on Mersenne Prime.

Displacement comprises:

MAC MIX result Displacement Feedback for breakaway layer;

The SuperMIX S box that breakaway layer feedback is regulated;

Right and left nLFSR Slips;

The pseudorandom of layer activates;

The pseudorandom image XOR of the output of layer;

The output image of the nLFSR of the series connection of layer is to the pseudorandom XOR of itself;

Pseudorandom Splash displacement;

The clock activation & that misses of control module has alternating permutation

Two left hand adjacent S plash output bit spreads non-linear 4 layers of mixing MAJ/ XOR combiner to the MAJ of main Splash output bit;

Main Splash output bit is to the biasing balance of its right hand adjacent S plash output bit;

The XOR combination of latter two EVNN output; And

Top, centre and bottom storage & XOR filtrator

The uncertain 64 bit outputs of 5 relative prime number nLFSR of HAIFA counter.

We claim relative prime number, because 8 bit LFSR (linear feedback shift register) can will be divided exactly to the XOR combination of three layers of latter two result word being fed to; And more.

Parallel ZK crypto engine-n ZK crypto engine can parallelization, with linearity increase total word size and " more than " exponential increase password complexity, the while does not increase the energy of every processing bit.Hardware chaining between adjacent core is lower feedback flow.For n=2, exchange lower feedback; For example, the lower feedback flow of the left hand of generation is exchanged to the lower feedback flow of R/H and vice versa.The lower feedback of exchange is the most effective in arranged in series so far; Because the reception engine of the initiation engine of lower feedback and lower feedback all can not attempt the destruction in the built-in variable in arbitrary engine to regulate, and further do not destroy all engines in series connection.

Similarly, safe transmission for many groupings (multiframe) message, wherein, under cipher feedback pattern CFB, each block encryption is also carried out to Hash digest simultaneously, there is the danger that one or more bits in one or more groupings may be destroyed in transmission, before each frame is decrypted under cipher feedback pattern (CFB) pattern, must be do not have vicious.(under cipher feedback pattern (CFB) pattern, error propagation-mono-dummy bits will be got rid of two other packet decipherings and the generate/authentication of final hashed value/label.) in figure B04～B08, we describe agreement with double engines, wherein, the ENMAC TX and the RX engine that are operated under cipher feedback pattern (CFB) operate total message, generate the overall length HV/ label relevant to total message; In parallel TX and RX, to the initialization simply of hash engine, then the encrypted frame of TX is carried out to Hash digest simultaneously, then authenticate the frame that each TX encrypts.If well receive frame, RX notifies TX to continue to send new frame signal.

Notice: the hash engine of TX receives has each encrypted word that monocycle major clock postpones.

PRF, pseudo-random function-we are called large-scale pseudo-random function by ZK encryption stream ciphers because as hacker's determinacy of a side of known hardware algorithm, IV, initialization sequence and key recovered expressly (and having generated cipher feedback pattern (CFB) label).We suppose that whole opponents know silicon algorithm, and can carry out all ZK encryption stream ciphers functions, and they are sides for the shared key of common and unique shared initial value IV pairing.(IV is compulsory in conventional flow is encrypted.)

Similarly, n bit length LFSR (linear feedback shift register) and nLFSR are called pseudo-random function independently, because be uniform for each in 2n-1 or 2n possible n bit output word by the probability of appearance.If hacker understands generation equipment, and have the access rights to 2n bit output string, he can calculate whole output string at once.

Random controller-random controller receives scale-of-two feedback signal from register group, and the output of top Splash matrix receives two feedback signals from data stirrer.Random controller comprises three control modules that comprise that driven by determinacy noise source, and which is fed to permutation encoding logic to this determinacy noise source remotely changing;

Take over party or " negotiation starting client "-for example, by for example wishing participation and conventionally initiating computerize and (consult, buy, buy, have or otherwise receive goods and/or service) the workstation that operates of people, alternatively with franchise price from operate the supplier of website at information network.Consult starting client establishment and send specific voucher request (consulting computerized voucher) via consulting the seller of computerize voucher transaction engine to these goods and/or service.

After revising message to the adjusting of link value-be for the classics attack of hash function: knowing modification (supplementing) link value state variable bit that will overturn, assailant can not be regenerated link value in the situation of its original value, attempt revising message word by another message modification, be most likely at next major clock place.

Assailant must estimate which bit is reversed, and the bit of attempting by upset subsequent message word is regulated to following link value.FortressGB is in the US2009/0304179 of " the Dual Feedback Precludes Message Modification " on September 7th, 2006 and whole 2 ³²in the demonstration test of individual possibility input word, show that this scheme can not be successful.

Register group-Figure 21 is the gathering with the non-linear LFSR (linear feedback shift register) of combinational logic, and in i variable, each is changed indelibly by each message bit and each initialization bit.

The test of the stochastic distribution of 32 bit words of pleonasm circuit sectionalizer-in large continuous sample set.The distribution of common test-based examination nibble and byte.

We are desirably in each test to find how many pleonasms

We adopt, and jejune scheme-because of the ideal distribution of large size and hypothesis pseudorandom words, in 10M sample, existence expectation finds the probability of the number that approaches ideal distribution very low; At each event place, finding a pair of chance is in 32 bit words, to find half of chance of certain number, 1/ (2 ³²x2).

Right number in n event is:

n(n-1)／2

Make, the number RW of 32 bit words that all repeat (twice, and extreme rare three times and four times) be:

RW=n (n-1)/(2 ³²x2); And for large n, in 32 bit words

RW ≈ n2/2 ³³), for large n.

Our 10,000,000 words of n=1 of sampling, distribute for perfection, expect that the estimation average number of pleonasm is 11,641.53 in 1,000 ten thousand events.Note, carry out these and test stochastic distribution pseudo-random function, and the effect hash of uncorrelated message word not being entered is carried out randomization.Test for incoherent non-trivial ashed information has provided better result.We suppose, because any message word has increased link value length.

Bemstein approximately 11,623 repeats for having measured of RD5 (RC5 block encryption) for the test of his Linux RNG function and we, is slightly better than " ideal ".

The assembly of result/feedback processor-ZK encryption stream ciphers engine, it processes 3 function result sending from data stirrer, and generates breakaway layer and lower feedback flow.Processor also will be lower FB regulate, breakaway layer FB regulates and two the common unpredictable counter result integration to two of HAIFA FB streams in.

Under MAC pattern, lower FB be with specify to regulate and the current results XOR of a HAIFA number XOR before XOR and (with the password mask of message XOR) of result; Wherein, breakaway layer feedback and anti-nibble current results word and the inner word that generates of the 2nd HAIFA number XOR " adjusting ".

Under conventional flow cipher mode, result be message and password mask XOR and, and do not sue for peace in arbitrary feedback.Conventional cipher is not the operation of cipher feedback pattern.The lower feedback of cipher mode be lower FB regulate and the XOR of 32 bits of 64 bit HAIFA counters with; And the feedback output of conventional flow cipher mode breakaway layer be the S box of SuperMIX rotation and 32 bits of HAIFA counter XOR and.Briefly: conventional flow password result and feedback are not the functions of message input.

Under MAC pattern, the initialization that the ZK after the overall situation is reset encrypts only can realize by be fed to predefined message word in port B.

Adjusting-pre-service feedback randomization value, the preferably pseudorandom of hash function feedback flow.In ZK encryption stream ciphers result/feedback processor, two the quadrature ZK of two uncorrelated streams " adjusting " that generate in ZK encryption stream ciphers PRF (pseudo-random function) and 64 bit HAIFA counters encrypt feedback flow.

Scrambling function in scrambling-ZK encryption stream ciphers is simple flooding mechanism, we come before encrypting, before eap-message digest and before hashed value/label generates with it, maximize initialized password complexity (hiding weak key), and make it possible to increase the security being tied in hardware.Briefly: single scrambling is single major clock process under MAC pattern, and message word input be locked into complete " 5 " word.In initialization Crypto Period, lower feedback regulation and breakaway layer feedback regulation word are distinguished XOR with operation 32 bit breakaway layer HAIFA counters and with the lower feedback of 32 bit HAIFA counter.

Shadow memory-for the preferred embodiment of consulting computerize voucher (CMV) agreement, added shadow memory and shadow memory circuit automat, it automatically preserves last link value that each successful hashed value generates in shadow memory; That is, " startup " link value of next text Hash digest, wherein, is linked to the variable bit in shadow memory in each the variable bit function in link value.

ZK encrypts shadow memory automat and in shadow memory, preserves the link value of " well ", and be used in preservation before in shadow memory before the link value of " well " replace the link value of " bad luck ".

Having shadow memory that automat controls simplifies and has accelerated computerized negotiation.

Smart card-have traditional papery or the plastics configuration of approximate same size with traditional plastics credit cards, has semiconductor memory, has or do not have CPU or encrypted master, referring to " token ".

Exchange@-defined the cipher feedback pattern of operation

If exchange@A-has configured PRF (pseudo-random function) under " transmit leg cipher feedback pattern "

If exchange@B-has configured PRF (pseudo-random function) under " consulting starting client cipher feedback pattern ", for example, according to Fig. 9～12 and Figure 20.

Supplier-computerized entity, it is consulted with consulting starting client, and makes to consult the voucher that starting client can be used the negotiation starting client management that computerize voucher transaction engine system generates through consultation.

The data subset of supplier's database-within keeping supplier's account data and the computerized voucher transaction engine of the negotiation of information database.

Supplier's product web-comprise and fixing a price and standard sale clause.

Regular collection in supplier's regular collection (VRS)-each supplier's system, it is that supplier is specific, and is used by transaction engine, to analyze and to consult each and consult the negotiation computerize voucher request that starting client is drawn up.Regular collection is managed by supplier conventionally.Conventionally these rule associations to and be adapted to the profile classification of specific products and service and negotiation starting client.

Supplier website-supplier's e-commerce website or the e-commerce website being associated with supplier, wherein, consult supplier's specific products/service that starting client can search for and select them to pay close attention to.Consult computerize voucher editing machine or maker and be included in this website, wherein, consult starting client and can select to create draft negotiation computerize voucher.

Voucher format token-contain method at interior form, wherein, transmits redeemable voucher/token VRT to consulting starting client.Common voucher format token comprises:

(a) the paper voucher of printing, the security details that comprises voucher and one dimension or two-dimensional bar:

(b) the bar code voucher of being in and printing.In order to increase security, the call number of voucher can be forwarded to the selected element of transmission, as in US8056802, or to negotiation starting client, sends and prints by consulting starting client use authority bar code via e-mail.

(c) coding or the uncoded voucher code that via supplier's website, to negotiation starting client e-commerce website, transmit;

(d) use the virtual voucher of the activation mechanism of smart card; And/or

(e) near-field communication, NFC voucher, NFC mobile device (normally mobile phone, has smart phone feature conventionally) is safe virtual redeemable voucher pass through mechanism thus.

Voucher is consulted the computerize subsystem of the negotiation computerize voucher transaction engine of engine (VNE)-be incorporated in consulting computerize voucher transaction engine, and it is processed and is consulting negotiation computerize voucher that starting client generates and the negotiation between supplier.Voucher is consulted engine (VNE) (for example, VRS), can generate the process of " A ", " N " or " R " voucher to each negotiation computerize voucher application supplier's regular collection.

Voucher reader-physical computer digital device, is designed to read in voucher and redeems printing and/or the authorization code carrying on token, and makes it possible to realize to consulting mandate and the single use redemption of the voucher of starting client management.Supplier can or use voucher reader as via TCP/IP and the separate unit of consulting computerize voucher transaction engine and being connected, or as direct point-to-point to supplier's point of sale device from LAN gateway.This unit reads voucher and redeems token (VRT) and will redeem information recording in consulting computerize voucher transaction engine database.

Voucher is redeemed the medium that token (VRT)-electronics generates, consult thus starting client draft voucher, once supplier accepts and redeems, and " A-voucher " is transformed to redeemable/usable medium, consult starting client and can utilize it to obtain goods and the service of consulting on clause.

" A-voucher ", refusal voucher " N-voucher " or offer " R-voucher " are again accepted in voucher response (CMVR)-can be.Supplier consults the clause that engine continues revision response, until preferably generate A voucher (acceptance) or N voucher (not accepting), supplier's response is robotization completely.This response is the function of the up-to-date profile of the negotiation starting client that keeps in Secure Transaction engine database.Conventionally the request receiving for specific products that known loyalty is consulted starting client is to than not having the formerly more positive response of new negotiation starting client of transactions history, and supplier conventionally receives the discount of minimizing or there is no discount.

ZK encryption-any stream cipher, for example described herein or as the patent documentation of quoting herein in describe, for generating random series, for the stream of encryption and decryption binary word, and for verifying the stream of binary data or the not change state of file; Wherein, binary word shows in fact undistinguishable or can not be able to distinguish the nonrandom word in engine; And approach very much encrypt the zero knowledge leakage in three holy song sanctuary (Sanctus Sanctorum) from register group, ZK.

Specific embodiment of the present invention seeks to be provided for the computerized system and method that the authentication of the supply of material or other application is consulted.

Specific embodiment of the present invention seeks to be provided for buying from seller the negotiation scheme of the negotiation starting client management of goods and various services.

Traditionally, proposing offer is seller's field, and acceptance is take over party's field.Relatively, specific embodiment of the present invention provides computerize voucher to consult, for example to make take over party can create " take over party manages voucher " with digital form, it comprises for example, the computerize request for the product on particular conditions () of going to certain computer entity.For seller, this offer of engine automatic evaluation " negotiation " also returns to one of for example " acceptance ", " offer again " or " refusal " response.This retailer's response is robotization, and the negotiations process based on complex rule being merged in voucher instrument of exchange is depended in consequent response.

Conventionally, consulting starting client will have and receive " offer voucher again " and continue afterwards the option of negotiation.

The voucher (consulting computerize voucher) of consulting starting client management is the computerize document conventionally being created by take over party, according to a particular embodiment of the invention conventionally according to supplier's the incompatible negotiation of voucher rule set.This rule coverage price, transmission clause and product specification.If the offer of buying meets scope, seller accepts this offer.If in approaching the closing on of definition, seller prepares counter offer (counter offer).If this offer is outside approaching closing on, seller sends refusal, i.e. n-voucher.

The voucher transaction engine (CMVTE) of take over party's management or " consulting computerize voucher transaction engine " generally include computer based supplier function; conventionally or asymmetric commercial rank symmetrical by conventional hardware encrypts to protect; it can ask the side of being received the voucher of consulting starting client management, by seller, is consulted and is responded.Can be used as that difference in functionality assembly is incorporated in other software solution is fail-safe computer software process, for example seller's website or e-commerce website, or can be on a plurality of sellers independent operating.

Specific embodiment of the present invention is sought to be provided for making take over party can register the system of his user account.For example, for each take over party input with generate his/her profile data (, system CID).

Specific embodiment of the present invention seeks to provide a kind of system, wherein, can by take over party's account (CA) and supplier (for example, CVD) or other third party (the additional receiving side data of for example, C3D) holding is associated.

Specific embodiment of the present invention seeks to provide a kind of system, and wherein, the negotiation starting client of registration can generate the voucher (consulting computerize voucher) of his/her take over party's management.

Specific embodiment of the present invention seeks to provide system as above, wherein, consult computerize voucher and comprise the relevant provision (CMVT) conventionally being defined by supplier, take over party can adjust the value/parameter of this clause thus, usings and consults clause more favourable for them as a part for the negotiations process with supplier.

Specific embodiment of the present invention seeks to provide a kind of system, uses thus negotiation engine (VNE) to represent that supplier and take over party carry out automatic Evaluation and consult each and consult the request of computerize voucher.Regular collection (VRS) based on each supplier predefine and renewal in consulting computerize voucher transaction engine and in receiving side data storehouse the related data held relevant to take over party (for example, CD), determine negotiation.

Specific embodiment of the present invention seeks to provide a kind of system, and the mutual negotiation phase of each negotiation computerize voucher causes the robotization response (CMVR) from supplier to take over party thus.

Specific embodiment of the present invention seeks to provide a kind of system, and take over party can continue to consult with supplier by the voucher response (CMVR) of revision negotiation starting client management thus, until CMVR accepts or is the refusal of CMVR.

Specific embodiment of the present invention seeks to provide a kind of system, thus, can redeem token (VRT) with physics or digital voucher, redeem the means of consulting computerize voucher and to take over party, send the negotiation computerize voucher (being called " A " voucher) of reaching an agreement.

Specific embodiment of the present invention seeks to provide a kind of system, thus, can under the clause of reaching an agreement, for goods and service, redeem the voucher redemption token (VRT) of reaching an agreement by take over party, for example have can acceptance clause the negotiation computerize voucher of reaching an agreement.

Specific embodiment of the present invention seeks to provide a kind of system, and it has been incorporated to voucher reader, and voucher reader provides and reads and redeem the easy-to-use route that voucher is redeemed token (VRT) to supplier.

Specific embodiment of the present invention seeks to provide a kind of system, and this system can mutual with a plurality of marketing channels-online and off-line, comprises point of sales system, so that redeem A voucher in place as much as possible with in mode as much as possible.

Specific embodiment of the present invention seeks to provide a kind of system, and thus, voucher is redeemed token (VRT) and can be transmitted with a plurality of forms, includes, but is not limited to: paper, numeral, virtual (smart card activation), mobile, NFC.

Specific embodiment of the present invention seeks to be provided for the Reception Control system that voucher is consulted.This system makes take over party can use " take over party manages voucher " to create their sales promotion with digital form, make it possible to realize go to specific supplier for the product on particular conditions or the more efficient request of service.For seller, this offer of engine automatic evaluation " negotiation " also returns to " acceptance ", " offer again " or " refusal " response.This supplier's response is robotization, and the negotiations process based on complex rule being merged in voucher instrument of exchange is depended in consequent response.

Specific embodiment of the present invention seeks to provide the voucher to the purchase of goods and/or service of secure network take over party management to consult and the payment system for networking and buying, and the uniquely defined take over party that this networking is bought in seller's Database Systems of take over party's unique selection initiates:

Wherein, receive direction seller submits the acceptable bill format voucher of seller to; And/or wherein, this draft voucher of the follow-up use of interactively in the negotiations process between take over party and seller; And/or wherein at each negotiation phase, seller can return to one of three kinds of format vouchers; Again offer voucher, refuse invalid vourcher, accept voucher; Or after reaching an agreement when paying, final redeemable voucher, makes it possible to transmit quoted goods by common carrier, for selling directly to households to transmit via particular retail, for transmitting via specific wholesale direct selling, or for the wholesale direct selling of a lot of retails, any one transmits.

Alternatively, transmitting some place, redeemable voucher is invalid.

Alternatively, at the wholesale transmission point of retail place, transmission side will have the list of at least one unique expection take over party's voucher.

Alternatively, redeemable voucher will have and have cipher key Hash value, and it can be read by seller or seller's agency.

Alternatively, redeemable voucher will comprise for identifying take over party's insufficient information.

Alternatively, can use standard EMV, cash, Stored Value mobile telephone equipment or shellfish precious (PayPal) or similar mutual take over party seller or the seller that reaches an agreement acts on behalf of to pay.

Thereby at least one embodiment according to the present invention provides, wherein;

The present invention generally includes at least following examples:

Embodiment 1, a kind of for the convenient system carrying out computerize negotiation between computerized first instance and second instance overall, described system comprises:

The jjoint venture investment processor that first instance is controlled, make first instance in computerized first instance overall to propose the first version that the proposal between described first instance and at least one second instance is jointly invested at least one second instance in computerized second instance overall, described first version comprises that each in corresponding jjoint venture investment parameter sets jointly invest the first value set of parameter; And

The jjoint venture investment processor that second instance is controlled, make the second instance in computerized second instance overall to receive the described first version that described proposal is jointly invested from described first instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described first instance transmission, described jjoint venture investment is revised communication and is comprised the change at least one value in described the first value set, definition comprises for each in corresponding jjoint venture investment parameter sets and jointly invests the second version that the described proposal of the second value set of parameter is jointly invested thus,

Wherein, the jjoint venture investment processor that described first instance is controlled is also for making described first instance receive described the second version that described proposal is jointly invested from described second instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described second instance transmission, the change that communication comprises at least one value up-to-date described the second value set receiving of jjoint venture investment processor to controlling from described second instance is revised in described jjoint venture investment, definition comprises that the added value for each the jjoint venture investment parameter in corresponding jjoint venture investment parameter sets is integrated into the additional version that interior described proposal is jointly invested thus.

Embodiment 2, according to the system described in embodiment 1, wherein, at least one in described jjoint venture investment processor used that the jjoint venture investment processor of programming is in advance specific to be accepted offer negotiation rules again, determines it is that transmission is jointly invested and accepted communication or jointly invest and revise message.

Embodiment 3, according to the system described in embodiment 1, wherein, at least one in described jjoint venture investment processor jointly invested for the another one transmission to described jjoint venture investment processor and accepted message, jointly invests and revise message and jointly invest the communication selected in refuse information.

Embodiment 4, according to the system described in embodiment 1, wherein, at least one in described jjoint venture investment processor used the specific offer again of the jjoint venture investment processor create-rule of programming in advance, determines whether and how to change at least one in another the up-to-date parameter value receiving from described jjoint venture investment processor.

Embodiment 5, according to the system described in embodiment 4, wherein, the create-rule of offer again of programming comprises the jjoint venture investment processor ad hoc rules for following operation in advance:

Another up-to-date parameter value receiving based on from described jjoint venture investment processor is determined jjoint venture investment partner wish mark at least partly;

Determine the weight of the unit gap between the value being proposed for each parameter by described the first jjoint venture investment processor and the second jjoint venture investment processor; And

At least reduce the interval of jointly investing between processor and the value of the up-to-date proposition of the second jjoint venture investment processor by described first, make the summation reducing for the interval being obtained by described Weight respectively of all parameters corresponding to described wish mark.

Embodiment 6, according to the system described in embodiment 5, wherein, the summation reducing for the interval being obtained by described Weight respectively of all parameters is with the corresponding part of described jjoint venture investment partner wish mark: the jjoint venture investment partner wish mark of the described single jjoint venture investment processor that the rule of using the negotiation of holding consultation with single jjoint venture investment processor to jointly invest processor calculates is larger, by described negotiation, jointly invest that rule that processor uses ratifies by described single jjoint venture investment processor and described negotiation jointly invest processor interval between the value of up-to-date proposition reduce just larger.

Embodiment 7, according to the system described in embodiment 5, wherein, the create-rule of offer again of programming comprises in advance: for determine at least partly the jjoint venture investment processor ad hoc rules of the jjoint venture investment partner wish mark of described specific jjoint venture investment processor based on the formerly understanding relevant to specific jjoint venture investment processor.

Embodiment 8, according to the system described in embodiment 1, wherein, the jjoint venture investment processor that described first instance is controlled is mutual via website and human user, comprises to described human user presentation information and from described human user reception information.

Embodiment 9, according to the system described in embodiment 1, wherein, described jjoint venture investment comprises: from provider, to take over party, provide resource, and the described first instance that proposes described first version comprises described take over party, and described second instance comprises described provider.

Embodiment 10, a kind of for the convenient computerized method carrying out computerize negotiation between computerized first instance and second instance overall, described method comprises:

The jjoint venture investment processor that provides first instance to control, the jjoint venture investment processor that described first instance is controlled makes first instance in computerized first instance overall to propose the first version that the proposal between described first instance and described at least one second instance is jointly invested at least one second instance in computerized second instance overall, and described first version comprises that each in corresponding jjoint venture investment parameter sets jointly invest the first value set of parameter; And

The jjoint venture investment processor that provides second instance to control, the jjoint venture investment processor that described second instance is controlled makes the second instance in computerized second instance overall to receive the described first version that described proposal is jointly invested from described first instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described first instance transmission, described jjoint venture investment is revised communication and is comprised the change at least one value in described the first value set, definition comprises for each in corresponding jjoint venture investment parameter sets and jointly invests the second version that the described proposal of the second value set of parameter is jointly invested thus,

Wherein, the jjoint venture investment processor that described first instance is controlled is also for making described first instance to receive described the second version that described proposal is jointly invested from described second instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described second instance transmission, the change that communication comprises at least one value up-to-date described the second value set receiving of jjoint venture investment processor to controlling from described second instance is revised in described jjoint venture investment, definition comprises that the added value for each the jjoint venture investment parameter in corresponding jjoint venture investment parameter sets is integrated into the additional version that interior described proposal is jointly invested thus.

Embodiment 11, according to the computerized method described in embodiment 10, wherein, the described jjoint venture investment processor that provides first instance to control comprises: maintain the data integrity that exchanges at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

According at least one first frame being generated by the first exchange participant, calculate the first non-transmission hashed value;

At least according to described the first frame and described the first non-transmission hashed value, calculate the second transmission hashed value; And

To at least the second participant, send at least described the first frame and described the second hashed value.

Embodiment 12, according to the computerized method described in embodiment 10, wherein, the described jjoint venture investment processor that provides second instance to control comprises: maintain the data integrity that exchanges at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

From the first participant, receive at least the first message frame and the second hashed value;

According at least described the first message frame and described the second hashed value, carry out reconstruct the first hashed value; And

Use described the first hashed value as the key for described first at least one frame of participant continuation exchange.

Embodiment 13, according to the computerized method described in embodiment 12, wherein, by described key for carrying out hash at least one frame that will send to described the first exchange participant.

Embodiment 14, according to the computerized method described in embodiment 12, wherein, by described key at least one additional frame receiving from described the first exchange participant is carried out to hash.

Embodiment 15, according to the computerized method described in embodiment 12, wherein, described continuation exchange comprises described reception and described reconstruct, and resulting the first hashed value is used as with described the first participant and further continues at least additional keys of another frame of exchange.

Embodiment 16, according to the computerized method described in embodiment 15, wherein, described additional keys is for carrying out hash at least one additional frame that will send to described the first exchange participant.

Embodiment 17, according to the computerized method described in embodiment 11 or 12, wherein, described at least one, participant comprises the pseudorandom hardware device based on cipher feedback pattern.

Embodiment 18, according to the computerized method described in embodiment 17, wherein, each pseudorandom hardware device based on cipher feedback pattern is programmable, usings as for generating the Data Generator of Hash digest and the transmitter of at least one frame and replacing as comprising between the receiver that generates the Hash digest that receives data.

Embodiment 19, according to the computerized method described in embodiment 18, wherein, each pseudorandom hardware device based on cipher feedback pattern is programmable, usings as for generating the Data Generator of Hash digest of at least one frame and transmitter and replacing at random as comprising between the receiver of the Hash digest that generates reception data.

Embodiment 20, according to the computerized method described in embodiment 18, also comprise: by described the second hashed value, verify described Hash digest and described the first hashed value.

Embodiment 21, according to the computerized method described in embodiment 11, wherein, described at least the first exchange participant and the second exchange participant comprise described the first participant and a plurality of the second exchange participant, and described transmission comprises: to described a plurality of the second exchange participants, send at least described the first frame and described the second hashed value.

Embodiment 22, according to the computerized method described in embodiment 11, wherein, calculate described the first non-transmission hashed value and comprise: the Hash digest of calculating at least described the first frame.

Embodiment 23, according to the computerized method described in embodiment 11, wherein, at least described the first frame is sent as commercial level coded frame.

Embodiment 24, according to the computerized method described in embodiment 22, wherein, described Hash digest comprises: first frame of encoding in commercial level.

Embodiment 25, according to the computerized method described in embodiment 11, wherein, described transmission comprises: to described the second participant, send the series connection of at least described the first frame and described the second hashed value.

Embodiment 26, according to the computerized method described in embodiment 12, wherein, by described continuation, exchange to generate final hashed value, and described final hashed value is carried out digital signature by participant.

Embodiment 27, according to the computerized method described in embodiment 26, wherein, at least one frame represents to propose at least one characteristic of transaction, and described final hashed value is illustrated at least one characteristic of the transaction of reaching an agreement between described participant, and described method also comprises:

In computerized database, storage is by the final hashed value of participant institute's digital signature in multiple exchange; And

The indication that complete of storage to the transaction being represented by final hashed value in described database, makes to prevent that by accessing the Trading Authorization that described database carries out transaction is done more than once.

Embodiment 28, according to the computerized method described in embodiment 26 or 27, wherein, adopt public key signature process to carry out digital signature to described final hashed value.

Embodiment 29, according to the computerized method described in embodiment 12, also comprise: by described the second hashed value, verify described the first hashed value and described the first message.

Embodiment 30, according to the computerized method described in embodiment 15, wherein, by described further continuation, exchange to generate final hashed value, and by participant, described final hashed value carried out to digital signature.

Embodiment 31, according to the computerized method described in embodiment 15, wherein, by described additional keys for to carrying out hash from described first at least one frame except described the first frame of receiving of exchange participant.

Embodiment 32, a kind of for maintaining the computerized system that exchanges the data integrity of at least one computerized frame between the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described system comprises:

Receiver, for receiving at least the first message frame and the second hashed value from described the first participant;

Hasher, for carrying out reconstruct the first hashed value according at least described the first message frame and described the second hashed value; And

Scrambler, for using described the first hashed value as the key for described first at least one frame of participant continuation exchange.

Embodiment 33, a kind of for maintaining the computerized system that exchanges the data integrity of at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described system comprises:

Hasher, for calculating the first non-transmission hashed value according at least one first frame being generated by described the first exchange participant, and for calculating the second transmission hashed value according at least described the first frame and described the first non-transmission hashed value; And

Transmitter, receives and sends at least described the first frame and described the second hashed value at least described the second participant from described hasher.

Embodiment 34, a kind of for maintaining the computerized method that exchanges the data integrity of at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

According at least one first frame being generated by described the first exchange participant, calculate the first non-transmission hashed value;

According at least described the first frame and described the first non-transmission hashed value, calculate the second transmission hashed value; And

To at least described the second participant, send at least described the first frame and described the second hashed value.

Embodiment 35, a kind of for maintaining the computerized method that exchanges the data integrity of at least one computerized frame between the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

From described the first participant, receive at least the first message frame and the second hashed value;

According to described at least the first message frame and described the second hashed value, carry out reconstruct the first hashed value; And

Use described the first hashed value as the key for described first at least one frame of participant continuation exchange.

Embodiment 36, a kind of computer program, comprise computer usable medium, in described computer usable medium, embodied computer readable program code, described computer readable program code is suitable for being performed to realize the method that exchanges the data integrity of at least one computerized frame between at least the first exchange participant and the second exchange participant for maintaining, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

According at least one first frame being generated by described the first exchange participant, calculate the first non-transmission hashed value;

According at least described the first frame and described the first non-transmission hashed value, calculate the second transmission hashed value; And

To at least described the second participant, send at least described the first frame and described the second hashed value.

Embodiment 37, a kind of computer program, comprise computer usable medium, in described computer usable medium, embodied computer readable program code, described computer readable program code is suitable for being performed to realize the method that exchanges the data integrity of at least one computerized frame between the first exchange participant and the second exchange participant for maintaining, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

From described the first participant, receive at least the first message frame and the second hashed value;

According to described at least the first message frame and described the second hashed value, carry out reconstruct the first hashed value; And

Use described the first hashed value as the key for described first at least one frame of participant continuation exchange.

Alternatively, the first hashed value smart-tag authentication device detects the wrong hashed value on data field, and RX request repeats transmission.

Alternatively, each authenticates the link value of place, district generation in the shadow memory of full concatenation value, to be stored in end, makes the value of storing in shadow memory can regulate the link value that is ready to receive the generation equipment that truly perfection of authentication is transmitted.

Alternatively, after the firstth district of the data of verify data, each district comprises data field series connection, and wherein, first is from the hashed value/label of data field before.

Alternatively, after the firstth district of the data of verify data, each district comprises data field series connection, wherein, first is by from the TX of data field and the first hashed value/label that RX generates before, and the second hashed value/label of making a summary according to tandem data and the first hashed value, by TX, to RX, send and authenticated by RX.

Alternatively, with key, come initialization the first data field, wherein, all follow-up enciphered datas can not be deciphered by feasible, and all subsequent Hash/labels can not be used for verify data district, feasible ground to the entity of the resource of the successful violence search of primary key by not having the access rights of key and not having for carrying out.

Alternatively, can be in the situation that do not eliminate the effect of final district and signed tokens, any front continuum of deletion verify data.

Alternatively, final hashed value/label or its part are connected in series to the data stream that comprises the voucher with a.

Alternatively, central computer is recognized all reward vouchers, the voucher for example occurring, and do not allow to show voucher more than once.

A kind of computer program is also provided, comprise computer usable medium or computer-readable recording medium, normally visibly, wherein embodied computer readable program code, and computer readable program code is suitable for being performed to realize any or all of method shown and described herein.Be to be understood that: any or all of calculation procedure shown and described herein can be realized by computing machine.Can be by being configured to especially the computing machine of required object or being carried out by the multi-purpose computer that the computer program of storing in computer-readable recording medium is configured for required object especially according to the operation of instruction herein.

Any suitable processor, display and input media can for the treatment of, (for example show, on computer screen or on other computer output equipments), store and receive information, for example, by shown in this paper and described any method and apparatus information of being used or generating; According to some or all embodiment of the present invention, above-mentioned processor, display and input media comprise computer program.Any or all of function of the present invention shown and described herein can by conventional personal computer processor, workstation or other programmable devices or computing machine or for the treatment of electronic computing device (general or special configuration) carry out; Computer display and/or printer and/or loudspeaker are for showing; Machine readable memory, for example, CD, CD ROM, magneto-optic disk or other dishes; RAM, ROM, EPROM, EEPROM, magnetic or light or other card, for storage, and keyboard or mouse are for accepting.As the term " processing " above using is for example intended to comprise, to being expressed as calculating or manipulation or the conversion of any type of the data of physics (, electronics) phenomenon, this phenomenon can occur or reside in the register and/or storer of computing machine for example.

The said equipment can be communicated by letter via the wired or wireless digital communication apparatus of any tradition, for example, and for example, via wired or cellular phone network or computer network, internet.

According to a particular embodiment of the invention, device of the present invention can comprise machine readable memory, it comprises or otherwise stores the program of instruction, when carrying out the program of this instruction by machine, the program of this instruction has realized some or all in device of the present invention shown and described herein, method, feature and function.Alternatively or additionally, according to a particular embodiment of the invention, device of the present invention can comprise program as above, this program can be write with any traditional programming language, and comprise alternatively the machine for executive routine, (but being not limited to) multi-purpose computer for example, its alternatively instruction according to the present invention configure or activate.Any instruction being incorporated to herein can be in whatsoever suitable place to representing that the signal of physical object or material operates.

Describe in the next section embodiment and other embodiment of institute's reference above in detail.

Any trade mark occurring in text or accompanying drawing is its possessory property, and occurs an only example for explaining or illustrate how embodiments of the invention can be realized in this article.

Unless as apparent special declaration separately in follow-up discussion, otherwise should recognize in the discussion of instructions, use for example term of the following: " processing ", " calculate (computing) ", " estimation ", " selection ", " rank ", " marking ", " calculate (calculating) ", " determine ", " generation ", " reappraise ", " classification ", " generation ", " generation ", " Stereo matching ", " registration ", " detection ", " association ", " stack ", " acquisition " etc., refer to action and/or the processing of computing machine or computing system or processor or similar electronic computing device, this computing machine or computing system or processor or similar electronic computing device will be expressed as the data manipulation of physics (for example electronics) amount and/or be transformed to the storer at computing system in the register at computing system and/or storer, register or other this information storages, similar other data that are expressed as physical quantity in transmission or display device.Term " computing machine " should be broadly interpreted as the electronic equipment of containing any type with data-handling capacity, comprise (as non-limiting example): personal computer, server, computing system, communication facilities, processor (for example, digital signal processor (DSP), microcontroller, field programmable gate array (FPGA), special IC (ASIC) etc.) and other electronic computing devices.

Only for purposes of clarity, can use for the specific term such as certain programmed language, operating system, browser, system version, each product and describe the present invention.Should recognize: this term is intended to be known and passed on briefly by example the General Principle of operation, and is not intended to limit the scope of the present invention to any certain programmed language, operating system, browser, system version or independent product.

Accompanying drawing explanation

Specific embodiment of the present invention has been shown in the following drawings:

Fig. 1 a be according to a particular embodiment of the invention for convenient simplification half block diagram half diagram carrying out the example system of computerize negotiation between computerize the first and second entities overall.

Fig. 1 b is simplification half block diagram half diagram of the partner's that operates completely according to a particular embodiment of the invention registration process, so that carry out computerize negotiation with computerize voucher, with the state or the result that represent that computerize is consulted, it is useful for the input that for example generates the frame 18 of Fig. 1 a.

Fig. 1 c is simplification half block diagram half diagram of scheme according to a particular embodiment of the invention, and it is useful in the frame 18 of for example optionalization Fig. 1 a, and supplier creates and consults computerize voucher clause rule thus.

Fig. 1 d is simplification half block diagram half diagram of the voucher negotiations process of negotiation starting client management according to a particular embodiment of the invention, and it is useful in for example implementing the frame 1011 of Fig. 1 a.

Fig. 1 e is simplification half block diagram half diagram of negotiation computerize voucher redemption process according to a particular embodiment of the invention, and it is useful in for example realizing the frame 1013 of Fig. 1 a.

Fig. 1 f has formed the simplification logical flow chart of voucher negotiation engine completely according to a particular embodiment of the invention together with 1g, and it is useful in realizing the frame 1010 of Fig. 1 a.

Fig. 2 a is the simplified flow chart that comprises the method for step shown in some or all of appropriate sequence, and as shown in the figure, it is for example for holding consultation to consulting the voucher of starting client management.

Fig. 2 b has demonstrated and has described the rough schematic view how potential negotiation starting client activates the account of locating expection supplier.

Fig. 3 is the rough schematic view for the computing engines of the supplier with the set of sale auto negotiation predefine articles of agreement.

Fig. 4 is assembly related during voucher that the negotiation starting client in robotization excites is consulted and the rough schematic view of process.

Fig. 5 is the simplified flow chart that comprises the method for step shown in some or all of appropriate sequence, and as shown in the figure, it is for example for using consulting the refusal of the redeemable device of starting client or having issued negotiation.

Fig. 6 is the simplified flow chart that comprises the method for step shown in some or all of appropriate sequence, and as shown in the figure, it is for example for the continuous negotiation of clause.

Fig. 7 is the simplified flow chart that comprises the method for step shown in some or all of appropriate sequence, and as shown in the figure, it is for example for having the intermittence of series connection and complete negotiation computerize voucher (CMV) the multi-step authentication of final hashed value authentication is consulted; Wherein, all exchanges data are with expressly carrying out.

Fig. 8 is the simplified flow chart that comprises the method for step shown in some or all of appropriate sequence, and as shown in the figure, it is for example for having the intermittence of series connection and complete negotiation computerize voucher (CMV) multi-step of final hashed value authentication is consulted; Wherein, all exchanges data are encrypted.Step in Fig. 7 and Fig. 8 can exchange mutually, because the message sending with plaintext or cipher mode alternatively all generates identical link value & hashed value.

Fig. 9 is from USSN13/143, the block diagram of 172 (open as US2011/0286596), and wherein, transmit leg and take over party carry out identical Hash digest to initialization value; All in transmit leg and take over party's pseudo-random function PRF (pseudo-random function) engine; Under transmit leg cipher feedback pattern, operate; Described engine and formerly the FortressGB ZK of version are encrypted in function of equal value.

Figure 10 is that reorganization is from USSN13/143, the enhancing block diagram of 172 (open as US2011/0286596), wherein, at the lower transmit leg of the cipher feedback pattern PRF (pseudo-random function) of transmit leg, m clear-text message word carried out to Hash digest, described transmit leg sends described clear-text message; And take over party receives supposition and send accurately, this take over party carries out similarly Hash digest in take over party PRF (pseudo-random function), under transmit leg cipher feedback pattern.Mistake in transmission has been destroyed the link value in take over party's inside PRF (pseudo-random function) variable, has got rid of optional deciphering and real Hash digest.

Figure 11 is similar to Figure 10, that reorganization is from USSN13/143, the enhancing block diagram of 172 (open as US2011/0286596), wherein, at the lower transmit leg of the cipher feedback pattern PRF (pseudo-random function) of transmit leg, m clear-text message word carried out to Hash digest and coding, described transmit leg sends the clear-text message of described coding; And take over party receives supposition and send accurately, this take over party carries out similarly Hash digest and deciphering in take over party PRF (pseudo-random function), is configured under take over party's cipher feedback pattern.Mistake in transmission has been destroyed the link value in take over party's inside PRF (pseudo-random function) variable, has hindered correct deciphering and has destroyed orderly test hashed value.

Figure 12 adapts from USSN13/143, the enhancing block diagram of 172 (open as US2011/0286596), and wherein, transmit leg generates hashed value, from the link value of plaintext or encrypting plaintext message, starts.The hashed value of the generation of transmit leg is the encryption to the string of t complete " 5 " word in the cipher feedback pattern PRF (pseudo-random function) of transmit leg.Transmit leg has sent clear-text message; Send the hashed value that transmit leg generates.Take over party has received expressly or the supposition of encrypting plaintext sends accurately, and described text is carried out to Hash digest; Take over party to the automat shown in Figure 12 partly exports the deciphering to the hashed value of transmit leg, synchronously detects and test authentication, in the take over party PRF (pseudo-random function) configuring under take over party's cipher feedback pattern.The automat of Figure 12 has partly triggered the automat circuit of Figure 19 and 20, to preserve a link value (if authentication) in shadow memory, if or the mistake that a true link value occurs send, regulate described link value; The revision test that makes it possible to thus realize ciphertext or plaintext and hashed value sends.

Figure 13 adapts from USSN13/143, the block diagram of 172 (open as US2011/0286596), and it is designed to consult computerize voucher (CMV) and consults, and wherein, sends the clear-text message of the transmit leg with additional hashed value; Take over party receives and tests authentication; There is the link value of preserving and regulating; Make take over party can continue to exchange new negotiation message or request resends last erroneous transmissions.

Figure 14 adapts from USSN13/143, the block diagram of 172 (open as US2011/0286596), and it is consulted for consulting computerize voucher (CMV), wherein, sends the cipher-text message of the transmit leg with additional hashed value; Take over party receives and tests authentication; There is the link value of preserving and regulating; Make take over party can continue to exchange new negotiation message or request resends last erroneous transmissions.

Figure 15 is that the process ZK of the final approval step after successfully consulting computerize voucher (CMV) negotiation encrypts signal key drawing, wherein, supplier sends the unencrypted voucher with proforma invoice (Proforma Invoice) and draft token that will be signed by negotiation starting client.This draft token carrys out hash by PRF (pseudo-random function) alternatively, or the ashing technique of being reached an agreement by any other is carried out hash.

Figure 16 is that the process ZK of the final approval step after successfully consulting computerize voucher (CMV) negotiation encrypts signal key drawing, wherein, supplier sends the voucher of the encryption with proforma invoice (Proforma Invoice) and draft token that will be signed by negotiation starting client.This draft token carrys out hash by PRF (pseudo-random function) alternatively, or the ashing technique of being reached an agreement by any other is carried out hash.

Figure 17 is for being tied to by consulting starting client the schematic diagram that authenticates the prior art tradition RSA signature scheme of reaching an agreement on.

Figure 18 consults computerize voucher (CMV) for ZK encryption stream ciphers to explain unique notes and commentary circuit diagram that has, and has demonstrated in bit of link value and the association between the upper certification chain ad valorem bit of authentication store in shadow memory.

Figure 19 consults computerize and voucher (CMV) for ZK encryption stream ciphers to explain unique notes and commentary circuit diagram that has, the automat of having demonstrated in shadow memory authentication storage link value and having regulated wrong link value with the link value of an authentication.

Figure 20 is USSN13/143, and in 172 (open as US2011/0286596), the enhancing block diagram of ZK encryption stream ciphers handover mechanism circuit, wherein, changes into authentication circuit with hashed value and receive and synchronize.Result/feedback processor ZK encrypted circuit comprises two cross feedback streams, and as what prove in the US12/439556 authorizing at US, it has got rid of the message modification in Hash digest.Result/E hands over transmit leg and take over party's cipher feedback schema processor to comprise: use two incoherent pseudo-random values to carry out preconditioning to each feedback flow; And two unique 32 bit pseudo-random words are counted the mark on chronological link value.

Figure 21 adapts from USSN13/143, the block diagram of 172 (open as US2011/0286596).New explanation comprises unique circuit and automat, and referring to Figure 12～14 and 19～10, it is designed to process efficiently on the network of making an uproar computerize voucher (CMV) and other security negotiation processes of consulting.

Adopt in the accompanying drawings following term:

Fig. 4: a-voucher=acceptance response;

R-voucher=is offer response/request again;

N-voucher=refuses response.

Fig. 7 and 8:HV=hashed value; Cascaded H V binds all hashed values formerly.

Figure 13 and 14:

I has defined the number of initialization (init) word that comprises optional IV & scrambler;

M has defined the number of message word

T has defined the number (comprising prefix scrambler word) of hashed value word

N.O. define " not being output " or " read " or be sent to the data division of host port

* asterisk defines the value that has the network of making an uproar to send conventionally; Until hashed value proves other situations, otherwise be assumed to true.

P_INVOICE has defined non negotiable invoice.

Voucher has defined token voucher.

Embodiment

Described herein is to accelerate Transparent Authentication data exchange system, and wherein, alternately the time sequencing of transmit leg and take over party's message authenticates at each step place conventionally; For example, when each transmission or receipt message, in the situation that easily use the regulation for resending, if there is mistake, send, conventionally make final message Hash value from first to final message, authenticate negotiation in chronological order, wherein, final hashed value is tied to this entity the signature of whole exchanges data for what make it possible to realize one or more entities, and this signature can be expressly, coding and/or with the encryption of authentication integrality.It is useful that this system is consulted for supervisory computerization, and this computerize is consulted comprise the computerized negotiation that client is initiated and comprise computerized financial transaction.

Referring now to Fig. 1 a,, its voucher that shows negotiation starting client management is according to a particular embodiment of the invention consulted starting client process.The step of Fig. 1 a can comprise some or all steps of following appropriate sequence, for example as shown in the figure:

11 consult starting client goes to supplier's online website

12 consult starting client login and browse web sites according to normal activity

13 consult starting client selects the product (data that keep in consulting starting client standard electronic commercial affairs product database) that will buy

14 consult starting client selects to the shopping cart transmission product of supplier website.Once consult starting client, selected its all product/services that need, take over party moves to the shopping cart district of supplier website, just looks like will complete transaction equally.

15 suppliers' website is included in shopping cart district for the interface of consulting the voucher maker (CMVG) of starting client management.In this stage, take over party can select to create negotiation computerize voucher (or they can only normally complete their purchase certainly).

If 16 their selections create the negotiation computerize voucher of the goods of having selected for them, they need to use their username and password to sign in to the voucher maker (CMVG) of consulting starting client management.

If 17 take over party's registrations, take over party can directly move to the computerize voucher request of consulting that creates, if not, take over party may need the voucher maker (CMVG) of starting client management through consultation to consulting the registration of computerize voucher transaction engine; For example, at Fig. 1 b).

18 take over partys can create the clause (CMVT) of consulting computerize voucher and he/her being set, and this clause is obeyed supplier's regular collection (VRS) (for example,, in Fig. 1 c) of this product.

Once 19 complete, take over party can generate to the voucher of the system that will consult and consult the negotiation computerize voucher request (CMVR) (110) that engine (VNE) sends.

1011 use supplier regular collections and for example consult starting client data, to consulting computerize voucher hold consultation (, in Fig. 1 d).

If 1012 vouchers drop on outside supplier's regular collection (VRS), and are rejected, via voucher maker (CMVG) interface (114) of consulting starting client management, to take over party, send refusal notice.

If 1013 vouchers can be accepted, for example, for this voucher distribution (, in Fig. 1 e) voucher, redeem token (VRT), and take over party can complete by the shopping cart of supplier website the transaction (1.16) on the clause of reaching an agreement.

1015 vouchers are consulted engine can also send the offer of revision via voucher maker (CMVG) interface of consulting starting client management to take over party, for take over party, accept or refusal.If they accept this revision offer, create voucher and redeem token (VRT) (for example, in Fig. 1 e), if they refuse this offer, stop request.

Fig. 1 b shows the process that is registered as take over party according to a particular embodiment of the invention.The step of Fig. 1 b can comprise some or all steps of following appropriate sequence, for example as shown in the figure:

21 voucher maker (CMVG) interfaces that starting client is managed through consultation, new take over party can consult to register take over party's account in computerize voucher transaction engine system.

22 consult starting client selects new take over party to set up

23 use unique username and password to create new account in consulting starting client database

24 point out input profile data (CID) to new take over party, and it is stored in consults in starting client database (CD).

25 consult starting client database (CD) keeps all information relevant to take over party, and comprise and consult starting client input data (CID) and from supplier's oneself receiving side data storehouse (for example, CVD) (26) and other third party databases are (for example, C3D) additional information of (27) (for example,, in Fig. 1 a).A part (two for example, in Fig. 1 d) by this receiving side data as voucher negotiations process.

Once 28 take over party's accounts create, take over party can start to generate via voucher maker (CMVG) interface of consulting starting client management the computerize voucher request of consulting.

Fig. 1 c shows process according to a particular embodiment of the invention, and supplier creates and consults computerize voucher clause thus.The step of Fig. 1 c can comprise some or all steps of following appropriate sequence, for example as shown in the figure:

31 suppliers can manage negotiation computerize voucher clause via consulting computerize voucher transaction engine supplier interface.This assembly supplier can be arranged consult computerize voucher clause, take over party can be the restriction that each product is selected.

32 suppliers can access to your account creation facilities program (CFP) in the account of consulting on computerize voucher transaction engine.

33 supplier's accounts informations are stored in supplier's database.

34 suppliers can create the regular collection of each product/service, for defining negotiation starting client, can create the operable variable clause of negotiation computerize voucher request.

35 can arrange restriction for price, quantity, discount, date.

36 and can be item by item, the group of product item or as a whole owing to each in supplier's product database.

37 will consult computerize voucher clause rale store in supplier's regular collection (VRS), and be used as a part for voucher negotiations process.

38 suppliers can also specify and consult starting client profile factor as a part of supplier's regular collection (VRS); That is, take over party's formerly purchase, age, profile etc.

39 pairs of voucher maker (CMVG) application negotiation computerize voucher clauses of consulting starting client management, and used when they create the request of negotiation computerize voucher by take over party.

Fig. 1 d shows the negotiation computerize voucher request negotiations process that can operate according to a particular embodiment of the invention.The step of Fig. 4 can comprise some or all steps of following appropriate sequence, for example as shown in the figure:

41 negotiation starting clients can be used voucher maker (CMVG) interface of negotiation starting client management to create the request of negotiation computerize voucher, and (for example, Fig. 1 a)

42 consult engine (VNE) to the voucher of consulting computerize voucher transaction engine delivers request

43 consult engine (VNE) by voucher takes the negotiations process of robotization voucher.This process relates to system the negotiation computerize voucher clause in the request of negotiation computerize voucher and supplier's regular collection (44) of this product is compared.

44 specify in the situation of specific take over party's profile factor (that is, formerly consumption, age etc.) at supplier's regular collection (VRS), and system can be utilized the data of consulting in starting client database (45).Use and consult starting client input data (CID) (46), consult starting client supplier's data (CVD) (47) and consult starting client third party's data (C3D) (48) to create this data.

49 these systems can be analyzed CMVR and (consult the voucher response of starting client management or consult the request of computerize voucher, depend on context) and compare with supplier's regular collection (VRS) of each product, if and the clause of CMVR is in the tolerance limit of supplier's regular collection (VRS) rule, accept CMVR, if increment tolerance limit is in offer scope again, system can come again offer to consult computerize voucher by the clause of statement again, or if not, can rejection of offer.

If 4010 refusal CMVR, transmit this refusal via voucher maker (CMVG) interface of consulting starting client management to take over party

4011 if in offer tolerance limit again, and system can create for take over party's offer again and consult computerize voucher.Via voucher maker (CMVG) interface of consulting starting client management, to take over party, transmit this offer again.

If 4012 accept offer, can consult engine (VNE) by voucher and issue voucher redemption token (VRT), Fig. 1 e.

Fig. 1 e shows negotiation computerize voucher redemption process according to a particular embodiment of the invention.The step of Fig. 5 can comprise some or all steps of following appropriate sequence, for example as shown in the figure:

If 51 vouchers are consulted engine (VNE), accept (52) CMVR or consult starting client and accepted CMVR offer again, voucher is consulted engine (VNE) and can be generated voucher redemption token (VRT).

53 can generate voucher with different-format (voucher form) redeems token; The form generating can depend on that supplier is for by the preference of the product of offer or service.

54 voucher token forms are as follows:

55 can redeem voucher token (VRT) is distributed as physical sheets of paper or printing voucher, and it carries can be at the identification of place, supplier point of sale and unique bar code of redeeming.Take over party can directly print this voucher from consulting the voucher maker (CMVG) of starting client management, or transmits via e-mail.

56 can redeem voucher token (VRT) is distributed as the Moving-strip shape code sending to take over party's mobile phone, or as the activation of the NFC intelligent chip in take over party's mobile device.

57 can redeem voucher the virtual active (contact or contactless card) that token (VRT) is distributed as the smart card device that take over party is held.

58 can redeem voucher token (VRT) is distributed as take over party and can inputs to supplier website to redeem offer or as the voucher code of the immediate data storehouse link for supplier's e-commerce shopping cart, make take over party on the new clause of reaching an agreement, to complete purchase-transaction.

59 consult computerize voucher transaction engine is also accompanied by voucher reader, and this voucher reader is designed to and consults the on-line operation of computerize voucher transaction engine.Voucher reader can read and redeem by all physics of system creation, movement and digital voucher redeems token (VRT).Voucher reader is that independent unit maybe can be integrated into supplier's point of sales system.

Fig. 1 f～1g shows the example logic flow process of consulting engine for voucher according to a particular embodiment of the invention together.The step of Fig. 1 f～1g can comprise some or all steps of following appropriate sequence, for example as shown in the figure:

Can adopt two phase process:

Stage 1: the minimum that negotiation computerize voucher maker is established for supplier and the maximum computerize voucher scope of consulting check the negotiation computerize voucher clause that take over party inputs:

61, the 62 and 63 negotiation computerize voucher clauses 1 of being established by supplier are to n

64, the 65 and 66 minimum and maximum scopes that arranged for each clause by supplier

67,68 and 79 consult starting client for each clause, the clause request of input in consulting computerize voucher maker.

610,611 and 612 for supplier's scope, check each input, if in scope, accept, and generate the request of (616) negotiation computerize voucher

If 613,614 and 615 clauses are not in scope, via voucher maker (CMVG) interface of consulting starting client management, to take over party, notify, and take over party has and adjusts until the chance within the scope of supplier.If they want this option really, process stops.

Stage 2: check the computerize voucher request of consulting for supplier's rule.

617,618 and 19 supplier's regular collections of being set up in consulting computerize voucher transaction engine by supplier

620,621,622 and 23 for consulting starting client database, inquire about (for each supplier's regular collection (VRS), having one), and create output (VRO).

624,625 and 26 in supplier's regular collection (VRS) each, VRO is mated with the request of negotiation computerize voucher, if clause meets all VRO, accept to consult the request of computerize voucher, and distribution voucher redemption token (VRT) (627) is used for take over party.

If 628,629 and 30 for each supplier's regular collection (VRS), VRO does not mate the computerize voucher request of consulting, to refusal counter, add numeral 1, and mate with the next item down of supplier's regular collection (VRS) consulting the request of computerize voucher.For each refusal, counter is gone forward one by one to 1.

Once 631 and 32 inspecteds all supplier's regular collections (VRS), can issue offer again.Again the essence of offer is predetermined by supplier.Depend on the unmatched number of supplier's regular collection (VRS), system can be so that a plurality of offer again can be released.Do not mate (counter 1) for 1, can issue again offer 1.

633,634,635 and 36 additional do not mate (counter 2...n) for each, can issue another in predetermined offer again.Like this, take over party's approaches with supplier's regular collection (VRS) the negotiation computerize voucher request mate and can obtain better offer again than the take over party who only has with the inexact matching of supplier's regular collection (VRS); That is the more take over party of, consumption (if consumption is supplier's regular collection (VRS)) obtains better offer again than have the limited formerly take over party of consumption at supplier place.

Herein and the example of the application of described negotiation computerize voucher transaction engine include, but is not limited to following:

1) the computerize negotiation-take over party in aircraft industry wants order to carry in the specific date flight that Amsterdam is gone in specific course line; Wherein, known he be loyal.He goes for the excitation of travelling.Take over party can go to website, course line, select flight details, click course line and consult computerize voucher maker, and build their negotiation computerize voucher request: this request may be price rebate, rises cabin or even to the wish of the access rights in rest room, the wish of whether accepting flight at midnight, cost discount loyalty point, for food or the tax-free discount of buying of flight, agree to not accept free flight food or beverage, for discount or the acquisition of super economic class ticket is complete or extra frequent flyer is counted, the discount of hotel room etc.The standard that can select for flight, analyzes this request based on take over party's profile, can send response.If accepted, voucher can or can send digital voucher to take over party as standard electronic ticket and redeem token (VRT), and they can redeem the part as purchasing process online.

2) the computerize negotiation-take over party in retail is bought wants to buy particular item from retailer (or wholesale dealer or manufacturer).Take over party generates the voucher of take over party's management, and it is directed from the retailer who appends to vendor web site (supplier) and consults computerize voucher maker.By retailer, with consulting computerize voucher transaction engine, analyze the request of negotiation computerize voucher, and the profile based on take over party for example, generates automatic response with other computerization management factors (, inventory level).

3) the computerize negotiation-football fan in show business goes for the ticket of particular game.This football fan generates the voucher of take over party's management via the website of team oneself.By team, consult computerize voucher transaction engine and analyze this request.In response to negotiation, this football fan can receive acceptance (A voucher), refusal (N voucher) or offer (R voucher) again; For example, this football fan can receive asked voucher; Or have and increase the hospitable standard price offer as excitation; Or conventionally rarely found in the situation that, direct refusal.

Method shown and described herein can be for the effective identity of entity in proof system safely, reader to cryptographic operation provides information, and relatively little memory size can allow, and at entrance, according to applicant, nearest or direct state (about the login time interval of login point, expectation) allows the login of registration people off-line, and in some instances, due under many controling environment of people and must return in time line model,, or for time of university or clerk with attend entrance.

Automated transaction can occur in hardware, for example as described with reference to the embodiment of preceding Fig. 2 a in this paper.

The Fortress GB Ltd. system (some of them are disposed before the several years) that older business can be used is processed up to 50,000 system client dynamically changing, and the system of current deployment can be held up to 250,000 system clients in having the payment environment of a plurality of entrances.The rival of Fortress GB Ltd not yet can control the access to so large client.New system can hold this system up to 1,000,000 potential user wherein, can identify 1,000,000 in any one and enter each in applicant in a plurality of off-lines entrance.In the situation that use the new large-scale nonvolatile memory of the low-cost order of magnitude, access controller in the future can hold more than one hundred million User Token and the up to ten million reader of off-line, in a plurality of tradition and following equipment, embeds.

And with a plurality of level of securitys, method and apparatus, dispose these systems.Conventionally, the connection between reader, server, distribution computing machine and door and large door controller is protected with PKI and symmetric cryptography device, for example RSA, DES, 3DES and Wolfram method.On the smart card that many application and multiple vendor application have been protected at PKI conventionally and SIM chip, realize.Use contactless Inside and Mifare equipment, user has had the benefit of many application PKI protection smart cards and the application of a plurality of emulation PKI.

Interim U. S. application No.60/565 applicant, 393, described for the method and apparatus with contactless intelligent cartoon letters, wherein, for example, antenna in terminal device (, the mobile phone shown in Figure 14 and 15, the safe mass memory device of USB (Intellifiers)) is integrated in the keypad of terminal device.In this patent, we advise that antenna can also be included in the front plastic casing or plastic flip-open cover shell of terminal, to reduce power consumption, for particular importance the very near field NMR (nuclear magnetic resonance) using in unique material detects, for example, by the material of Micro Tag Temed Ltd. manufacturing, wherein, this material and detection means be at United States Patent (USP) 5,986, discloses in 550.

Can adopt any suitable technology to realize embodiment shown and described herein, for example dynamic website technology and database management system technique.

Should recognize: software rules and process do not need as shown and described herein, and can use any suitable teachings of artificial intelligence; Can adopt alternatively dynamic website environment.

According to wikipedia, " dynamic website is based on specific criteria, to come frequently and automatically to change or customize the website of itself.Dynamic website can have two types of dynamic movings: code and content.Dynamic code is sightless, or after being hidden in scene, and dynamic content is visible or shows completely.Dynamic code is with movable programming language rather than simple static HTML, to carry out the code of real-time dynamic construction.”

According to wikipedia, " for each individual, check dynamic web page ... prepare to have fresh information (content and/or layout).It is not static, because its along with time (for example, news content), user's (for example, preference of login sessions), user interactions (for example, web game), context (for example, parameter design) or their combination in any and change.”

Generating dynamic web page in real time, for example, by being stitched together the piece of code, process or program.The webpage dynamically generating can be recalled the item of information from database, and they are put together with predefined form, to present the coherent page to reader.The webpage dynamically generating can with user interactions, for example, by reading identification user formerly historical cookie, session variable, server side variable etc., or by using direct interaction, for example (but being not limited to) Form Element and mouse refusal.The webpage dynamically generating may be displayed on the current state of the dialogue between user, and/or specific information for unique user is provided.

Website can have the dynamic content that plane shows.Real time dynamic display variable content, for example, the content of storing in database by retrieval.According to wikipedia, " how the website with dynamic content is presented on webpage with reference to its message, text, image and other information, and more specifically, how its content changes at any given time.Web page contents changes based on specific criteria, and this standard is predefined rule or is variable user's input.”

There are various software systems, for example (but being not limited to) ANSI C servlets, the java server page (JSP), PHP, Perl, Python and Ruby programming language, ASP.NET, Active Server Page (ASP) YUMA and ColdFusion (CFML), they can be used for generating dynamic web system and Dynamic Website.Website can comprise from one or more database retrievals to content, or the content retrieving by the technology (RSS) of using based on XML.

This database can adopt data base management system (DBMS) (DBMS), for example (but being not limited to): Oracle, IBM DB2, microsoft sql server, PostgreSQL, MySQL and SQLite.

Dynamic website can be client-side script or server side scripting.In response to mouse or keyboard action or specifying timed events, can adopt client-side script and content creating to change the interface behavior in particular webpage.Wikipedia has been described: this webpage can be used the technology that presents of enriching interface page that is called as.Client-side script, for example (but being not limited to) JavaScript or action script, be respectively used to dynamic HTML (DHTML) and Flash technology, can be for the sound of dubbing in background music, animation, change text and other media item that present.Client-side script can relate to remote scripting, and by this remote scripting, the DHTML page, to server request additional information, is used any suitable technology, for example (but being not limited to) hiding framework, XML Http request or Web service.

Client-side content can generate on website user's computing machine.Web browser can be from the server retrieves page; In JavaScript, process (code for example embedding) and to user, show the content of pages retrieving in the page.Interior html attribute (or write order) contributes to client-side dynamic page to generate.

Server side scripting and content creating are described now.According to wikipedia, " server side scripting is web server technology, wherein, carrys out the request of authentication of users, with generating dynamic web page by moving direct script in web server ".Server side scripting can be for " interactive site is provided, and this interactive site and database or other data-carrier stores are mutual.The difference of this and client-side script is: by checking that web browser carrys out Run Script, conventionally have JavaScript form." server side scripting obtains " requirement based on user, right to access or for the inquiry of data-carrier store, carry out the ability of height customized responses ".According to wikipedia, " program of moving in web server (server side scripting) is for changing the web page contents on various webpages, or adjusts the order of webpage or reload.Server response can be determined by the condition of type, elapsed time or the database of the browser of data in the HTML list of delivering for example, parameter in URL, use or server state and so on.This webpage creates by means of server side language conventionally, for example ASP, ColdFusion, Peri, PHP and other language.These server side language are used CGI (Common Gateway Interface) (CGI) to produce dynamic web page conventionally.Two famous exceptions are ASP.NET and JSP, and they reuse CGI concept in their API, but in fact by all web request schedulings to sharing in virtual machine.Server side dynamic page can also be used the first kind dynamic content on client-side.”

By client and server side technical combinations, be also known.For example, Ajax be in the situation that not reloading webpage with the web development technique of server side dynamic exchange content.

Alternatively, can point out transaction participant input price and source, the rationality of Recommended Price has been established in this price and source, for example, the webpage of identical or relevant price is provided.

Alternatively, the no time of answer of last offer for supplier of record transaction participant, because the particular value window of this parameter can indicate transaction participant only in fishing.

Alternatively, the time that the answer of last offer for supplier of record transaction participant is.U. S. application 13/143172 has been described us, and how the pattern of accessing to your password is fed back to encrypt and hash, or encrypts in the situation that there is no hash, or in the situation that not reading encryption hash.This is exercisable in system described herein, because in this system, alternatively, hash and encryption do not need to adopt two kinds of different initialization and/or key.

Conventionally, the word that sends long frame set or encrypt as file data.Transmit leg will add the string of " 5 " (for example) sexadecimal word entirely, for example 5555555...5555 (Binary Zero 10101010...).Take over party is decrypted complete " 5 " of encrypting; Suppose and do not send error bit (encryption of data also will be exported gibberish (gibberish), but this may not be detected), and take over party's machine detects and counts complete " 5 ", and until all in transmitting at front bit, be all correct.Hash digest herein generally includes encrypted word is fed back in the thing that may be called as pseudo-random function PRF (pseudo-random function).The output of PRF (pseudo-random function), password mask are identical at transmit leg and take over party; It is to plain text encryption, and to decrypt ciphertext.Under cipher feedback pattern, each message bit is diffused in cipher machine in all variable bits.

Some or all elements that can provide in the encryption with integrality based on security negotiation Online Shopping are provided in detail referring now to Fig. 2 a to 8.

In Fig. 2 a to 8, word " buyer " and " client " are the examples of consulting starting client, and they are sought to initiate computerize and consult, and for example to activate, the privilege of goods and/or service are bought.

Fig. 2 a is the synoptic chart to the negotiation of voucher negotiation computerize voucher (CMV) process of negotiation starting client management of describing according to a particular embodiment of the invention.The step of Fig. 2 a can comprise in the following steps of appropriate sequence some, as shown in the figure or whole steps, for example, as shown in the figure:

1001 consult starting client logs on internet 1002.

1002 consult starting client research third-party product offer website 1320, and information extraction from third party's data (C3D) database 1330 thus, prepares to be used for creating franchise CMV.

Consult starting client and log on the maker website 1300 that supplier consults starting client management; In the data that keep, select the product that will buy from supplier's product offer website 1300, from 1305 supplier's product databases, extract product information.In this stage, consult starting client and be ready in the voucher maker of consulting starting client management, prepare to consult computerize voucher (CMV).

1003 in negotiations process end, and the e-commerce shopping cart of consulting starting client receives A voucher and voucher redemption token, makes to consult starting client and can receive the product buying.

1004 when completing transaction, consult starting client and publish, and the voucher maker (CMVG) of negotiation starting client management stored related data in consulting starting client database CD1310.

1005 consult starting client logs in the voucher transaction engine CMVTE Figure 30 01 that consults starting client management.

If 1006 negotiation starting clients are unregistered, consult starting client official registration in Fig. 2 b; Otherwise:

1007 consult starting client prepares for consulting the clause parameter of the CMV of starting client proposal.

1008 consult starting client creates negotiation computerize voucher, and the clause of negotiation starting client oneself that supplier's regular collection VRS of product is obeyed in definition in the voucher transaction engine CMVTE that consults starting client management, in Fig. 3 at element 3007 places.

1011 suppliers' voucher is consulted the CMV that starting client is consulted in engine VNE assessment, and judge or: refuse 1014 and stop in 1017; In 1013, accept and issue A voucher; The R of the offer again voucher that please look for novelty to negotiation starting client 1015.

1016 supplier's distribution have the voucher of A voucher and redeem token.

1018 suppliers assess and consult computerize voucher (CMV), and judge or in 1013, accept and issue A voucher; In 1017, stop; In 1015 to consulting starting client request offer again.

Fig. 2 b show according to a particular embodiment of the invention for registering the process of new negotiation starting client.The step of Fig. 2 b can comprise some or all steps in the following steps of appropriate sequence, for example, and as shown in the figure:

2001 consult the new negotiation starting client of the formal acceptance of registration interface BRI of starting client.

2002 create new negotiation starting client account CA, to consulting starting client, ratify unique username and password.

2003 consult starting client input profile data CID to consulting starting client prompting input, and it is stored in consults in starting client database CD2004.

2007 when consulting the account activation of starting client and being correlated with, and consults voucher maker (CMVG) negotiation that the voucher maker negotiation starting client management of starting client management is consulted in starting client startup, for example as shown in Figure 4.

Fig. 3 shows the process of negotiation computerize voucher clause parameter that creates for consulting the voucher transaction engine CMVTE of starting client management according to a particular embodiment of the invention.The step of Fig. 3 can comprise some or all steps in the following steps of appropriate sequence, for example, and as shown in the figure:

The voucher transaction engine CMVTE of 3001 suppliers' negotiation starting client management creates the community set of negotiations process, comprising:

The storage data that 3002 products limit substantially.

3003 suppliers' negotiation starting client database CD comprises each profile of consulting starting client;

3004 are collected in the related data of the particular conditions of the negotiation that will assemble in element 3006.

3005 extract selected product attribute from supplier's product database CVD, for example stock, cost price, availability etc., and Fig. 2 a1305 will be aggregated into

3006 wherein, supplier assembles negotiation computerize voucher (CMV) the clause parameter with basic restriction 3002, by consulting starting client profile factor 34 and product clause attribute, carrys out classification-be processed into for VRS described in supplier's regular collection VRS-of the CMV of specific negotiation starting client to develop (at element 3007)

3008 consult computerize voucher (CMV) maker CMVG, to start negotiation.

Fig. 4 is the assembly that relates to during the voucher of consulting starting client management in robotization is consulted CMV and the rough schematic view of process.The step of Fig. 4 can comprise some or all steps in the following steps of appropriate sequence, for example, and as shown in the figure:

4001 in 4002, use the voucher maker (CMVG) of consulting starting client management, to consult starting client and start and consult computerize and consult starting client voucher request or response, the robotization voucher of following 4003 supplier's regular collection VRS consults engine (VNE) and judges-for example at element 4004-, how to process CMV; In 4005, voucher is consulted engine (VNE) 4002 and is sent refusal N voucher, and in 4008, stops consulting; 4006 vouchers are consulted engine (VNE) 4002 and are sent offer request R voucher again to the voucher maker (CMVG) of consulting starting client management, to help consulting starting client, assemble offer again; If consult computerize voucher (CMV), can accept, supplier prepares A voucher and voucher is redeemed token VRT.

Fig. 5 has demonstrated the process of successfully consulting that completes, and distribution voucher is redeemed token and A voucher.The step of Fig. 5 can comprise some or all steps in the following steps of appropriate sequence, for example, and as shown in the figure:

5001 complete processes, any one mode that supplier redeems token VRT with at least four kinds of sample format vouchers is issued voucher redemption token and A voucher:

5002 can issue voucher redeems the voucher 5005 that token (VRT) prints in advance as business or family (passing through internet) prints, and voucher 5005 carries can be at supplier's redemption token and unique bar code of the 5006 places identification of A voucher reader and redemption; Wherein, by internet, send via e-mail or delivering mail transmit and redeem token 5002; Or

5003 can issue voucher redeems token (VRT) as Moving-strip shape code, and this Moving-strip shape code is sent out or copies on the mobile phone 5006 of consulting starting client or as the network activation of NFC intelligent card chip via consulting the mobile phone of starting client; Or

5004 vouchers are redeemed token VRT and are consulted the contact of starting client or the virtual voucher of the remote activation in non-contact intelligent card apparatus 5007 is redeemed token VRT, and it sends by permanent haulage line or wireless telephone or internet; Or

5005 can issue voucher redeems token VRT as voucher code, consult starting client and can download from supplier website this voucher code, Fig. 2 a1300, numerical coding 5008 is coupon code, or safety distribution in supplier's e-commerce shopping cart, Fig. 2 a1004.

5006: can be directly to work with consulting computerize voucher transaction engine supplier's voucher reader design, Figure 33 001.Voucher is redeemed token reader and is designed to read and redeem all physics, movement and the digital VRT by system creation.Supplier's voucher reader normally separate unit maybe can be integrated in supplier's point of sales system.

Fig. 6 is the simplified flow chart of describing the continuous negotiation of clause, wherein, voucher is consulted engine VNE (Figure 44 002) for 6004 of preparation in supplier's regular collection VRS (Figure 33 007), 6005, with 6006 in min-max scope, assessment is by the negotiation computerize voucher (CMV) 6001 of consulting starting client continuously, 6002 and 6003 N that input a clause parameter, and readjust from prefix min-max according to the min-max scope clause of formerly clearing, for example consulting starting client by his/her clause parameter rank 10, 000 utensil (widget) changes to has 100 of the new milestone transmission date, between the period of negotiation of 000 utensil.

In element 6007,6008 and 6009 clause parameters, consult starting client and input alternatively new parameter request/response, wherein, element 6010,6011 and 6012 each inputs are checked for the min-max scope of adjusting; If 2 to N-1 negotiation computerize voucher (CMV) clauses, in scope, are accepted this clause and clause negotiation sequence proceeds to next clause; From the clause N accepting, sequence proceeds to and in 6002, preserves all N clause.

In element 6013,6014 and 6015, whether voucher is consulted engine (VNE) and is checked near the reasonable little increment of clause min-max scope, consults starting client and is allowed to propose new offer; If clause is not included in the little increment of scope, in 6025,6026 and 6027, stop consulting.

In element 6016,6017 and 6018, by consulting starting client, when attempting, increase progressively test counter, to revise CMVR clause at every turn; Wherein, element 6019,6020 and 6021, voucher is consulted engine (VNE) refusal in any test over number maximum again offer, and with N voucher, stops in element 6025,6026 and 6027; Wherein, via element 6022,6023 and 6024, consult starting client and submit the clause parameter to 6007,6008 and 6009 changing to; Wherein, voucher is consulted engine (VNE) the new parameter of reappraising in 6010,6011 and 6012, and duplicate negotiation loops process from here on.

Fig. 7 and 8 is simplified flow charts, and wherein each figure has described to have and connected intermittently and finally complete negotiation computerize voucher (CMV) the multi-step negotiation of hashed value authentication; Wherein, in Fig. 7, all exchanges data are carried out with plaintext, and in Fig. 8, exchange is that the ciphertext authenticating realizes.Expressly and ciphertext link value and Hash digest Hash digest and hashed value generation be identical in steps.If initialization (Fig. 9) comprises secret shared key and unique initial value, all exchanges data are any mixing of clear data exchange or encrypt data exchange alternatively.

Except true, Fig. 7 and 8 process comprise the sequence of the offer of consulting starting client revision supplier.In Fig. 7 minute frame step 7001 to 7005 and Fig. 8 in 8001 to 8005, consult starting client or supplier and can carry out counter offer.Every other minute frame step is with reference to the supply of material and the encryption function explained in the accompanying drawings, as indicated in associated frame.In minute frame step 7 & 8001 and 7 & 8002, supplier has proposed counter offer, in minute frame step 7 & 8003 to 7 & 8005, consult starting client assessment supplier's counter offer, and determine that the offer of accepting supplier still carries out counter offer or refusal.

Fig. 9 to 12 has schematically demonstrated the novelty step of using cipher feedback pattern single current Hash digest, encryption and the automated validation of asynchronous automaton.

Fig. 9 is from USSN13/143, the block diagram of 172 (open as US201I/0286596) copy, wherein, TX transmit leg 8ATX PRF (pseudo-random function) and RX take over party's 8ARXPRF (pseudo-random function) carries out identical Hash digest to initial value; In transmit leg and take over party's pseudo-random function PRF (pseudo-random function) engine; Under transmit leg cipher feedback pattern, operate; The formerly version of encrypting with FortressGB ZK in described engine function is of equal value.If process is simply to operate without cipher key Hash, there are not cipher key Hash or encryption, the overall situation replacement or do not have with known initial value is enough to be used in general in cipher key Hash.Cipher feedback pattern is switched, and Figure 20 arranges@A, to guarantee that i initial word affects PRF (pseudo-random function) link value.

Above-mentioned USSN13/143,172 (open as US2011/0286596) have been described at least following examples, and it can be combined with system and method shown and described herein:

Embodiment 1, a kind of method, comprising: market demand is shared to coding function and to produce a plurality of codings, share; Generate a plurality of random numbers; Obtain the set of the individualized certification value relevant to user's access data; Set based on individualized certification value generates a plurality of hiding passwords; Each coding in sharing for a plurality of codings is shared: one of the correspondence based in a plurality of hiding passwords and one of correspondence in a plurality of random number generate encryption key; And use encryption key to share and encrypt encoding, to produce to encrypt, share; And conveniently a plurality of random numbers and each are encrypted to shared storage.

Embodiment 2, according to the method described in embodiment 1, wherein, shared coding function comprises following at least one: disperse storage errors coding function; And Secret Sharing Function.

Embodiment 3, according to the method described in embodiment 1, wherein, generate corresponding a plurality of random numbers and comprise: obtain a plurality of basic random numbers; And expand each the basic random number in a plurality of basic random numbers based on security parameter, to produce corresponding a plurality of random numbers.

Embodiment 4, according to the method described in embodiment 1, wherein, the set of individualized certification value comprises following at least one: user equipment identifiers (ID); User ID; Personal information number (PIN); Badge ID; District ID; Work shift ID; Operation ID; Task ID; Pass code; Password; Picture file; Video file; Audio file; Retina scanning; Face scanning; Finger scan; Privacy; And cipher key number.

Embodiment 5, according to the method described in embodiment 1, wherein, generate corresponding a plurality of hiding passwords and comprise: according to the set of transforming function transformation function, convert the set of individualized certification value, to produce the set of conversion individualized certification value; And for each passwords of a plurality of hiding passwords of correspondence: according to composite function, by least one combination in another in the set of one of set of conversion individualized certification value and constant and conversion individualized certification value, to produce password.

Embodiment 6, according to the method described in embodiment 5, wherein, transforming function transformation function comprises following at least one: do-nothing function; Series connection function; Inverted functions; Hash function; Encryption function; Compression function; And mask generating function.

Embodiment 7, according to the method described in embodiment 5, wherein, composite function comprises following at least one: addition function; Subtraction function; Multiplication function; Division function; Logic XOR function; Logic OR; And logical and function.

Embodiment 8, according to the method described in embodiment 1, wherein, generate encryption key and comprise: utilize one of correspondence in mask generating function, security parameter and a plurality of random number to convert one of correspondence in a plurality of hiding passwords.

Embodiment 9, according to the method described in embodiment 1, wherein, convenient to a plurality of random numbers of correspondence with encrypt shared storage and comprise following at least one: to disperseing storage (DS) processing unit to send to encrypt to share and one of the correspondence of corresponding a plurality of random numbers; Disperse storage errors coding encrypting to share, to produce a plurality of codings, share sheet and export a plurality of codings and share sheet for storage; And disperse one of correspondence in the corresponding a plurality of random numbers of storage errors coding, with produce random several pieces of a plurality of codings also export a plurality of codings random several pieces for storage.

Embodiment 10, a kind of computing machine, comprising: interface; Storer; And processing module, for: market demand is shared to coding function and to produce a plurality of codings, share; Generate a plurality of random numbers; Obtain the set of the individualized certification value relevant to user's access data; Set based on individualized certification value generates a plurality of hiding passwords; Each coding in sharing for a plurality of codings is shared: one of the correspondence based in a plurality of hiding passwords and one of correspondence in a plurality of random number generate encryption key; And use encryption key to share and encrypt encoding, to produce to encrypt, share; And conveniently a plurality of random numbers and each are encrypted to shared storage.

Embodiment 11, according to the computing machine described in embodiment 10, wherein, shared coding function comprises following at least one: disperse storage errors coding function; And Secret Sharing Function.

Embodiment 12, according to the computing machine described in embodiment 10, wherein, processing module is for next life in the following manner becoming corresponding a plurality of random numbers: obtain a plurality of basic random numbers; And expand each the basic random number in a plurality of basic random numbers based on security parameter, to produce corresponding a plurality of random numbers.

Embodiment 13, according to the computing machine described in embodiment 10, wherein, the set of individualized certification value comprises following at least one: user equipment identifiers (ID); User ID; Personal information number (PIN); Badge ID; District ID; Work shift ID; Operation ID; Task ID; Pass code; Password; Picture file; Video file; Audio file; Retina scanning; Face scanning; Finger scan; Privacy; And cipher key number.

Embodiment 14, according to the computing machine described in embodiment 10, wherein, processing module becomes corresponding a plurality of hiding passwords in the following manner next life: according to the set of transforming function transformation function, convert the set of individualized certification value, to produce the set of conversion individualized certification value; And for each passwords of a plurality of hiding passwords of correspondence: according to composite function, by least one combination in another in the set of one of set of conversion individualized certification value and constant and conversion individualized certification value, to produce password.

Embodiment 15, according to the computing machine described in embodiment 14, wherein, transforming function transformation function comprises following at least one: do-nothing function; Series connection function; Inverted functions; Hash function; Encryption function; Compression function; And mask generating function.

Embodiment 16, according to the computing machine described in embodiment 14, wherein, composite function comprises following at least one: addition function; Subtraction function; Multiplication function; Division function; Logic XOR function; Logic OR; And logical and function.

Embodiment 17, according to the computing machine described in embodiment 10, wherein, processing module generates encryption key in the following manner: utilize one of correspondence in mask generating function, security parameter and a plurality of random number to convert one of correspondence in a plurality of hiding passwords.

Embodiment 18, according to the computing machine described in embodiment 10, wherein, processing module by following at least one come convenient to a plurality of random numbers of correspondence with encrypt shared storage: via interface to disperseing storage (DS) processing unit to send to encrypt to share and one of the correspondence of corresponding a plurality of random numbers; Disperse storage errors coding encrypting to share, to produce a plurality of codings, share sheet and via interface, export a plurality of codings and share sheet for storage; And disperse one of correspondence in the corresponding a plurality of random numbers of storage errors coding, with produce a plurality of codings random several pieces and via interface export a plurality of codings random several pieces for storage.

Figure 10 adapts from USSN13/143, and the block diagram of Fig. 2 C of 172 (open as US2011/0286596), explains and can authenticate plaintext transmission accordingly., at the lower transmit leg TX of the cipher feedback pattern PRF (pseudo-random function) of transmit leg, m clear-text message word carried out to Hash digest herein, 8ATX, exchange A, for example as shown in figure 20; Described transmit leg sends described clear-text message (not reading coding output); And take over party receives supposition and expressly send accurately, this take over party carries out similarly Hash digest in take over party PRF (pseudo-random function), and 8ARX exchange@A, under transmit leg cipher feedback pattern.Mistake in transmission has been destroyed the link value in take over party's inside PRF (pseudo-random function) 8ARX variable, has got rid of and has truly read alternatively deciphering and true Hash digest.

The Figure 11 that is similar to Figure 10 is from USSN13/143, the block diagram of Fig. 2 C copy of 172 (open as US2011/0286596), the accordingly process of explanation encryption simultaneously and hash., at the lower transmit leg TX of the cipher feedback pattern PRF (pseudo-random function) of transmit leg, m clear-text message word carried out to Hash digest and encryption herein, 8ATX, exchange A, for example as shown in figure 20; Described transmit leg sends cipher-text message; And RX take over party receives and suppose that accurately ciphertext sends, this take over party is decrypted and Hash digest in take over party PRF (pseudo-random function), and 8ARX exchange@B, under transmit leg cipher feedback pattern.Mistake in transmission has been destroyed the link value in take over party's inside PRF (pseudo-random function) 8ARX variable, that is, got rid of and truly read deciphering and true Hash digest.

Figure 12 adapts from USSN13/143, and the enhancing block diagram of Fig. 2 D of 172 (open as US2011/0286596) is explained accordingly and had the process that link value regulates negotiation computerize voucher (CMV) authentication mechanism of automat.Transmit leg TX8ATX PRF (pseudo-random function) exchange@A for example as shown in figure 20, generates (encrypting t complete " 5 " word) under transmit leg cipher feedback pattern; Follow the process of Figure 10 and 11.Sending direction take over party's 8BTXPRF (pseudo-random function) exchange@B sends the hashed value generating.

From take over party RX8BTX PRF (pseudo-random function) input, hashed value function automat 12RX counts the hashed value word of declaring receiving.Meanwhile, take over party RX8BTXPRF (pseudo-random function) exchange@B is decrypted t the hashed value word of declaring, and to hashed value function automat 12RX output deciphering, ideally, the sequence of complete " 5 " word.

After t hashed value word of declaring of input in take over party RX8BTX PRF (pseudo-random function), hashed value function automat 12RX regulates two binary signals of automat output to link value, Figure 19:

The frame destroying triggers=" 1 ", if hashed value authentification failure; And

The t receiving HV/ label word=" 1 "; If hashed value receives word counter, output equals t.

Figure 13 and 14 be reorganization from USSN13/143, Fig. 7 C of 172 (open as US2011/0286596) and the block diagram of D, the automat of having realized the link value of demonstration in the cipher feedback pattern of demonstration in Fig. 9～12 and Figure 18 and 19 regulates.Conventionally, consulting starting client is that a TX-sends (TX-SENDS), and supplier is that a RX-receives (RX-RECEIVES).At each negotiation phase, conventionally consult a TX-transmission and become next RX-reception.

In Figure 13 and 14 the one TX-transmission and RX-reception, the shared word initial value that is input to TX8ATX PRF (pseudo-random function) exchange A and RX8AB exchange A is identical.

In Figure 13, TX-sends and negotiation computerize voucher (CMV) negotiations process exchange has been demonstrated in RX-reception, supposes expressly send all message.In the transmit leg cipher feedback pattern PRF (pseudo-random function) of TX 8ATX, process m expressly word and t hashed value authenticator, and send transmission by the format that TX-sends to have header HDR.TX preserves the HV of clear-text message and suffix _tihashed value.At E[INIT] and follow-up at all HV _tiafter hashed value, automat asynchronous preservation link value in shadow memory that TX sends.

Figure 13 RX-has received * format and has sent expressly and hashed value.* m plaintext word is processed in the RX8AB PRF (pseudo-random function) with exchange of RX, and deciphers additional * t hashed value with exchange B; Wherein, by the automat of Figure 12, test complete " 5 " word of prediction of output * t.The adjusting automat of Figure 20 is preserved initial chaining value, and also preserves the hashed value link value all successfully receiving.If authentification failure, the adjusting automat of Figure 20 uses formerly real hashed value link value to replace failed hashed value link value.RX-receives request TX-transmission and repeats to send a transmission; RX-receives and again processes the transmission receiving, conventionally only once, until the next exchange of RX-receive ready.

By following the step in Figure 13, the step in Figure 14 is self evident; Wherein, if shared key is unknown for invader, successfully encryption and hash are reluctant.All shared key negotiation step of hashed value in Figure 13 and 14, be obviously identical.Similarly, in fact, consulting m message word exchange is the mixing of plaintext and ciphertext alternatively.Suppose the first-selected secret exchange of encrypting of supplier and privilege negotiation starting client.

Each HV in Figure 13 and 14 _tiit is the authenticator from all exchanges data of the 1st to Ti exchange.All formerly with a upper gathering that exchange is Hash digest data now.

This is in Figure 15 and 16 and completes explaining in the procedure block of successfully consulting computerize voucher (CMV) negotiation (repeating in as Figure 13 and 14 to illustrate) final license step afterwards.Please remember: after (i-1) sends, the i time negotiation data exchange of link value " startup ".

In this final the N time negotiation data exchange, supplier TX input agreement document, is for example summary, proforma invoice and the A voucher of offer herein, and generates final gathering hashed value HV _tN.

Now, transmit leg is prepared the token of hash, has HV _tN, pseudo random number, there is " signature hash " hashed value, it proves token to any negotiator, the authenticity of " signature hash " hashed value.If negotiation starting client and/or supplier enclose in " signature hash " hashed value, can verify (artificial or numeral) signature, he becomes for whole negotiation and the responsible side of token; Be similar to signer and manually sign check or contract, signer is responsible for himself to third party.Third party's processor of token, for example bank, conventionally neither understands and is also indifferent to details and the intention of knowing negotiation action.

Finally " signature hash " hashed value will be conventionally with in software ashing technique efficiently standard realize, for example SHA-1 or SHA-256, rather than the hardware PRF (pseudo-random function) that must be had by authentication.Although in order to simplify explanation, we have demonstrated the hash of use same password feedback PRF (pseudo-random function).

TN hashed value HV _tNfor the invader who is not a side of original shared initial value, be insignificant; But its provablely by whole negotiation action provable be only tied to share initial value and there is the entity to the access rights of total transcript (transcription) of exchanges data.

Figure 17 is for negotiation starting client being tied to the illustrative example of the use of the popular RSA signature scheme that authenticates agreement.Consult starting client and can be used for verifying promise and the intention of consulting starting client by supplier to being tied to the signature of " the signature hash " of token.In this schematic diagram:

In the situation that the clause of token is reached an agreement, consult starting client and generate binding RSA signature; Wherein, element 1710 is to consult the signal of starting client to the signature of cascaded H VTN| " signature hash ", and it uses secret (D) RSA key of consulting starting client to carry out.Series connection is the one number of (in 2012) 1023 bit sizes normally.Consult starting client and to supplier, send signature 17.20.

If accurately received, send 17.30, know supplier's checking of the open RAS key of consulting starting client, result is HV _tN| " signature hash ".Supplier has the right to use the token with the signature of consulting starting client, to obtain the remuneration of reaching an agreement.Other legal identifiers that are not subject to the restriction of this patent can be consulted starting client or supplier for " signature hash " hashed value is tied to.

Figure 18 shows single two parts asynchronous automaton circuit together with 19, and 1904 and 1905 activate all and each link value flip-flop circuit 1801, latchs 1802 to its pairing shadow memory, stores an authentication scale-of-two hashed value.

Take over party is ready for and the new exchanges data of link value of the exchange of authentication formerly, is ready to start new Hash digest.If the next exchanges data receiving is damaged, RX request TX repeats an exchange, and it only can be processed by priority of use certification chain ad valorem.

The end receiving in authentication Hash value, enables asynchronous being input to of the output of each multiplexing link value bit 1801 of link value height (Hi-Enable) and latchs 1802, by " the authentication storage link value bits command " of Figure 19, is activated.

After unsuccessfully sending, from Figure 19, send two asynchronous commands, regulate link value, it is set to data bit 1801 by multiplexing input, and it is activated to receive output valve shadow memory Q _l, and after 6 nanoseconds, control lag clock, it is clock/renewal bistable multivibrator 1801 after a while.

1802 enable the hashed value link value that height latched-stored an authentication, and the initialization link value completing is recorded in each and all multiplexing link value bistable multivibrators.

Two parts asynchronous automaton controller has delay circuit, and this delay circuit makes it possible to realize the only automat after the billing cycle of latent instability data and activates.

Due to the input signal generating for automata controller, when data line is during conventionally in undefined state still, postpone to guarantee the activation at least 6 nanoseconds of preservation and conditioning signal after the end of the processing sequence of definition length during rising major clock.

Control circuit 1905, to the impaired frame trigger command of control circuit 1904 relayings, with in the situation that miss data exchanges, is adjusted to a upper real link value by link value.

All activated bistable multivibrator 1901,1902 and 1903 is that voltage level is enabled:

Regulate clock bistable multivibrator 1901 to activate and be delayed at least 12 nanoseconds, to guarantee that signal clock Figure 181 803 link value bistable multivibrators arrived in shadow memory data bit " arrival " " door " 6 nanoseconds afterwards; By multiplexer circuit, in 1801, propagate.

Authentification failure interruption-bistable multivibrator 1902 order host requests for main frame resend a upper exchanges data.

TX/RX RDY interrupts bistable multivibrator 1903-to the last part of the transmission of host notification TX or RX receipt message or hashed value.

Authentication storage link value input signal is input to Figure 18 in " 1 " and latchs 1802, and open data and latch 1802 " valve " 1805, and closed " valve " 1804, load thus an authentication Hash value link value bit.

The default input signal of authentication storage link value is input to Figure 18 in " 0 " and latchs 1802, closed data latch " valve " 1805 in 1802 and open " valve " 1804, to latch thus 1802 isolates, the binary value of a upper storage is stayed, with the constant output " circulation " that will " be seated at " on inputoutput multiplexer, arrive link value bistable multivibrator 1801, be ready to regulate.

Control circuit 1905 is to the destroyed frame trigger command of control circuit 1904 relayings, with in the situation that failed exchanges data is adjusted to link value a certification chain ad valorem.

Control circuit 1905 also sends rdy signal in the end of initialization, message or TX hashed value sequence to main frame.Meanwhile, expected hash value that and if only if is true, and automat sends RX hashed value number of words order and receives signal.

Figure 20 is that reorganization is from USSN13/143, the reorganization prior art block diagram of cipher feedback model results/cross feedback processor exchanging mechanism circuit 2010 of Fig. 3 A of 172 (open as US2011/0286596), and there is special interests in this application, wherein, it is all cryptographic operation that the encryption of transmit leg and hashed value generate, exchange@A; And take over party's deciphering and hashed value authentication operation are decryption oprerationss, exchange@B; Single, realize in without interrupt flow, message input and result at single 100MHz in the clock period are exported.

Exchange@0 is for there being the conventional flow of making an uproar on media to encrypt.Uncorrelated with this patent.Exchange A is for being compulsory with the secret initialization of sharing the engine of initialization data, and it is for all codings and hash function initialization procedure;

Exchange@A is the TX transmit leg pattern of all exchanges data.The enciphered data of TX transmit leg is feedback sources.

Exchange@B directly shunts to the input enciphered data of transmit leg RX take over party's feedback, guarantees that transmit leg and take over party's link value is identical in each clock period, supposes that transmission path is reliable.

Fig. 9 to 12 simplified schematic ground graphic rendition TX transmit leg and RX take over party's same chain ad valorem.

Figure 21 adapts from USSN13/143, the block diagram that the enhancing ZK of 172 (open as US2011/0286596) encrypts.New explanation comprises unique new determinacy randomization circuit and automat, for example, as shown in Figure 13～14 and shown in 19～20, be designed to efficient processing and consult computerize voucher (CMV) and have other negotiation datas of making an uproar on network to exchange potential.

Believe that the most handy hardware of long-lived equipment that carries out safety encipher and authentication to accelerating confidential data exchange realizes, and there is the displacement of robust, and by the test without cipher key Hash, wherein, we can be sure of: the bit (if modification) in message input can not cause any variable bit in PRF (pseudo-random function) binary variable or the change distinguished of bit cluster.

ZK encrypts PRF (pseudo-random function) 2000 and comprises or comprise the mutual PRF (pseudo-random function) of displacement more than two.32 bit words executors 2060 (if it is independently) will be similar to the unidirectional symmetric cryptography device with 30 displacements.Random controller 2020 is for 31 other discrete displacements of random activation, and wherein 8 is 32 bit random files; But also use from the long-range feedback of word executor itself is carried out to randomization.Result/feedback processor 2050 is used cross feedback stream to change input message data, make to get rid of message modification provablely, for example provablely can not moving decimal point and there is subsequently the correction message that link value, Hash digest and hashed value are regulated.

Two unique 32 bits of initial randomization HAIFA counter 400 based on Mersenne Prime linear feedback shift places unique random 2 separately ⁶³the bistable multivibrator variable of number, guarantees not have sequence to repeat; Albefaction lower 510 simultaneously and breakaway layer 520 cross feedback streams.

According to specific embodiment, hash described herein is used for to authentication purpose, and can maybe can be not used in before sending message message encryption.

Should recognize: the term such as " pressure ", " requirement ", " needs " and " necessary " refers to is to select in specific implementation or the realization made in the context for clear and application that describe herein, and do not expect it is restrictive, because in alternative realization, identical element can be defined as non-imposed and that be not required or even may be completely eliminated.

Should recognize: the component software of the present invention that comprises program and data can (if needs) be realized by ROM (ROM (read-only memory)) form, comprise CD-ROM, EPROM and EEPROM, or can in any other suitable computer-readable medium, store for example (but being not limited to): various dishes, various card and RAM.If needed, the assembly that is described as software herein can alternatively with hardware, realize wholly or in part with conventional art.Relatively, if needed, the assembly that is described as hardware herein can alternatively with software, realize wholly or in part with conventional art.

In scope of the present invention, comprise: carry the electromagnetic signal of computer-readable instruction, for carrying out shown in this paper with any proper order and any or all of step of described any method; Machine readable instructions, for carrying out shown in this paper and any or all of step of described any method with any proper order; The program storage device that can be read by machine, has visibly embodied by the executable instruction repertorie of machine, to carry out shown in this paper with any proper order and any or all of step of described any method; Computer program, comprise computer usable medium, wherein there is computer readable program code, for example executable code, and/or comprise computer readable program code, for carrying out shown in this paper with any proper order and any or all of step of described any method; When carrying out with any proper order by shown in this paper and any technique effect of bringing of any or all of step of described any method; Any suitable device or equipment or their combination, become alone or in combination and carry out shown in this paper and any or all of step of described any method with any proper order by this case; Electronic equipment, includes processor and cooperation input equipment and/or output device, and for carrying out shown in this paper and described any step at software; Information storing device or physical record, for example dish or hard disk drive, make computing machine or other equipment be configured to carry out shown in this paper and any or all of step of described any method with any proper order; For example in storer or information network (for example, internet) program of upper pre-stored, before or after downloading, it has embodied shown in this paper and any or all of step of described any method with any proper order, and uploads or download their method and comprise for using their server and/or the system of client; And for carrying out shown in this paper with any proper order and the hardware of any or all of step of described any method, regardless of being separately or combining with software.

Also provide for the manufacture of shown in this paper and the method for described any system, comprise and provide shown in this paper and whole or any suitable subset of described system component by any suitable classic method, and for using the method for any and all this systems and this assembly, because this will be apparent according to the 26S Proteasome Structure and Function of system as herein described and assembly.

Can carry out any calculating as herein described or other form analyses by suitable Computerized method.Any step described herein can be computer implemented.Invention shown and described herein can comprise that (a) identifies the solution of any problem or the solution of any object described herein by computerized method, and this solution comprises following at least one alternatively: decision, action, product, service or any other information that affects problem described herein or object in positive mode described herein; And (b) output solution.

The feature of the present invention of describing in the context of embodiment separated can also be provided with array mode in single embodiment.Relatively, at the context of single embodiment or with particular order, provide respectively or with any suitable sub-portfolio or provide with different order for the feature of the present invention that comprises method step concise and to the point and that describe.Use " for example " to be not intended to restrictive specific embodiment herein.Unit or system shown in connecting in any accompanying drawing can be integrated on single platform in fact in a particular embodiment, or can connect via any appropriate wired or wireless connection (such as, but not limited to: optical fiber, Ethernet, WLAN, the PNA of family, power line communication, cell phone, PDA, blackberry, blueberry GPRS, the satellite that comprises GPS or other Mobile Transmissions).Should recognize: in instructions shown and described herein and accompanying drawing, the function that is described or is illustrated as system and subelement thereof can also provide as method and step wherein, and describe and be illustrated as method and wherein the function of step can also provide as system and subelement thereof.For the ratio that each element of accompanying drawing is described be only exemplarily and/or for present clear be appropriate, and to be not intended to be restrictive.

Claims (70)

1. for a convenient system carrying out computerize negotiation between computerized first instance and second instance overall, described system comprises:

The jjoint venture investment processor that first instance is controlled, make first instance in computerized first instance overall to propose the first version that the proposal between described first instance and at least one second instance is jointly invested at least one second instance in computerized second instance overall, described first version comprises that each in corresponding jjoint venture investment parameter sets jointly invest the first value set of parameter; And

The jjoint venture investment processor that second instance is controlled, make the second instance in computerized second instance overall to receive the described first version that described proposal is jointly invested from described first instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described first instance transmission, described jjoint venture investment is revised communication and is comprised the change at least one value in described the first value set, definition comprises for each in corresponding jjoint venture investment parameter sets and jointly invests the second version that the described proposal of the second value set of parameter is jointly invested thus,

Wherein, the jjoint venture investment processor that described first instance is controlled is also for making described first instance receive described the second version that described proposal is jointly invested from described second instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described second instance transmission, the change that communication comprises at least one value up-to-date described the second value set receiving of jjoint venture investment processor to controlling from described second instance is revised in described jjoint venture investment, definition comprises that the added value for each the jjoint venture investment parameter in corresponding jjoint venture investment parameter sets is integrated into the additional version that interior described proposal is jointly invested thus.

2. system according to claim 1, wherein, at least one in described jjoint venture investment processor used that the jjoint venture investment processor of programming is in advance specific to be accepted offer negotiation rules again, determines it is that transmission is jointly invested and accepted communication or jointly invest and revise message.

3. system according to claim 1, wherein, at least one in described jjoint venture investment processor jointly invested for the another one transmission to described jjoint venture investment processor and accepted message, jointly invests and revise message and jointly invest the communication selected in refuse information.

4. system according to claim 1, wherein, the jjoint venture investment processor that at least one in described jjoint venture investment processor used programming is in advance offer create-rule again specifically, determines whether and how to change at least one in another the up-to-date parameter value receiving from described jjoint venture investment processor.

5. system according to claim 4, wherein, the create-rule of offer again of programming comprises the jjoint venture investment processor ad hoc rules for following operation in advance:

Another up-to-date parameter value receiving based on from described jjoint venture investment processor is determined jjoint venture investment partner wish mark at least partly;

Determine the weight of the unit gap between the value being proposed for each parameter by the first jjoint venture investment processor and the second jjoint venture investment processor; And

At least reduce the interval of jointly investing between processor and the value of the up-to-date proposition of the second jjoint venture investment processor by described first, make the summation reducing for the interval being obtained by described Weight respectively of all parameters corresponding to described wish mark.

6. system according to claim 5, wherein, the summation reducing for the interval being obtained by described Weight respectively of all parameters is with the corresponding part of described jjoint venture investment partner wish mark: the jjoint venture investment partner wish mark of the described single jjoint venture investment processor that the rule of using the negotiation of holding consultation with single jjoint venture investment processor to jointly invest processor calculates is larger, by described negotiation, jointly invest that rule that processor uses ratifies by described single jjoint venture investment processor and described negotiation jointly invest processor interval between the value of up-to-date proposition reduce just larger.

7. system according to claim 5, wherein, the create-rule of offer again of programming comprises in advance: for determine at least partly the jjoint venture investment processor ad hoc rules of the jjoint venture investment partner wish mark of described specific jjoint venture investment processor based on the formerly understanding relevant to specific jjoint venture investment processor.

8. system according to claim 1, wherein, the jjoint venture investment processor that described first instance is controlled is mutual via website and human user, comprises to described human user presentation information and from described human user reception information.

9. system according to claim 1, wherein, described jjoint venture investment comprises: from provider, to take over party, provide resource, and the described first instance that proposes described first version comprises described take over party, and described second instance comprises described provider.

10. for a convenient computerized method carrying out computerize negotiation between computerized first instance and second instance overall, described method comprises:

The jjoint venture investment processor that provides first instance to control, the jjoint venture investment processor that described first instance is controlled makes first instance in computerized first instance overall propose the first version that the proposal between described first instance and described at least one second instance is jointly invested at least one second instance in computerized second instance overall, and described first version comprises that each in corresponding jjoint venture investment parameter sets jointly invest the first value set of parameter; And

The jjoint venture investment processor that provides second instance to control, the jjoint venture investment processor that described second instance is controlled makes the second instance in computerized second instance overall receive the described first version that described proposal is jointly invested from described first instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described first instance transmission, described jjoint venture investment is revised communication and is comprised the change at least one value in described the first value set, definition comprises for each in corresponding jjoint venture investment parameter sets and jointly invests the second version that the described proposal of the second value set of parameter is jointly invested thus,

Wherein, the jjoint venture investment processor that described first instance is controlled is also for making described first instance to receive described the second version that described proposal is jointly invested from described second instance, and jointly invest and accept communication and jointly invest the communication selected of revising in communicating by letter to described second instance transmission, the change that communication comprises at least one value up-to-date described the second value set receiving of jjoint venture investment processor to controlling from described second instance is revised in described jjoint venture investment, definition comprises that the added value for each the jjoint venture investment parameter in corresponding jjoint venture investment parameter sets is integrated into the additional version that interior described proposal is jointly invested thus.

11. computerized methods according to claim 10, wherein, the described jjoint venture investment processor that provides first instance to control comprises: maintain the data integrity that exchanges at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

According at least one first frame being generated by the first exchange participant, calculate the first non-transmission hashed value;

At least according to described the first frame and described the first non-transmission hashed value, calculate the second transmission hashed value; And

To at least the second participant, send at least described the first frame and described the second hashed value.

12. computerized methods according to claim 10, wherein, the described jjoint venture investment processor that provides second instance to control comprises: maintain the data integrity that exchanges at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

From the first participant, receive at least the first message frame and the second hashed value;

According at least described the first message frame and described the second hashed value, carry out reconstruct the first hashed value; And

Use described the first hashed value as the key for described first at least one frame of participant continuation exchange.

13. computerized methods according to claim 12, wherein, described key is for carrying out hash at least one frame that will send to described the first exchange participant.

14. computerized methods according to claim 12, wherein, described key is for carrying out hash at least one additional frame receiving from described the first exchange participant.

15. computerized methods according to claim 12, wherein, described continuation exchange comprises described reception and described reconstruct, and resulting the first hashed value is used as with described the first participant and further continues at least additional keys of another frame of exchange.

16. computerized methods according to claim 15, wherein, described additional keys is for carrying out hash at least one additional frame that will send to described the first exchange participant.

17. according to the computerized method described in claim 11 or 12, and wherein, described at least one, participant comprises the pseudorandom hardware device based on cipher feedback pattern.

18. computerized methods according to claim 17, wherein, each pseudorandom hardware device based on cipher feedback pattern is programmable, usings as for generating the Data Generator of Hash digest and the transmitter of at least one frame and replacing as comprising between the receiver that generates the Hash digest that receives data.

19. computerized methods according to claim 18, wherein, each pseudorandom hardware device based on cipher feedback pattern is programmable, usings as for generating the Data Generator of Hash digest of at least one frame and transmitter and replacing at random as comprising between the receiver of the Hash digest that generates reception data.

20. computerized methods according to claim 18, also comprise: by described the second hashed value, verify described Hash digest and described the first hashed value.

21. computerized methods according to claim 11, wherein, described at least the first exchange participant and the second exchange participant comprise described the first participant and a plurality of the second exchange participant, and described transmission comprises: to described a plurality of the second exchange participants, send at least described the first frame and described the second hashed value.

22. computerized methods according to claim 11, wherein, calculate described the first non-transmission hashed value and comprise: the Hash digest of calculating at least described the first frame.

23. computerized methods according to claim 11, wherein, send at least described the first frame as commercial level coded frame.

24. computerized methods according to claim 22, wherein, described Hash digest comprises: first frame of encoding in commercial level.

25. computerized methods according to claim 11, wherein, described transmission comprises: to described the second participant, send the series connection of at least described the first frame and described the second hashed value.

26. computerized methods according to claim 12, wherein, exchange to generate final hashed value by described continuation, and described final hashed value is carried out digital signature by participant.

27. computerized methods according to claim 26, wherein, at least one frame represents to propose at least one characteristic of transaction, and described final hashed value is illustrated at least one characteristic of the transaction of reaching an agreement between described participant, and described method also comprises:

In computerized database, storage is by the final hashed value of participant institute's digital signature in multiple exchange; And

The indication that complete of storage to the transaction being represented by final hashed value in described database, makes to prevent that by accessing the Trading Authorization that described database carries out transaction is done more than once.

28. according to the computerized method described in claim 26 or 27, wherein, adopts public key signature process to carry out digital signature to described final hashed value.

29. computerized methods according to claim 12, also comprise: by described the second hashed value, verify described the first hashed value and described the first message.

30. computerized methods according to claim 15, wherein, exchange to generate final hashed value by described further continuation, and by participant, described final hashed value are carried out to digital signature.

31. computerized methods according to claim 15, wherein, at least one frame except described the first frame that described additional keys is used for receiving from described the first exchange participant carries out hash.

32. 1 kinds for maintaining the computerized system that exchanges the data integrity of at least one computerized frame between the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described system comprises:

Receiver, for receiving at least the first message frame and the second hashed value from described the first participant;

Hasher, for carrying out reconstruct the first hashed value according at least described the first message frame and described the second hashed value; And

Scrambler, for using described the first hashed value as the key for described first at least one frame of participant continuation exchange.

33. 1 kinds for maintaining the computerized system that exchanges the data integrity of at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described system comprises:

Hasher, for calculating the first non-transmission hashed value according at least one first frame being generated by described the first exchange participant, and for calculating the second transmission hashed value according at least described the first frame and described the first non-transmission hashed value; And

Transmitter, receives and sends at least described the first frame and described the second hashed value at least described the second participant from described hasher.

34. 1 kinds for maintaining the computerized method that exchanges the data integrity of at least one computerized frame between at least the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

According at least one first frame being generated by described the first exchange participant, calculate the first non-transmission hashed value;

According at least described the first frame and described the first non-transmission hashed value, calculate the second transmission hashed value; And

To at least described the second participant, send at least described the first frame and described the second hashed value.

35. 1 kinds for maintaining the computerized method that exchanges the data integrity of at least one computerized frame between the first exchange participant and the second exchange participant, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

From described the first participant, receive at least the first message frame and the second hashed value;

According to described at least the first message frame and described the second hashed value, carry out reconstruct the first hashed value; And

Use described the first hashed value as the key for described first at least one frame of participant continuation exchange.

36. 1 kinds of computer programs, comprise computer usable medium, in described computer usable medium, embodied computer readable program code, described computer readable program code is suitable for being performed to realize the method that exchanges the data integrity of at least one computerized frame between at least the first exchange participant and the second exchange participant for maintaining, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

According at least one first frame being generated by described the first exchange participant, calculate the first non-transmission hashed value;

According at least described the first frame and described the first non-transmission hashed value, calculate the second transmission hashed value; And

To at least described the second participant, send at least described the first frame and described the second hashed value.

37. 1 kinds of computer programs, comprise computer usable medium, in described computer usable medium, embodied computer readable program code, described computer readable program code is suitable for being performed to realize the method that exchanges the data integrity of at least one computerized frame between the first exchange participant and the second exchange participant for maintaining, each frame comprises at least one message, each message comprises at least one word, and described method comprises:

From described the first participant, receive at least the first message frame and the second hashed value;

According to described at least the first message frame and described the second hashed value, carry out reconstruct the first hashed value; And

Use described the first hashed value as the key for described first at least one frame of participant continuation exchange.

38. systems according to claim 1, wherein, at least one in described jjoint venture investment processor determines whether and how to change at least one in another the up-to-date parameter value receiving from described jjoint venture investment processor.

39. according to the system described in any one in claim 1 and 2, wherein, first and second and any follow-up multi-step negotiation step in; With verifying that intermittently hashed value authenticates negotiation data; Each can verify that hashed value is intermittently affixed to the negotiation data of transmission; Wherein, each hashed value is the mutual coding of known constant value for transmit leg and take over party; Identical mutual known constant has reproduced in the end that the unaltered decoding of verifying hashed value is consulted to verification process step at each by transmit leg or take over party.

40. according to the system described in any one in claim 1,2 and 3, and wherein, the hashed value at intermittence of each step is used for verifying all negotiation data of negotiation step and the combined arrangements of hashed value before.

41. according to the system described in any one in claim 1 to 4, wherein, and third party's inaccessible the first authentication negotiation step; Described third party can not authenticate any or all follow-up negotiation step.

42. according to the system described in any one in claim 1 to 5, and wherein, the two circuit of transmit leg and take over party all comprises shadow memory, for recording the certification chain ad valorem of the negotiation step of transmission; Preserve thus last certification chain ad valorem of consulting transmission; No matter be transmit leg or the take over party of next negotiations process each combination of steps investor, for providing to jointly invest, continue authentication agreement process.

43. according to the system described in any one in claim 1 to 6, wherein, sends the authentication Hash value of the take over party's who claims the negotiation step authenticating electric circuit inspection failure; Cause thus automatically reinserting the certification chain ad valorem of the formerly record from shadow memory; Thus take over party's wrong link value is adjusted to formerly negotiation step time of day link value; Make thus at least one other test can resend formerly another test hashed value authentication of failed transmission, the stream that likely makes authentication consult frame can continue.According to wrong authentication verification, be imperfect or the supposition of the result of not error correction transmitting device, common re-adjustments process.

44. systems according to claim 1, wherein, jointly invest one of processor and use alternatively for second of the specific offer create-rule again of jjoint venture investment processor of programming in advance and jointly invest and change, determine whether and how to change at least one in another the up-to-date parameter value receiving from described jjoint venture investment processor.

45. according to the system described in any one in claim 1 to 6, wherein, described first and second and any follow-up multi-step negotiation step for adjust second party agreement tariff, select common relevant adaptation with the first party of agreement parameter.

46. according to the system described in claim 5 or 45, wherein, the described create-rule of offer again of programming in advance comprises jointly invests processor ad hoc rules, described jjoint venture investment processor ad hoc rules, for the formerly understanding based on relevant with specific jjoint venture investment side processor to specific jjoint venture investment side at least partly, is determined the jjoint venture investment partner wish mark of described specific jjoint venture investment processor.

47. according to the computerized method described in any one in aforementioned claim, and wherein, the negotiation of continuation exchange for maintaining same chain ad valorem after each intermittently authenticates negotiation step.

48. according to the computerized method described in any one in aforementioned claim, and wherein, two participant functional devices include the pseudorandom hardware device based on Synchronizing Passwords feedback model of function equivalence.

49. according to the computerized method described in claim 48, wherein, each pseudorandom hardware identification equipment based on cipher feedback pattern is programmable, usings as for generating the Data Generator of Hash digest and the transmitter of at least one frame and replacing as comprising between the receiver that generates the correct identity that receives the Hash digest of data and authenticate two Hash digest.

50. computerized methods according to claim 18, wherein, each pseudorandom hardware device based on cipher feedback pattern is programmable, usings as for generating the Data Generator of Hash digest of at least one frame and transmitter and replacing at random as comprising between the receiver of the Hash digest that generates reception data.

51. according to the computerized method described in any one in aforementioned claim, and wherein, described Hash digest comprises: by coded input data continuous feedback in defined determinacy pseudo-random function device.

52. computerized methods according to claim 11, wherein, described transmission comprises: on described the first frame, send connecting of hashed value that at least the first frame expressly forms with coding by known constant value; The coding known constant value that described hashed value will be decoded and verify as the determinacy pseudo-random function device of the function equivalence by the second participant.

53. according to the computerized method described in claim 52, wherein, to the second participant, at least supposes the true series connection that sends described second participant of the first frame expressly and the second hashed value; Wherein, the second participant is carried out identical Hash digest, supposes and the expressly true transmission of relevant data of described the first participant, and carries out the decoding to the hashed value receiving.If the value sending is faultless, described decoding generates known coding constant value, the data that successfully relatively also authentication formerly sends.

54. computerized methods according to claim 1 and 2, wherein, exchange to generate final hashed value by described continuation, and by participant, described final hashed value are carried out to digital signature.

55. according to the computerized method described in claim 54, and wherein, the signature that both sides are relevant to final hashed value authenticated all stages of consulting; Described signature is for being all tied to two participants the clause of all reaching an agreement and the sequence of General Agreement process.

56. according to the computerized method described in claim 54 or 55, wherein, at least one frame represents to propose at least one characteristic of transaction, and described final hashed value is illustrated at least one characteristic of the transaction of reaching an agreement between described participant, and described method also comprises:

In computerized database, storage is by the final hashed value of participant institute's digital signature in multiple exchange; And

The indication that complete of storage to the transaction being represented by final hashed value in described database, makes to prevent that by accessing the Trading Authorization that described database carries out transaction is done more than once.

57. according to the computerized method described in claim 55 or 56, wherein, adopts public key signature process to carry out digital signature to described final hashed value.

58. according to the computerized method described in claim 26 or 27, wherein, the printout of final hashed value, there is participant " signature hash " signature of summary of final agreement of authentication signature of mutual signature for two participants being all tied to the summary of at least reaching an agreement in negotiations process.

59. according to the computerized method described in claim 15 or 47, wherein, by described further continuation, exchanges to generate final hashed value, and by participant, described final hashed value is carried out to digital signature.

60. 1 kinds of computer products, are suitable for realizing the chronological exchange to verify data between definition user's the community that utilizes this computer product; It is characterized in that at least one in following restriction:

Wherein, described computer product is suitable for realizing for maintaining the method for the data integrity of authenticated exchange data acquisition between user;

Described computer product comprises computer usable medium, described computer usable medium has pseudo-random function " PRF (pseudo-random function) ", under transmit leg (exchange@A) cipher feedback pattern or take over party (exchange@B) cipher feedback coding mode for the treatment of input data;

Wherein, the gathering of all scale-of-two variable values under PRF (pseudo-random function) is called to link value;

Wherein, under transmit leg or take over party's cipher feedback pattern, the unique pseudorandom of PRF (pseudo-random function) input value of each processing ground changes each at front link value;

Community by least two users realizes the chronological exchange to verify data in described computer product;

It is the exchange take over party of verify data that the community of the user program of realizing at each switching phase place has defined exchange transmit leg and the every other user in described community that a user is verify data;

Each user's input definition data acquisition comprises frame, and this frame comprises at least one message, and each message comprises at least one word;

In each exchange, frame or coded frame that all take over party user's inputs are defined and sent by user's transmit leg, wherein, under transmit leg cipher feedback pattern, by take over party PRF (pseudo-random function), process uncoded frame, or by take over party PRF (pseudo-random function), process coded frame under take over party's cipher feedback pattern, described process is called as Hash digest, and identical for frame or coded frame Hash digest, if success, it causes the same chain ad valorem after each Hash digest in all transmit legs and take over party's PRF (pseudo-random function) variable;

The data input value of being processed under cipher feedback pattern by PRF (pseudo-random function) changes PRF (pseudo-random function) link value simultaneously uniquely, and the password mask output of generation and the combination of described data input XOR, unique coding or the decoding of described data input value are provided thus; Described coded data result or described not coding input value are recorded and are exported by the user of described computer product at the calculation stages place of each definition;

At the switching phase of each after Hash digest place immediately; Use the function of last PRF (pseudo-random function) link value, with:

By transmit leg or take over party's constant known to all users and that use, encoded, wherein, described encoded radio is unique hashed value; It is the function of the Hash digest of execution; Whether the hashed value that described take over party generates oneself coding and the exchange hashed value of transmission compare identical is proof to authenticating, and has completed the reception of take over party to last exchanges data;

By all take over party users, the transmission hashed value of transmit leg is decoded, wherein, expection decoded result is the known constant that all users use;

Under transmit leg cipher feedback pattern, utilize the maker of described PRF (pseudo-random function), generate thus unique hashed value authenticator; Or

The hashed value decoding that transmit leg is generated; Coding result is unique product of verifying of primitive frame value thus; Authentication value process consists of described PRF (pseudo-random function) process, and wherein, exporting with the above-mentioned password mask of described given value XOR combination is end value; Described authentication encoded radio in described computer product is unique derivant of frame value and is called as hashed value.

61. according to the product described in claim 60, wherein, all users carry out input processing by the initialization input value to identical, so that there is identical unique initial chaining value in all communities of user PRF (pseudo-random function), carry out their computer product PRF (pseudo-random function) of initialization; At least one turnaround sequence subsequently.

62. according to the product described in claim 60, wherein, and implementation procedure definition: before each exchange, which community of user is single exchange transmit leg, and the every other user of default definition is exchange take over party.

63. according to the product described in claim 60, wherein, in each exchange place, transmit leg is prepared frame, and in the PRF of transmit leg (pseudo-random function), described frame is carried out to Hash digest, in the PRF of transmit leg (pseudo-random function), produce thus unique link value;

Then transmit leg generates unique hashed value, and transmit leg sends primitive frame or transmit leg coded frame, and described transmit leg coded frame is to read coding output with the password mask value of this frame XOR combination optional; Connect with the hashed value that transmit leg is derived.

64. according to the product described in claim 60, and wherein, in each exchange place, each user take over party receives original sender frame or coded frame; And in the PRF of transmit leg (pseudo-random function), described frame is carried out to Hash digest, in the PRF of transmit leg (pseudo-random function), produce thus unique link value;

Then transmit leg generates unique hashed value, and transmit leg sends primitive frame or transmit leg coded frame, and described transmit leg coded frame is to read coding output with the password mask value of this frame XOR combination optional; Connect with the hashed value that transmit leg is derived.

65. according to the product described in claim 60, wherein, the end successfully exchanging at each, transmit leg and take over party's link value is identical, is ready for next exchange;

Wherein, in the similar operations sequence of two series connection, input, processing are also fed back the input data of Hash digest and the definition of hash authenticated to described PRF (pseudo-random function), thus PRF (pseudo-random function) binary variable is carried out to unique coding, wherein, the cluster set of described PRF (pseudo-random function) binary variable after each single PRF (pseudo-random function) operation is called link value; Wherein, the user-defined data that PRF (pseudo-random function) was processed are called Hash digest, for generating unique link value; And wherein, at each switching phase place, an exchange transmit leg that user is verify data, and all other users in community are exchange take over partys.

66. according to the product described in claim 60, has the tandem data set verify data that is called hashed value between communities of users.

67. according to the product described in claim 60, and wherein, the described exchange of verify data is realized by the community that comprises at least two users; And wherein, at each sequence place of exchanges data, user is that at least one other member of exchange transmit leg and described community is take over party.

68. according to the product described in claim 60, and wherein, each user-defined data acquisition is the frame that comprises at least one message, and each message comprises at least one word; And wherein, there is the unique authentication Hash value of each frame of at least one computerized data acquisition of the additional PRF (pseudo-random function) deriving from described data acquisition; Wherein, the frame in sending and receiving frame and each series connection of hashed value between the combination of mutual participant that defines number; And what in the binary storage device unit of described computer product, comprise is to comprise all pseudo-random function " PRF (for shorthand function) " link value of bit variable; Wherein, described link variable interconnects under changeable logical architecture; For carrying out the Hash digest as PRF (pseudo-random function) coding function, wherein, read alternatively coding result: wherein, generating the authentication Hash value of intermittently connecting is the coding to constant value given value; And to be included in the storer of described computer code be shadow memory, calculation stages place for definition therein receives and preserves output valve from link value variable described in each, and described computing machine is in the chronological sequence of authenticated exchange 1) carry out at least the first participant of the first participant group that freely at least one participant forms; And 2) carry out at least the second participant of the first participant group that freely at least one participant forms; And 3) carry out at least the first participant of the second participant group that freely at least one participant forms; And 4) carry out at least the second participant of the second participant group that freely at least one participant of at least one participant group forms; Wherein, between each frame transmission period, in exchange from the activation participant set of two participants only one be hashed value maker and transmit leg; Other activates participant is take over party and the authenticator of described frame and hashed value.

69. according to the product described in claim 60 or 68, and wherein, the participant transmit leg of sequence and participant take over party's the method for exchange authentication comprise:

First and follow-up transmission participant calculate Hash digest and send at least one first text frame with the additional hashed value deriving, the hashed value of described additional derivation be from described first and at least one first frame of generating of subsequent exchange participant derive; And

Also from least one second participant, receive and there is additional at least one transmission text frame that sends hashed value, and calculate the relevant Hash digest of text frame receiving at least one, and the authenticity of verifying at least one additional hashed value deriving;

And first and all subsequent Hash generate and all follow-up successful hashed value authentications after calculation procedure in, in shadow memory, after the hashed value of first and follow-up generation of at least one the first participant, preserve last link value of at least one the first participant, and after follow-up last hashed value process that receive and success identity of the first participant, also in shadow memory, preserve each last link value of at least one the first participant; Wherein,

Before last certification chain ad valorem of storing at least one the first participant in shadow memory represents and uses, last authentication Hash value link value of shadow memory storage is replaced last unverified link value that next computer program generates; Can realize thus one or more revision test Hash digest and hashed value transmission and the authentication of test hashed value.

70. 1 kinds of computer programs, comprise the computer usable medium with computer readable program code, described computer readable program code is included in the pseudo-random function using under cipher feedback pattern, and what at the storer of described computer-readable code, comprise is link value, described link value comprises all pseudo-random function bit variable, and to be included in the storer of described computer-readable code be shadow memory, for receiving and be kept at wherein given calculation stages place from all output valves of link value variable described in each, described computer readable program code is suitable for being performed, to realize for maintaining the method for the data integrity of at least one computerized frame of exchange, each frame comprises at least one message, each message is included at least one word in the frame of sending and receiving between the first exchange participant and the second exchange participant, the method of the first participant at least one first exchange participant and the exchange of the second participant comprises:

To having, at least one first text frame of the additional hashed value deriving according at least one first frame being generated by the first exchange participant is calculated, Hash digest and sending; And also receive at least one transmission text frame with additional transmission hashed value from the second participant, and calculate the relevant Hash digest of text frame receiving at least one, and the authenticity of the hashed value of described at least one the additional derivation of checking;

And first and all subsequent Hash generate and all follow-up successful hashed value authentications after calculation procedure in, in shadow memory, after the hashed value of first and follow-up generation of the first participant, preserve last link value of the first participant, and after follow-up last hashed value process that receive and success identity of the first participant, also in shadow memory, preserve each last link value of the first participant; Wherein,

In shadow memory, store last certification chain ad valorem representative of the first participant and replace with last authentication Hash value link value of formerly shadow memory storage last unverified link value that next computer program generates; Can realize thus one or more revision test Hash digest and hashed value transmission and the authentication of test hashed value.

Images