How to Break Shamir’s Asymmetric Basis
Identifieur interne : 000289 ( LNCS/Analysis ); précédent : 000288; suivant : 000290How to Break Shamir’s Asymmetric Basis
Auteurs : Thorsten Theobald [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1995.
Abstract
Abstract: At Crypto 93, Shamir proposed a family of signature schemes using algebraic bases. Coppersmith, Stern and Vaudenay presented an attack on one variant of the cryptosystem. Their attack does not recover the secret key. For one of the variants proposed by Shamir we show how to recover the secret key. Our attack is based on algebraic methods which are also applicable to many other instances of polynomial equations in the presence of some trapdoor condition.
Url:
DOI: 10.1007/3-540-44750-4_11
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000E08
- to stream Istex, to step Curation: 000C98
- to stream Istex, to step Checkpoint: 001157
- to stream Main, to step Merge: 002E62
- to stream Main, to step Curation: 002958
- to stream Main, to step Exploration: 002958
- to stream LNCS, to step Extraction: 000289
Links to Exploration step
ISTEX:DA8A10892421EB7B5B083E33DD65D5721E0CA01ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">How to Break Shamir’s Asymmetric Basis</title><author><name sortKey="Theobald, Thorsten" sort="Theobald, Thorsten" uniqKey="Theobald T" first="Thorsten" last="Theobald">Thorsten Theobald</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DA8A10892421EB7B5B083E33DD65D5721E0CA01A</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/3-540-44750-4_11</idno><idno type="url">https://api.istex.fr/document/DA8A10892421EB7B5B083E33DD65D5721E0CA01A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000E08</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000E08</idno><idno type="wicri:Area/Istex/Curation">000C98</idno><idno type="wicri:Area/Istex/Checkpoint">001157</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001157</idno><idno type="wicri:doubleKey">0302-9743:1995:Theobald T:how:to:break</idno><idno type="wicri:Area/Main/Merge">002E62</idno><idno type="wicri:Area/Main/Curation">002958</idno><idno type="wicri:Area/Main/Exploration">002958</idno><idno type="wicri:Area/LNCS/Extraction">000289</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">How to Break Shamir’s Asymmetric Basis</title><author><name sortKey="Theobald, Thorsten" sort="Theobald, Thorsten" uniqKey="Theobald T" first="Thorsten" last="Theobald">Thorsten Theobald</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV - Informatik, Universität Trier, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1995</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">DA8A10892421EB7B5B083E33DD65D5721E0CA01A</idno><idno type="DOI">10.1007/3-540-44750-4_11</idno><idno type="ChapterID">11</idno><idno type="ChapterID">Chap11</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: At Crypto 93, Shamir proposed a family of signature schemes using algebraic bases. Coppersmith, Stern and Vaudenay presented an attack on one variant of the cryptosystem. Their attack does not recover the secret key. For one of the variants proposed by Shamir we show how to recover the secret key. Our attack is based on algebraic methods which are also applicable to many other instances of polynomial equations in the presence of some trapdoor condition.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Theobald, Thorsten" sort="Theobald, Thorsten" uniqKey="Theobald T" first="Thorsten" last="Theobald">Thorsten Theobald</name></noRegion><name sortKey="Theobald, Thorsten" sort="Theobald, Thorsten" uniqKey="Theobald T" first="Thorsten" last="Theobald">Thorsten Theobald</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000289 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000289 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:DA8A10892421EB7B5B083E33DD65D5721E0CA01A
|texte= How to Break Shamir’s Asymmetric Basis
}}
| This area was generated with Dilib version V0.6.31. |  |