ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Sammlung
Verlag/Herausgeber
Erscheinungszeitraum
  • 1
    facet.materialart.
    Unbekannt
    Information, Vol. 10, Pages 232: Idempotent Factorizations of Square-Free Integers (2019)
    MDPI
    Details
    Publikationsdatum: 2019
    Beschreibung: We explore the class of positive integers n that admit idempotent factorizations n = p ¯ q ¯ such that λ ( n ) ∣ ( p ¯ − 1 ) ( q ¯ − 1 ) , where λ is the Carmichael lambda function. Idempotent factorizations with p ¯ and q ¯ prime have received the most attention due to their cryptographic advantages, but there are an infinite number of n with idempotent factorizations containing composite p ¯ and/or q ¯ . Idempotent factorizations are exactly those p ¯ and q ¯ that generate correctly functioning keys in the Rivest–Shamir–Adleman (RSA) 2-prime protocol with n as the modulus. While the resulting p ¯ and q ¯ have no cryptographic utility and therefore should never be employed in that capacity, idempotent factorizations warrant study in their own right as they live at the intersection of multiple hard problems in computer science and number theory. We present some analytical results here. We also demonstrate the existence of maximally idempotent integers, those n for which all bipartite factorizations are idempotent. We show how to construct them, and present preliminary results on their distribution.
    Digitale ISSN: 2078-2489
    Thema: Informatik
    Publiziert von MDPI
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    AKTUELLE ARTIKEL
  • 2
    facet.materialart.
    Unbekannt
    Information, Vol. 9, Pages 216: Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p (2018)
    MDPI
    Details
    Publikationsdatum: 2018-08-29
    Beschreibung: Information, Vol. 9, Pages 216: Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p Information doi: 10.3390/info9090216 Authors: Barry Fagin RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e and d. In some cases, specific ( s , r ) pairs can be found for which encryption and decryption will be correct for any ( e , d ) exponent pair. Certain s exist, however, for which encryption and decryption are correct for any odd prime r ∤ s . We give necessary and sufficient conditions for s with this property.
    Digitale ISSN: 2078-2489
    Thema: Informatik
    Publiziert von MDPI
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    AKTUELLE ARTIKEL
  • 3
    facet.materialart.
    Unbekannt
    Information, Vol. 9, Pages 216: Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p (2018)
    MDPI
    Details
    Publikationsdatum: 2018
    Beschreibung: RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e and d. In some cases, specific ( s , r ) pairs can be found for which encryption and decryption will be correct for any ( e , d ) exponent pair. Certain s exist, however, for which encryption and decryption are correct for any odd prime r ∤ s . We give necessary and sufficient conditions for s with this property.
    Digitale ISSN: 2078-2489
    Thema: Informatik
    Publiziert von MDPI
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    AKTUELLE ARTIKEL
  • 4
    Digitale Medien
    Digitale Medien
    Quantitative measurements of FPGA utility in special and general purpose processors (1993)
    Springer
    The journal of VLSI signal processing systems for signal, image, and video technology 6 (1993), S. 129-137 
    Details
    ISSN: 1573-109X
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Elektrotechnik, Elektronik, Nachrichtentechnik
    Notizen: Abstract We present experimental results on FPGA use in special and general purpose processors, using as case studies a computational accelerator for gene sequence analysis, an integer implementation of the DLX microprocessor and a real-time signal processor for rocket telemetry. All these devices have been successfully prototyped, and are now completely functional. We present detailed analysis of our experience with FPGAs in these machines, describing savings in chip count, power consumption, area, and cost. For all quantitites except cost, measured savings were typically an order of magnitude improvement over discrete IC implementations. References
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01607877
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 5
    facet.materialart.
    Unbekannt
    A special-purpose processor for gene sequence analysis (1993)
    Oxford University Press
    Details
    Publikationsdatum: 1993-01-01
    Print ISSN: 1367-4803
    Digitale ISSN: 1460-2059
    Thema: Biologie , Informatik , Medizin
    Publiziert von Oxford University Press
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    AKTUELLE ARTIKEL
  • 6
    facet.materialart.
    Unbekannt
    Idempotent Factorizations of Square-Free Integers (2019)
    Molecular Diversity Preservation International
    Details
    Publikationsdatum: 2019-07-06
    Beschreibung: We explore the class of positive integers n that admit idempotent factorizations n = p ¯ q ¯ such that λ ( n ) ∣ ( p ¯ − 1 ) ( q ¯ − 1 ) , where λ is the Carmichael lambda function. Idempotent factorizations with p ¯ and q ¯ prime have received the most attention due to their cryptographic advantages, but there are an infinite number of n with idempotent factorizations containing composite p ¯ and/or q ¯ . Idempotent factorizations are exactly those p ¯ and q ¯ that generate correctly functioning keys in the Rivest–Shamir–Adleman (RSA) 2-prime protocol with n as the modulus. While the resulting p ¯ and q ¯ have no cryptographic utility and therefore should never be employed in that capacity, idempotent factorizations warrant study in their own right as they live at the intersection of multiple hard problems in computer science and number theory. We present some analytical results here. We also demonstrate the existence of maximally idempotent integers, those n for which all bipartite factorizations are idempotent. We show how to construct them, and present preliminary results on their distribution.
    Digitale ISSN: 2078-2489
    Thema: Informatik
    Publiziert von Molecular Diversity Preservation International
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    AKTUELLE ARTIKEL
  • 7
    facet.materialart.
    Unbekannt
    Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p (2018)
    Molecular Diversity Preservation International
    Details
    Publikationsdatum: 2018-08-28
    Beschreibung: RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e and d. In some cases, specific ( s , r ) pairs can be found for which encryption and decryption will be correct for any ( e , d ) exponent pair. Certain s exist, however, for which encryption and decryption are correct for any odd prime r ∤ s . We give necessary and sufficient conditions for s with this property.
    Digitale ISSN: 2078-2489
    Thema: Informatik
    Publiziert von Molecular Diversity Preservation International
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    AKTUELLE ARTIKEL
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...