Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gregory G. Rose

dblp:36/2854 · DBLP profile ↗
← Back
12ranked-venue papers
7as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6 · 5 first-authorSecurity and privacy · 5 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
algebraic cryptanalysis
0.012004
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers · CRYPTO 2004
Cryptographic primitives and cryptanalysis › algebraic cryptanalysis
fast algebraic attacks
0.012004
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers · CRYPTO 2004
Cryptographic primitives and cryptanalysis
stream cipher
0.012004
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers · CRYPTO 2004
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
correlation attack
0.012000
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers · ASIACRYPT 2000
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis
0.012000
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers · ASIACRYPT 2000
Computational complexity
algebraic complexity
0.012004
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers · CRYPTO 2004

Methods — techniques the papers use, named apart from their topics

algebraic cryptanalysis · 0.1connection polynomial analysis · 0.0
YearPublicationVenuePosition
2023 Row, Row, Row Your Boat: How to Not Find Weak Keys in Pilsung
abstract
Abstract The Pilsung cipher is part of the North Korean Red Star operating system, which was leaked to the West in 2014. Initial analysis by Kryptos Logic reported a possibility of a class of weak keys due to the use of pseudo-random diffusion. Following this lead, we analyzed the cipher and identified a small class of such weak keys. We developed techniques for searching for a key that belongs to the class. After spending thousands of CPU hours, we found a supposedly weak key for a slightly weaker version of Pilsung, but the key did not behave as we expected. On further investigation we found out a crucial misunderstanding in a critical part of the cipher and that no such class of weak keys exists in Pilsung. Thus, this paper makes two main contributions to the art of cryptanalysis. First, it identifies and shows how to investigate a potential weakness in randomizing diffusion, which although does not exist in Pilsung, may affect future designs. Second, it highlights the need for early verification of results in order to identify errors before expending significant resources.
Chitchanok Chuengsatiansup, Eyal Ronen, Gregory G. Rose, Yuval Yarom
Comput. J.3
2011 Attacks on a lightweight cipher based on a multiple recursive generator
abstract
Abstract At IEEE GLOBECOM 2008, a lightweight cipher based on a Multiple Recursive Generator (MRG) was proposed for use in resource limited environment such as sensor nodes and RFID tags. This paper proposes two efficient attacks on this MRG cipher. A distinguishing attack is firstly introduced to identify the use of an MRG cipher that has a modulus suggested by its designers. It requires 218 words of ciphertext and the most significant bit of each corresponding plaintext word. Then an efficient known plaintext attack is proposed to construct the cipher's current state and generate subkeys used for all subsequent encryption. The known plaintext attack, when targeted at the MRG ciphers optimized for efficiency, only requires 2k words of known plaintext and trivial computation where k is the MRG order. Even the ciphers based on complicated and inefficient MRGs can be attacked with low complexity, e.g. in the magnitude of 212 words of known plaintext for all MRG ciphers with order 47, regardless of which MRG modulus is used. These two attacks indicate that the examined MRG cipher structure is seriously flawed. Copyright © 2010 John Wiley & Sons, Ltd.
Lu Xiao 0003, Gregory G. Rose
Secur. Commun. Networks2
2005 Security/Cryptography
Gregory G. Rose
LISA1
2004 Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Philip Hawkes, Gregory G. Rose
CRYPTO2
2003 Turing: A Fast Stream Cipher
Gregory G. Rose, Philip Hawkes
FSE1
2003 PKI/Cryptography
Gregory G. Rose
LISA1
2001 Where Has All the Crypto Gone? Long Time Coming: A Speculative and Historical Talk
Gregory G. Rose
LISA1
2001 PKI/Cryptography
Gregory G. Rose
LISA1
2000 Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers
Philip Hawkes, Gregory G. Rose
ASIACRYPT2
1999 ssmail: Opportunistic Encryption in sendmail
Damian Bentley, Gregory G. Rose, Tara Whalen
LISA2
1998 A Stream Cipher Based on Linear Feedback over GF(28)
Gregory G. Rose
ACISP1
1996 The PGP Moose - Implementation and Experience
Gregory G. Rose
LISA1