최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0189231 (2002-07-05) |
발명자 / 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 | 피인용 횟수 : 214 인용 특허 : 253 |
Electronic steganographic techniques can be used to encode a rights management control signal onto an information signal carried over an insecure communications channel. Steganographic techniques ensure that the digital control information is substantially invisibly and substantially indelibly carri
Electronic steganographic techniques can be used to encode a rights management control signal onto an information signal carried over an insecure communications channel. Steganographic techniques ensure that the digital control information is substantially invisibly and substantially indelibly carried by the information signal. These techniques can provide end-to-end rights management protection of an information signal irrespective of transformations between analog and digital. An electronic appliance can recover the control information and use it for electronic rights management to provide compatibility with a Virtual Distribution Environment. In one example, the system encodes low data rate pointers within high bandwidth time periods of the content signal to improve overall control information read/seek times.
Electronic steganographic techniques can be used to encode a rights management control signal onto an information signal carried over an insecure communications channel. Steganographic techniques ensure that the digital control information is substantially invisibly and substantially indelibly carri
Electronic steganographic techniques can be used to encode a rights management control signal onto an information signal carried over an insecure communications channel. Steganographic techniques ensure that the digital control information is substantially invisibly and substantially indelibly carried by the information signal. These techniques can provide end-to-end rights management protection of an information signal irrespective of transformations between analog and digital. An electronic appliance can recover the control information and use it for electronic rights management to provide compatibility with a Virtual Distribution Environment. In one example, the system encodes low data rate pointers within high bandwidth time periods of the content signal to improve overall control information read/seek times. umulating register a vector γ which is the normal basis representation of the exponentiation of g) loading the vector representing the normal basis representation of γ in each of said shift registers, h) performing a g-fold cyclic shift the binary digits of the vector in one of said shift registers where g is a factor of m-1 and g.h=m-1 to provide a vector representing y2e in said one register, i) rotating said bit elements in said shift registers and said accumulating register to generate grouped terms of the vector representing the product of γ and y2e, j) loading the vector from the accumulating register to the other of said shift registers, k) repeating steps h), i), and j) a total of g(h-1)-1 times to provide in said accumulating cell a vector of binary digits of the coefficients of the normal basis representation of the inverse of x. 2. A method according to claim 1 including the step of loading the vector representing x into one of said registers, performing a 1 cell cyclic shift to provide x2and copying the resultant vector in to the other of said registers. 3. A method of transferring coordinates of a public key in an elliptic curve cryptosystem from a first correspondent to a second correspondent connected to said first correspondent by a data communications link and having the parameters of the curve, said public key being a point on a non-supersingular elliptic curve, said coordinates including a first coordinate determining two possible points on the curve, each of said possible points having a respective second coordinate, said second coordinates having values differing in at least one but not all bit positions, said method comprising the steps of: a) said first correspondent selecting an identifying bit of said second coordinates, said second coordinates differing at the bit position of said identifying bit; b) said first correspondent using said identifying bit to generate identifying information of one of said second coordinates corresponding to said public key; c) said first correspondent forwarding to said second correspondent said first coordinate of said public key and said identifying information; d) said second correspondent computing said second coordinates from said first coordinate and said elliptic curve; e) said second correspondent using said identifying information to determine the appropriate value of said one of said second coordinates corresponding to said public key. 4. A method according to claim 3, wherein said elliptic curve is over a binary finite field. 5. A method according to claim 4, wherein selecting said identifying bit includes selecting a bit position in said first coordinate with a bit having a predetermined value, and generating said identifying information includes determining a corresponding value of the bit in said one of second coordinates at said bit position. 6. A method according to claim 5, wherein said predetermined value is 1. 7. A method according to claim 6, wherein said identifying information is equal to said corresponding value. 8. A method according to claim 7, further comprising the step of said second correspondent comparing said identifying information to the bit at said bit position in at least one of said second coordinates to choose the appropriate value of said one of said second coordinates corresponding to said public key. 9. A method according to claim 3, wherein said elliptic curve is over a field of prime characteristic. 10. A method according to claim 9, wherein said identifying information indicates to said second correspondent a subset containing said one of said second coordinates corresponding to said public key and excluding the other of said second coordinates, and for each nonzero element in said subset, the negation of the element is not in said subset. 11. A method according to claim 10, wherein said identifying information includes a value assign ed to said identified subset. 12. A method according to claim 9, wherein said identifying information indicates to said second correspondent a subset containing said one of said second coordinates corresponding to said public key and excluding the other of said second coordinates, and said identifying information includes a value assigned to said subset. 13. A method according to claim 12, wherein said subset is an interval. 14. A method of transferring coordinates of a public key in an elliptic curve cryptosystem from a first correspondent to a second correspondent connected to said first correspondent by a data communications link and having the parameters of the curve, said public key being a point on a non-supersingular elliptic curve, said coordinates including a first coordinate determining two possible points on the curve, each of said possible points having a respective second coordinate, said method comprising the steps of: a) said first correspondent forwarding to said second correspondent said first coordinate of said public key; b) said first correspondent identifying to said second correspondent a subset containing one of said second coordinates corresponding to said public key, and excluding the other of said second coordinates; c) said second correspondent computing said second coordinates from said first coordinate and said curve; d) said second correspondent determining which of said second coordinates is contained in the identified subset to thereby determine the value of said one of said second coordinates corresponding to said public key. 15. A method according to claim 14 wherein for each nonzero element in one of said subset, the negation of the element is not in said subset. 16. A method according to claim 15, wherein said subset is an interval. 17. A method according to claim 16, wherein step (b) includes transmitting a value assigned to said identified subset. 18. A method according to claim 14, wherein said subset is an interval. 19. A method according to claim 14, wherein step (b) includes transmitting a value assigned to said identified subset. 20. A method according to claim 19, wherein said subset is an interval. 21. A method of transferring coordinates of a public key in an elliptic curve cryptosysyem from a first correspondent to a second correspondent connected to said first correspondent by a data communications link and having the parameters of the curve, said public key being a point on a non-supersingular elliptic curve defined over a field Fp,said coordinates including a first coordinate determining two possible points on the curve, each of said possible points having a respective second coordinate, said method comprising the steps of: a) said first correspondent forwarding to said second correspondent said first coordinate of said public key, together with identifying information of one of said second coordinates corresponding to said public key, said identifying information indicating the Legendre symbol associated with said one of said second coordinates; b) said second correspondent computing said second coordinates from said first coordinate and said elliptic curve; and c) said second correspondent using said identifying information to determine the appropriate value of said one of second coordinates corresponding to said public key. 22. A method of transferring coordinates of a public key in an elliptic curve cryptosysytem from a first correspondent to a second correspondent connected to said first correspondent by a data communications link and having the parameters of the curve, said public key being a point on a non-supersingular elliptic curve, said coordinates including a first coordinate determining two possible points on the curve, each of said possible points having a respective second coordinate, said second coordinates having values differing in at least one but not all bit positions, said method comprising the steps of: a) said first correspond ent selecting an identifying bit of said second coordinates, said second coordinates differing at the bit position of said identifying bit; b) said first correspondent using said identifying bit to generate identifying information of one of said second coordinates corresponding to said public key; c) said first correspondent forwarding to said second correspondent said first coordinate of said point and said identifying information; whereby said second correspondent may compute said second coordinates from said first coordinate and said parameters of said elliptic curve and use said identifying information to determine the appropriate value of said one of said second coordinates corresponding to said public key. 23. A method according to claim 22, wherein said elliptic curve is over a binary finite field. 24. A method according to claim 23, wherein selecting said identifying bit includes selecting a bit position in said first coordinate with a bit having a predetermined value, and generating said identifying information includes determining a corresponding value of the bit in said one of second coordinates at said bit position. 25. A method according to claim 24, wherein said predetermined value is 1. 26. A method according to claim 25, wherein said identifying information is equal to said corresponding value. 27. A method according to claim 22, wherein said elliptic curve is over a field of prime characteristic. 28. A method according to claim 27, wherein said identifying information indicates to said second correspondent a subset containing said one of said second coordinates corresponding to said public key and excluding the other of said second coordinates, and for each nonzero element in said subset, the negation of the element is not in said subset. 29. A method according to claim 28, wherein said identifying information includes a value assigned to said identified subset. 30. A method according to claim 27, wherein said identifying information indicates to said second correspondent a subset containing said one of said second coordinates corresponding to said public key and excluding the other of said second coordinates, and said identifying information includes a value assigned to said subset. 31. A method according to claim 30, wherein said subset is an interval. 32. A method of transferring coordinates of a public key in an elliptic curve cryptosystem from a first correspondent to a second correspondent connected to said first correspondent by a data communications link and having the parameters of the curve, said public key being a point on a non-supersingular elliptic curve said coordinates including a first coordinate determining two possible points on the curve, each of said possible points having a respective second coordinate, said second coordinates having values differing in at least one but not all bit positions, said method comprising the steps of: a) said second correspondent receiving said first coordinate of said public key and identifying information of one of said second coordinates corresponding to said public key, said identifying information being computed from an identifying bit of said second coordinate, said second coordinates differing at the bit position of said identifying bit; b) said second correspondent computing said second coordinates from said first coordinate and said elliptic curve; c) said second correspondent using said identifying information to determine the appropriate value of said one of said second coordinates corresponding to said public key. 33. A method according to claim 32, wherein said elliptic curve is over a binary finite field. 34. A method according to claim 33, said identifying bit being computed by selecting a bit position in said first coordinate with a bit having a predetermined value, and said identifying information being computed by determining a corresponding value of the bit in said one of second coordinates at said bit position. 35. A method acco
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.