Input-trees of finite automata and application to cryptanalysis (Q1581120): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two varieties of finite automaton public key cryptosystem and digital signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalization of public key cryptosystem FAPKC4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite automaton public-key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis on a finite automaton public key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relations between \(R_ aR_ b\) transformation and canonical diagonal form of \(\lambda\)-matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing ranks of linear finite automata and complexity of FA public key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Functions / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02948867 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065473279 / rank
 
Normal rank

Latest revision as of 08:44, 30 July 2024

scientific article
Language Label Description Also known as
English
Input-trees of finite automata and application to cryptanalysis
scientific article

    Statements

    Input-trees of finite automata and application to cryptanalysis (English)
    0 references
    13 January 2002
    0 references
    weights
    0 references
    output set
    0 references
    input set
    0 references
    finite automata
    0 references
    finite automaton public key cryptosystems
    0 references
    exhaust search algorithms
    0 references
    stochastic search algorithms
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references