RSA Rabin least significant bits are 1 2 + 1 poly log N secure:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge, Mass.
Mass. Inst. of Technology, Laboratory for Computer Science
1984
|
| Schlagwörter: | |
| Umfang: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021896327 | ||
| 003 | DE-604 | ||
| 005 | 20220824 | ||
| 007 | t| | ||
| 008 | 910307s1984 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)14440122 | ||
| 035 | |a (DE-599)BVBBV021896327 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a QA76.M41 | |
| 088 | |a MIT LCS TM 260 | ||
| 100 | 1 | |a Chor, Benny |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a RSA Rabin least significant bits are 1 2 + 1 poly log N secure |c Benny Chor ; Oded Goldreich |
| 264 | 1 | |a Cambridge, Mass. |b Mass. Inst. of Technology, Laboratory for Computer Science |c 1984 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Cryptography |x Data processing | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kryptologie |0 (DE-588)4033329-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kryptologie |0 (DE-588)4033329-2 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Goldreich, Oded |d 1957- |e Verfasser |0 (DE-588)120549255 |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015111510 | |
Datensatz im Suchindex
| _version_ | 1818963383491231744 |
|---|---|
| any_adam_object | |
| author | Chor, Benny Goldreich, Oded 1957- |
| author_GND | (DE-588)120549255 |
| author_facet | Chor, Benny Goldreich, Oded 1957- |
| author_role | aut aut |
| author_sort | Chor, Benny |
| author_variant | b c bc o g og |
| building | Verbundindex |
| bvnumber | BV021896327 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.M41 |
| callnumber-search | QA76.M41 |
| callnumber-sort | QA 276 M41 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)14440122 (DE-599)BVBBV021896327 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01182nam a2200361zc 4500</leader><controlfield tag="001">BV021896327</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220824 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">910307s1984 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14440122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896327</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.M41</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 260</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chor, Benny</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">RSA Rabin least significant bits are 1 2 + 1 poly log N secure</subfield><subfield code="c">Benny Chor ; Oded Goldreich</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Mass. Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptography</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldreich, Oded</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120549255</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111510</subfield></datafield></record></collection> |
| id | DE-604.BV021896327 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T12:44:21Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111510 |
| oclc_num | 14440122 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 13 S. |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| publisher | Mass. Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Chor, Benny Verfasser aut RSA Rabin least significant bits are 1 2 + 1 poly log N secure Benny Chor ; Oded Goldreich Cambridge, Mass. Mass. Inst. of Technology, Laboratory for Computer Science 1984 13 S. txt rdacontent n rdamedia nc rdacarrier Datenverarbeitung Cryptography Data processing Algorithmus (DE-588)4001183-5 gnd rswk-swf Kryptologie (DE-588)4033329-2 gnd rswk-swf Kryptologie (DE-588)4033329-2 s Algorithmus (DE-588)4001183-5 s DE-604 Goldreich, Oded 1957- Verfasser (DE-588)120549255 aut |
| spellingShingle | Chor, Benny Goldreich, Oded 1957- RSA Rabin least significant bits are 1 2 + 1 poly log N secure Datenverarbeitung Cryptography Data processing Algorithmus (DE-588)4001183-5 gnd Kryptologie (DE-588)4033329-2 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4033329-2 |
| title | RSA Rabin least significant bits are 1 2 + 1 poly log N secure |
| title_auth | RSA Rabin least significant bits are 1 2 + 1 poly log N secure |
| title_exact_search | RSA Rabin least significant bits are 1 2 + 1 poly log N secure |
| title_full | RSA Rabin least significant bits are 1 2 + 1 poly log N secure Benny Chor ; Oded Goldreich |
| title_fullStr | RSA Rabin least significant bits are 1 2 + 1 poly log N secure Benny Chor ; Oded Goldreich |
| title_full_unstemmed | RSA Rabin least significant bits are 1 2 + 1 poly log N secure Benny Chor ; Oded Goldreich |
| title_short | RSA Rabin least significant bits are 1 2 + 1 poly log N secure |
| title_sort | rsa rabin least significant bits are 1 2 1 poly log n secure |
| topic | Datenverarbeitung Cryptography Data processing Algorithmus (DE-588)4001183-5 gnd Kryptologie (DE-588)4033329-2 gnd |
| topic_facet | Datenverarbeitung Cryptography Data processing Algorithmus Kryptologie |
| work_keys_str_mv | AT chorbenny rsarabinleastsignificantbitsare121polylognsecure AT goldreichoded rsarabinleastsignificantbitsare121polylognsecure |