VERIFIABLE CIPHER METHOD, TRANSMITTER TERMINAL, RECEIVER TERMINAL, VERIFIABLE CIPHER SYSTEM AND DATA TRANSMITTING/ RECEIVING METHOD
PROBLEM TO BE SOLVED: To provide a verifiable cipher method in which computational complexity is reduced. SOLUTION: In the verifiable cipher method in which a mobile communication terminal 14 verifies that the user of a mobile communication terminal 12 knows a plaintext corresponding to a cipher tex...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | OGURI NOBUYUKI |
description | PROBLEM TO BE SOLVED: To provide a verifiable cipher method in which computational complexity is reduced. SOLUTION: In the verifiable cipher method in which a mobile communication terminal 14 verifies that the user of a mobile communication terminal 12 knows a plaintext corresponding to a cipher text transmitted from the mobile communication terminal, a cipher text e=p* *h+α(mod q) of a plaintext α based on the NTRU public key cipher system and a cipher text a=p*ψ*h+ξ(mod q) of a polynomial ξ are transmitted to the mobile communication terminal 14 by the mobile communication terminal 12 and in response to a polynomial c (challenge) transmitted from the mobile communication terminal 14, polynomials x=ξ+c*α and r=ψ+c* (responses) are transmitted from the mobile communication terminal 12 to the mobile communication terminal 14. In the mobile communication terminal 14, it is verified that both the polynomials (x) and (r) are short polynomials and it is verified that the relationship of a=p*r*h+x-c*e(mod q) is fulfilled. COPYRIGHT: (C)2003,JPO |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_JP2003234735A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>JP2003234735A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_JP2003234735A3</originalsourceid><addsrcrecordid>eNrjZGgOcw3ydPN0dPJxVXD2DPBwDVLwdQ3x8HfRUQgJcvQL9vUMCQGKAbGvp5-jj45CkKuzq2cYihCmEcGRwSGuvgqOfi4KLo4hjgijPP3c9aFGAJlQq3gYWNMSc4pTeaE0N4OSm2uIs4duakF-fGpxQWJyal5qSbxXgJGBgbGRsYm5samjMVGKAKG-PXE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>VERIFIABLE CIPHER METHOD, TRANSMITTER TERMINAL, RECEIVER TERMINAL, VERIFIABLE CIPHER SYSTEM AND DATA TRANSMITTING/ RECEIVING METHOD</title><source>esp@cenet</source><creator>OGURI NOBUYUKI</creator><creatorcontrib>OGURI NOBUYUKI</creatorcontrib><description>PROBLEM TO BE SOLVED: To provide a verifiable cipher method in which computational complexity is reduced. SOLUTION: In the verifiable cipher method in which a mobile communication terminal 14 verifies that the user of a mobile communication terminal 12 knows a plaintext corresponding to a cipher text transmitted from the mobile communication terminal, a cipher text e=p* *h+α(mod q) of a plaintext α based on the NTRU public key cipher system and a cipher text a=p*ψ*h+ξ(mod q) of a polynomial ξ are transmitted to the mobile communication terminal 14 by the mobile communication terminal 12 and in response to a polynomial c (challenge) transmitted from the mobile communication terminal 14, polynomials x=ξ+c*α and r=ψ+c* (responses) are transmitted from the mobile communication terminal 12 to the mobile communication terminal 14. In the mobile communication terminal 14, it is verified that both the polynomials (x) and (r) are short polynomials and it is verified that the relationship of a=p*r*h+x-c*e(mod q) is fulfilled. COPYRIGHT: (C)2003,JPO</description><edition>7</edition><language>eng</language><subject>ADVERTISING ; CODING OR CIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHERPURPOSES INVOLVING THE NEED FOR SECRECY ; CRYPTOGRAPHY ; DISPLAY ; EDUCATION ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; PHYSICS ; SEALS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2003</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20030822&DB=EPODOC&CC=JP&NR=2003234735A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,309,781,886,25569,76552</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20030822&DB=EPODOC&CC=JP&NR=2003234735A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>OGURI NOBUYUKI</creatorcontrib><title>VERIFIABLE CIPHER METHOD, TRANSMITTER TERMINAL, RECEIVER TERMINAL, VERIFIABLE CIPHER SYSTEM AND DATA TRANSMITTING/ RECEIVING METHOD</title><description>PROBLEM TO BE SOLVED: To provide a verifiable cipher method in which computational complexity is reduced. SOLUTION: In the verifiable cipher method in which a mobile communication terminal 14 verifies that the user of a mobile communication terminal 12 knows a plaintext corresponding to a cipher text transmitted from the mobile communication terminal, a cipher text e=p* *h+α(mod q) of a plaintext α based on the NTRU public key cipher system and a cipher text a=p*ψ*h+ξ(mod q) of a polynomial ξ are transmitted to the mobile communication terminal 14 by the mobile communication terminal 12 and in response to a polynomial c (challenge) transmitted from the mobile communication terminal 14, polynomials x=ξ+c*α and r=ψ+c* (responses) are transmitted from the mobile communication terminal 12 to the mobile communication terminal 14. In the mobile communication terminal 14, it is verified that both the polynomials (x) and (r) are short polynomials and it is verified that the relationship of a=p*r*h+x-c*e(mod q) is fulfilled. COPYRIGHT: (C)2003,JPO</description><subject>ADVERTISING</subject><subject>CODING OR CIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHERPURPOSES INVOLVING THE NEED FOR SECRECY</subject><subject>CRYPTOGRAPHY</subject><subject>DISPLAY</subject><subject>EDUCATION</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>SEALS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2003</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZGgOcw3ydPN0dPJxVXD2DPBwDVLwdQ3x8HfRUQgJcvQL9vUMCQGKAbGvp5-jj45CkKuzq2cYihCmEcGRwSGuvgqOfi4KLo4hjgijPP3c9aFGAJlQq3gYWNMSc4pTeaE0N4OSm2uIs4duakF-fGpxQWJyal5qSbxXgJGBgbGRsYm5samjMVGKAKG-PXE</recordid><startdate>20030822</startdate><enddate>20030822</enddate><creator>OGURI NOBUYUKI</creator><scope>EVB</scope></search><sort><creationdate>20030822</creationdate><title>VERIFIABLE CIPHER METHOD, TRANSMITTER TERMINAL, RECEIVER TERMINAL, VERIFIABLE CIPHER SYSTEM AND DATA TRANSMITTING/ RECEIVING METHOD</title><author>OGURI NOBUYUKI</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_JP2003234735A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2003</creationdate><topic>ADVERTISING</topic><topic>CODING OR CIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHERPURPOSES INVOLVING THE NEED FOR SECRECY</topic><topic>CRYPTOGRAPHY</topic><topic>DISPLAY</topic><topic>EDUCATION</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>SEALS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>OGURI NOBUYUKI</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>OGURI NOBUYUKI</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>VERIFIABLE CIPHER METHOD, TRANSMITTER TERMINAL, RECEIVER TERMINAL, VERIFIABLE CIPHER SYSTEM AND DATA TRANSMITTING/ RECEIVING METHOD</title><date>2003-08-22</date><risdate>2003</risdate><abstract>PROBLEM TO BE SOLVED: To provide a verifiable cipher method in which computational complexity is reduced. SOLUTION: In the verifiable cipher method in which a mobile communication terminal 14 verifies that the user of a mobile communication terminal 12 knows a plaintext corresponding to a cipher text transmitted from the mobile communication terminal, a cipher text e=p* *h+α(mod q) of a plaintext α based on the NTRU public key cipher system and a cipher text a=p*ψ*h+ξ(mod q) of a polynomial ξ are transmitted to the mobile communication terminal 14 by the mobile communication terminal 12 and in response to a polynomial c (challenge) transmitted from the mobile communication terminal 14, polynomials x=ξ+c*α and r=ψ+c* (responses) are transmitted from the mobile communication terminal 12 to the mobile communication terminal 14. In the mobile communication terminal 14, it is verified that both the polynomials (x) and (r) are short polynomials and it is verified that the relationship of a=p*r*h+x-c*e(mod q) is fulfilled. COPYRIGHT: (C)2003,JPO</abstract><edition>7</edition><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_epo_espacenet_JP2003234735A |
source | esp@cenet |
subjects | ADVERTISING CODING OR CIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHERPURPOSES INVOLVING THE NEED FOR SECRECY CRYPTOGRAPHY DISPLAY EDUCATION ELECTRIC COMMUNICATION TECHNIQUE ELECTRICITY PHYSICS SEALS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION |
title | VERIFIABLE CIPHER METHOD, TRANSMITTER TERMINAL, RECEIVER TERMINAL, VERIFIABLE CIPHER SYSTEM AND DATA TRANSMITTING/ RECEIVING METHOD |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-12T15%3A26%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=OGURI%20NOBUYUKI&rft.date=2003-08-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EJP2003234735A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |